Metraipolis › archive › dc_d8aa2d360381
Rapid mixing of Potts Glauber dynamics throughout uniqueness — arXiv:2610.42059
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.42059
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T05:43:35.758Z
- SHA-256 of the archived text
b8bd7ff2b6d5b316d2438f5c4f10c2ba022fcaa532d2c6239ce5d35e4f7c07c3- Stable URL of this page
https://metraipolis.com/documento/dc_d8aa2d360381
How to cite
Rapid mixing of Potts Glauber dynamics throughout uniqueness — arXiv:2610.42059 — arXiv (en), https://arxiv.org/abs/2610.42059 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d8aa2d360381 (Metraipolis archive dc_d8aa2d360381, sha256 b8bd7ff2b6d5b316d2438f5c4f10c2ba022fcaa532d2c6239ce5d35e4f7c07c3)
BibTeX
@misc{dcd8aa2d360381,
title = {Rapid mixing of Potts Glauber dynamics throughout uniqueness — arXiv:2610.42059},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.42059},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d8aa2d360381; sha256 b8bd7ff2b6d5b316d2438f5c4f10c2ba022fcaa532d2c6239ce5d35e4f7c07c3},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.42059. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Sampling from the ferromagnetic $q$-state Potts model is a fundamental problem in statistical physics and approximate counting. Although computationally hard in the worst case, sampling is expected to be efficient throughout the high-temperature uniqueness regime of the model using the natural single-site Glauber dynamics. We establish fast mixing bounds for every $q$, in the full high-temperature regimes in the two central graph families on $n$ vertices. (1) For every $\Delta\ge 3$, the Potts Glauber dynamics mixes in $n\operatorname{polylog}(n)$ steps with high probability on a uniformly random $\Delta$-regular graph for all $\beta<\beta_u(q,\mathbb T_\Delta)$ where $\beta_u(q,\mathbb T_\Delta)$ is the uniqueness threshold on the $\Delta$-regular tree; (2) For every $d\ge 2$, the Potts Glauber dynamics has inverse spectral gap $n^{1+o(1)}$ on cubes or tori in $\mathbb Z^d$ for all $\beta<\beta_c(q,\mathbb Z^d)$ where $\beta_c(q,\mathbb Z^d)$ is the critical point on $\mathbb Z^d$. Both temperature thresholds are sharp as the Glauber dynamics slows down exponentially above them. These results overcome the challenge of bounding mixing times without access to correlation decay bounds in the presence of pinnings (i.e., without spectral independence or strong spatial mixing). For this purpose, our proof introduces a new dichotomy principle: throughout the high-temperature regime, any initial spin distribution is either such that its pinnings ensure good correlation decay, or Glauber dynamics escapes from that distribution quickly. We expect this kind of dichotomy to have further applications. As a demonstration, we also develop its analog for random-cluster dynamics and use it to prove that Swendsen-Wang dynamics on random $\Delta$-regular graphs mixes in $O(\log n)$ time throughout uniqueness. The results in this paper were arrived at with the assistance of ChatGPT 5.6 and 6.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.PR, nuovi lavori del giorno).
Categorie arXiv: Probability (math.PR) ; Discrete Mathematics (cs.DM); Mathematical Physics (math-ph).
Pagina del lavoro: https://arxiv.org/abs/2610.42059 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T05:31:46.413Z dalla pagina https://arxiv.org/list/math.PR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).