The flip Markov chain for connected regular graphs
From MaRDI portal
Publication:1720312
DOI10.1016/j.dam.2018.06.019zbMath1404.05102arXiv1701.03856OpenAlexW2963122451MaRDI QIDQ1720312
Martin Dyer, Colin Cooper, Andrew Handley, Catherine Greenhill
Publication date: 8 February 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.03856
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Connectivity (05C40)
Related Items (3)
Sharp Poincaré and log-Sobolev inequalities for the switch chain on regular bipartite graphs ⋮ Rapid Mixing of the Switch Markov Chain for 2-Class Joint Degree Matrices ⋮ A triangle process on regular graphs
Cites Work
- The asymptotic number of labeled graphs with given degree sequences
- Comparison theorems for reversible Markov chains
- Approximating the Permanent
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- Expanders via Local Edge Flips
- The flip markov chain and a randomising P2P protocol
- Sampling Regular Graphs and a Peer-to-Peer Network
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The flip Markov chain for connected regular graphs
