Sampling from Potts on random graphs of unbounded degree via random-cluster dynamics

Abstract

We consider the problem of sampling from the ferromagnetic Potts and random-cluster models on a general family of random graphs via the Glauber dynamics for the random-cluster model. The random-cluster model is parametrized by an edge probability $\mathit{p}\in (0,1)$ and a cluster weight $\mathit{q}>0$. We establish that for every $\mathit{q}\ge 1$, the random-cluster Glauber dynamics mixes in optimal $\mathrm{\Theta }(\mathit{n}log\mathit{n})$ steps on n-vertex random graphs having a prescribed degree sequence with bounded average branching γ throughout the full high-temperature uniqueness regime $\mathit{p}<{\mathit{p}}_{\mathit{u}}(\mathit{q},\mathit{\gamma })$.

The family of random graph models we consider includes the Erdős–Rényi random graph $\mathit{G}(\mathit{n},\mathit{\gamma }/\mathit{n})$, and so we provide the first polynomial-time sampling algorithm for the ferromagnetic Potts model on Erdős–Rényi random graphs for the full tree uniqueness regime. We accompany our results with mixing time lower bounds (exponential in the largest degree) for the Potts Glauber dynamics, in the same settings where our $\mathrm{\Theta }(\mathit{n}log\mathit{n})$ bounds for the random-cluster Glauber dynamics apply. This reveals a novel and significant computational advantage of random-cluster based algorithms for sampling from the Potts model at high temperatures.