TY - JOUR

T1 - Rzandom-cluster dynamics in ℤ2

T2 - Rapid mixing with general boundary conditions

AU - Blanca, Antonio

AU - Gheissari, Reza

AU - Vigoda, Eric

N1 - Funding Information:
Acknowledgments. The authors thank the anonymous referee for thorough and helpful suggestions. The authors also thank Insuk Seo for detailed comments. The first and third authors were supported in part by NSF Grants CCF-1617306 and CCF-1563838.

PY - 2020/2

Y1 - 2020/2

N2 - The random-cluster model with parameters (p, q) is a random graph model that generalizes bond percolation (q = 1) and the Ising and Potts models (q ≥ 2). We study its Glauber dynamics on n × n boxes Λn of the integer lattice graph ℤ2, where the model exhibits a sharp phase transition at p = pc(q). Unlike traditional spin systems like the Ising and Potts models, the random-cluster model has non-local interactions. Long-range interactions can be imposed as external connections in the boundary of Λn, known as boundary conditions. For select boundary conditions that do not carry longrange information (namely, wired and free), Blanca and Sinclair proved that when q > 1 and p ≠ pc(q), the Glauber dynamics on Λn mixes in optimal O(n2 log n) time. In this paper, we prove that this mixing time is polynomial in n for every boundary condition that is realizable as a configuration on ℤ2\Λn. We then use this to prove near-optimal Õ(n2) mixing time for "typical"boundary conditions. As a complementary result, we construct classes of nonrealizable (nonplanar) boundary conditions inducing slow (stretchedexponential) mixing at p≪pc.

AB - The random-cluster model with parameters (p, q) is a random graph model that generalizes bond percolation (q = 1) and the Ising and Potts models (q ≥ 2). We study its Glauber dynamics on n × n boxes Λn of the integer lattice graph ℤ2, where the model exhibits a sharp phase transition at p = pc(q). Unlike traditional spin systems like the Ising and Potts models, the random-cluster model has non-local interactions. Long-range interactions can be imposed as external connections in the boundary of Λn, known as boundary conditions. For select boundary conditions that do not carry longrange information (namely, wired and free), Blanca and Sinclair proved that when q > 1 and p ≠ pc(q), the Glauber dynamics on Λn mixes in optimal O(n2 log n) time. In this paper, we prove that this mixing time is polynomial in n for every boundary condition that is realizable as a configuration on ℤ2\Λn. We then use this to prove near-optimal Õ(n2) mixing time for "typical"boundary conditions. As a complementary result, we construct classes of nonrealizable (nonplanar) boundary conditions inducing slow (stretchedexponential) mixing at p≪pc.

UR - http://www.scopus.com/inward/record.url?scp=85087555721&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85087555721&partnerID=8YFLogxK

U2 - 10.1214/19-AAP1505

DO - 10.1214/19-AAP1505

M3 - Article

AN - SCOPUS:85087555721

VL - 30

SP - 418

EP - 459

JO - Annals of Applied Probability

JF - Annals of Applied Probability

SN - 1050-5164

IS - 1

ER -