arXiv (All)
open access
Mixing Times of Switch Chains via High-Dimensional Expansion
The switch chain is a Markov chain defined on the set of labelled realizations of a given graphical degree sequence. At each step, a pair of vertex-disjoint edges is chosen at random and the process attempts to replace them with a uniformly chosen perfect matching of the same four vertices, rejectin
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Mixing of general biased adjacent transposition chains#629854
- Mixing of general biased adjacent transposition chains#627992
- On the distribution of addition chains#158586
- Moment Methods for Uniform Average Mixing on Strongly Regular Graphs#1234384
- Flip Dynamics for Sampling Colorings: Improving $(11/6-ε)$ Using a Simple Metric#1062747
Record · ID 1233545
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive