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

Antonio Blanca, Reza Gheissari

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 $p \in (0,1)$ and a cluster weight $q > 0$. We establish that for every $q\ge 1$, the random-cluster Glauber dynamics mixes in optimal $\Theta(n\log n)$ steps on $n$-vertex random graphs having a prescribed degree sequence with bounded average branching $\gamma$, throughout the uniqueness regime $p

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment