Sampling from Potts on random graphs of unbounded degree via random-cluster dynamics
Antonio Blanca, Reza Gheissari

TL;DR
This paper proves that the random-cluster Glauber dynamics efficiently samples the ferromagnetic Potts model on various random graphs, including Erdős–Rényi graphs, revealing a computational advantage over Potts Glauber dynamics at high temperatures.
Contribution
It establishes optimal mixing times for the random-cluster Glauber dynamics on random graphs with bounded degree, including Erdős–Rényi graphs, and demonstrates a computational advantage over Potts Glauber dynamics.
Findings
Random-cluster Glauber dynamics mixes in r(n log n) steps.
Provides the first polynomial-time sampling algorithm for the Potts model on Erd51sRe9nyi graphs.
Shows exponential lower bounds for Potts Glauber dynamics mixing times.
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 and a cluster weight . We establish that for every , the random-cluster Glauber dynamics mixes in optimal steps on -vertex random graphs having a prescribed degree sequence with bounded average branching throughout the full high-temperature uniqueness regime . The family of random graph models we consider includes the Erd\H{o}s--R\'enyi random graph , and so we provide the first polynomial-time sampling algorithm for the ferromagnetic Potts model on Erd\H{o}s--R\'enyi random graphs for the full tree uniqueness regime. We accompany our results with…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
