Abstract
Switches are operations which make local changes to the edges of a graph, usually with the aim of preserving the vertex degrees. We study a restricted set of switches, called triangle switches. Each triangle switch creates or deletes at least one triangle. Triangle switches can be used to define Markov chains which generate graphs with a given degree sequence and with many more triangles (3-cycles) than is typical in a uniformly random graph with the same degrees. We show that the set of triangle switches connects the set of all d-regular graphs on n vertices, for all \(d \ge 3\). Hence, any Markov chain which assigns positive probability to all triangle switches is irreducible on these graphs. We also investigate this question for 2-regular graphs.
Dyer supported by EPSRC grant EP/S016562/1,“Sampling in hereditary classes”, Greenhill by Australian Research Council grant DP190100977.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Allen-Zhu, Z., Bhaskara, A., Lattanzi, S., Mirrokni, V., Orecchia, L.: Expanders via local edge flips. In: Proceedings of 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2016), pp. 259–269 (2018)
Amanatidis, G., Kleer, P.: Rapid mixing of the switch Markov chain for strongly stable degree sequences. Random Struct. Algorithms 57, 637–657 (2020)
Bayati, M., Kim, J.H., Saberi, A.: A sequential algorithm for generating random graphs. Algorithmica 58, 860–910 (2010)
Bollobás, B.: Random Graphs, 2nd edn. Cambridge University Press, Cambridge (2001)
Cooper, C., Dyer, M., Greenhill, C.: Sampling regular graphs and a peer-to-peer network. Comb. Probab. Comput. 16, 557–593 (2007)
Cooper, C., Dyer, M., Greenhill, C.: Triangle-creation processes on cubic graphs, arXiv:1905.04490 (2019)
Cooper, C., Dyer, M., Greenhill, C.: A triangle process on regular graphs, arXiv: 2012.12972 (2020)
Cooper, C., Dyer, M., Greenhill, C., Handley, A.: The flip Markov chain for connected regular graphs. Discret. Appl. Math. 254, 56–79 (2019)
Erdős, P., Gallai, T.: Graphs with prescribed degree of vertices. Matematikai Lapok 11, 264–274 (1960)
Feder, T., Guetz, A., Mihail, M., Saberi, A.: A local switch Markov chain on given degree graphs with application in connectivity of peer-to-peer networks. In: Proceedings of 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 69–76 (2006)
Gao, P., Wormald, N.: Uniform generation of random regular graphs. SIAM J. Comput. 46, 1395–1427 (2017)
Goodreau, S.M., Kitts, J.A., Morris, M.: Birds of a feather, or friend of a friend? Using exponential random graph models to investigate adolescent social networks. Demography 46, 103–125 (2009)
Greenhill, C., Sfragara, M.: The switch Markov chain for sampling irregular graphs and digraphs. Theoret. Comput. Sci. 719, 1–20 (2018)
Jin, E.M., Girvan, M., Newman, M.E.J.: Structure of growing social networks. Phys. Rev. E 64, 046132 (2001)
Kannan, R., Tetali, P., Vempala, S.: Simple Markov chain algorithms for generating random bipartite graphs and tournaments. Random Struct. Algorithms 14, 293–308 (1999)
Lowcay, C., Marsland, S., McCartin, C.: Constrained switching in graphs: a constructive proof. In: 2013 International Conference on Signal-Image Technology and Internet-Based Systems, pp. 599–604 (2013)
Mahlmann, P., Schindelhauer, C.: Peer-to-peer networks based on random transformations of connected regular undirected graphs. In: Proceedings of 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), pp. 155–164 (2005)
Miklos, I., Erdős, P., Soukup, L.: Towards random uniform sampling of bipartite graphs with given degree sequence. Electron. J. Comb. 20, #P16 (2013)
Nishimura, N.: Introduction to reconfiguration. Algorithms 11, 52 (2018)
Taylor, R.: Contrained switchings in graphs. In: McAvaney, K.L. (ed.) Combinatorial Mathematics VIII. LNM, vol. 884, pp. 314–336. Springer, Heidelberg (1981). https://doi.org/10.1007/BFb0091828
Tikhomirov, K., Youssef, P.: Sharp Poincaré and log-Sobolev inequalities for the switch chain on regular bipartite graphs, arXiv:2007.02729 (2020)
Tripathi, A., Tyagi, H.: A simple criterion on degree sequences of graphs. Discret. Appl. Math. 156, 3513–3517 (2008)
Tsuki, T.: Transformations of cubic graphs. J. Franklin Inst. 33(B).4, 565–575 (1996)
West, D.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Hoboken (2000)
Wormald, N.: Models of random regular graphs. In: Surveys in Combinatorics 1999. London Mathematical Society Lecture Notes Series, vol. 267, pp. 239–298 (1999)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Cooper, C., Dyer, M., Greenhill, C. (2021). A Triangle Process on Regular Graphs. In: Flocchini, P., Moura, L. (eds) Combinatorial Algorithms. IWOCA 2021. Lecture Notes in Computer Science(), vol 12757. Springer, Cham. https://doi.org/10.1007/978-3-030-79987-8_22
Download citation
DOI: https://doi.org/10.1007/978-3-030-79987-8_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-79986-1
Online ISBN: 978-3-030-79987-8
eBook Packages: Computer ScienceComputer Science (R0)