Random-cluster dynamics on random regular graphs in tree uniqueness
arXiv:2008.02264 · doi:10.1007/s00220-021-04093-z
Abstract
We establish rapid mixing of the random-cluster Glauber dynamics on random -regular graphs for all and , where the threshold corresponds to a uniqueness/non-uniqueness phase transition for the random-cluster model on the (infinite) -regular tree. It is expected that this threshold is sharp, and for the Glauber dynamics on random -regular graphs undergoes an exponential slowdown at . More precisely, we show that for every , , and , with probability over the choice of a random -regular graph on vertices, the Glauber dynamics for the random-cluster model has mixing time. As a corollary, we deduce fast mixing of the Swendsen--Wang dynamics for the Potts model on random -regular graphs for every , in the tree uniqueness region. Our proof relies on a sharp bound on the "shattering time", i.e., the number of steps required to break up any configuration into sized clusters. This is established by analyzing a delicate and novel iterative scheme to simultaneously reveal the underlying random graph with clusters of the Glauber dynamics configuration on it, at a given time.
35 pages, 6 figures
References in corpus (9)
- The Random-Cluster Model
- Phase Transitions in the Coloring of Random Graphs
- Ising models on locally tree-like graphs
- Perfect Sampling Using Bounding Chains
- Exact thresholds for Ising-Gibbs samplers on general graphs
- Factor models on locally tree-like graphs
- Glauber Dynamics for the mean-field Potts Model
- Comparison of Swendsen-Wang and Heat-Bath Dynamics
- Rapid mixing of Swendsen-Wang dynamics in two dimensions