Mixing time of the swap Markov chain and \(P\)-stability
From MaRDI portal
Publication:6621197
Daniel Soltész, Catherine Greenhill, Péter L. Erdős, Lajos Soukup, Tamás Róbert Mezei, István Miklós
Publication date: 18 October 2024
Published in: Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)
Random graphs (graph-theoretic aspects) (05C80) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Cites Work
- Title not available (Why is that?)
- A polynomial bound on the mixing time of a Markov chain for sampling regular directed graphs
- Enumeration of graphs with a heavy-tailed degree sequence
- Fast uniform generation of regular graphs
- The switch Markov chain for sampling irregular graphs and digraphs
- Towards random uniform sampling of bipartite graphs with given degree sequence
- Approximating the Permanent
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- Uniform generation of random graphs with power-law degree sequences
- Rapid Mixing of the Switch Markov Chain for Strongly Stable Degree Sequences and 2-Class Joint Degree Matrices
- Sampling Regular Graphs and a Peer-to-Peer Network
This page was built for publication: Mixing time of the swap Markov chain and \(P\)-stability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6621197)
