A triangle process on regular graphs

DOI10.1007/978-3-030-79987-8_22OpenAlexW3186682637MaRDI QIDQ2115867

Colin Cooper, Catherine Greenhill, Martin Dyer

Publication date: 22 March 2022

Full work available at URL: https://arxiv.org/abs/2012.12972

zbMATH Keywords

Markov chainsregular graphsirreducibilitytriangles

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A sequential algorithm for generating random graphs
• A simple criterion on degree sequences of graphs
• The switch Markov chain for sampling irregular graphs and digraphs
• The flip Markov chain for connected regular graphs
• Transformations of cubic graphs
• Towards random uniform sampling of bipartite graphs with given degree sequence
• Introduction to reconfiguration
• Expanders via Local Edge Flips
• Uniform Generation of Random Regular Graphs
• Rapid mixing of the switch Markov chain for strongly stable degree sequences
• Sampling Regular Graphs and a Peer-to-Peer Network

This page was built for publication: A triangle process on regular graphs