Near linear mixing of random-cluster Glauber dynamics on random regular graphs
math.PR, cs.DS, math-ph, math.MP
Submitted: 2026-11-04
Updated: 2026-11-04
Comments: 37 pages
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Sources
- Random cluster models on random graphs
- Characterizing the limiting critical Potts measures on locally regular-tree-like expander graphs
- Rapid phase ordering for Ising and Potts dynamics on random regular graphs
- Annealed Potts models on rank-1 inhomogeneous random graphs
- Automated Conjecture Resolution with Formal Verification
- Improved rapid phase ordering for Ising dynamics on random regular graphs
- Danus: Orchestrating Mathematical Reasoning Agents with Fact-Graph Memory
Related papers
- Rank-One HCIZ Integrals and Multiplicative Convolutions
- Repeated averaging on random d-regular graphs
- Precise cover times for branching random walks on Hamming graphs: (iterated) logarithmic corrections
- Markov Chain CLTs: Resolving Open Problems
- Marked stable L'evy processes in Brownian local time
- A Sharp Refinement of Samuels' Inequality via Cap Moves