The Annals of Applied Probability
- Ann. Appl. Probab.
- Volume 28, Number 2 (2018), 1292-1313.
Random cluster dynamics for the Ising model is rapidly mixing
We show that the mixing time of Glauber (single edge update) dynamics for the random cluster model at $q=2$ on an arbitrary $n$-vertex graph is bounded by a polynomial in $n$. As a consequence, the Swendsen–Wang algorithm for the ferromagnetic Ising model at any temperature also has a polynomial mixing time bound.
Ann. Appl. Probab., Volume 28, Number 2 (2018), 1292-1313.
Received: December 2016
Revised: April 2017
First available in Project Euclid: 11 April 2018
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Guo, Heng; Jerrum, Mark. Random cluster dynamics for the Ising model is rapidly mixing. Ann. Appl. Probab. 28 (2018), no. 2, 1292--1313. doi:10.1214/17-AAP1335. https://projecteuclid.org/euclid.aoap/1523433636