Rapid Mixing on Random Regular Graphs beyond Uniqueness
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914151509524480 |
|---|---|
| author | Chen, Xiaoyu Chen, Zejia Chen, Zongchen Yin, Yitong Zhang, Xinyuan |
| author_facet | Chen, Xiaoyu Chen, Zejia Chen, Zongchen Yin, Yitong Zhang, Xinyuan |
| contents | The hardcore model is a fundamental probabilistic model extensively studied in statistical physics, probability theory, and computer science. For graphs of maximum degree $Δ$, a well-known computational phase transition occurs at the tree-uniqueness threshold $λ_c(Δ) = \frac{(Δ-1)^{Δ-1}}{(Δ-2)^Δ}$, where the mixing behavior of the Glauber dynamics (a simple Markov chain) undergoes a sharp transition.
It is conjectured that random regular graphs exhibit different mixing behavior, with the slowdown occurring far beyond the uniqueness threshold. We confirm this conjecture by showing that, for the hardcore model on random $Δ$-regular graphs, the Glauber dynamics mixes rapidly with high probability when $λ= O(1/\sqrtΔ)$, which is significantly beyond the uniqueness threshold $λ_c(Δ) \approx e/Δ$. Our result establishes a sharp distinction between the hardcore model on worst-case and beyond-worst-case instances, showing that the worst-case and average-case complexities of sampling and counting are fundamentally different.
This result of rapid mixing on random instances follows from a new criterion we establish for rapid mixing of Glauber dynamics for any distribution supported on a downward closed set family. Our criterion is simple, general, and easy to check. In addition to proving new mixing conditions for the hardcore model, we also establish improved mixing time bounds for sampling uniform matchings or $b$ matchings on graphs, the random cluster model on matroids with $q \in [0,1)$, and the determinantal point process. Our proof of this new criterion for rapid mixing combines and generalizes several recent tools in a novel way, including a trickle down theorem for field dynamics, spectral/entropic stability, and a new comparison result between field dynamics and Glauber dynamics. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_03406 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Rapid Mixing on Random Regular Graphs beyond Uniqueness Chen, Xiaoyu Chen, Zejia Chen, Zongchen Yin, Yitong Zhang, Xinyuan Data Structures and Algorithms Probability The hardcore model is a fundamental probabilistic model extensively studied in statistical physics, probability theory, and computer science. For graphs of maximum degree $Δ$, a well-known computational phase transition occurs at the tree-uniqueness threshold $λ_c(Δ) = \frac{(Δ-1)^{Δ-1}}{(Δ-2)^Δ}$, where the mixing behavior of the Glauber dynamics (a simple Markov chain) undergoes a sharp transition. It is conjectured that random regular graphs exhibit different mixing behavior, with the slowdown occurring far beyond the uniqueness threshold. We confirm this conjecture by showing that, for the hardcore model on random $Δ$-regular graphs, the Glauber dynamics mixes rapidly with high probability when $λ= O(1/\sqrtΔ)$, which is significantly beyond the uniqueness threshold $λ_c(Δ) \approx e/Δ$. Our result establishes a sharp distinction between the hardcore model on worst-case and beyond-worst-case instances, showing that the worst-case and average-case complexities of sampling and counting are fundamentally different. This result of rapid mixing on random instances follows from a new criterion we establish for rapid mixing of Glauber dynamics for any distribution supported on a downward closed set family. Our criterion is simple, general, and easy to check. In addition to proving new mixing conditions for the hardcore model, we also establish improved mixing time bounds for sampling uniform matchings or $b$ matchings on graphs, the random cluster model on matroids with $q \in [0,1)$, and the determinantal point process. Our proof of this new criterion for rapid mixing combines and generalizes several recent tools in a novel way, including a trickle down theorem for field dynamics, spectral/entropic stability, and a new comparison result between field dynamics and Glauber dynamics. |
| title | Rapid Mixing on Random Regular Graphs beyond Uniqueness |
| topic | Data Structures and Algorithms Probability |
| url | https://arxiv.org/abs/2504.03406 |