Random cluster dynamics for the Ising model is rapidly mixing
Annals of Applied Probability
MetadataShow full item record
We show for the first time that the mixing time of Glauber (single edge update) dynamics for the random cluster model at q = 2 is bounded by a polynomial in the size of the underlying graph. As a consequence, the Swendsen- Wang algorithm for the ferromagnetic Ising model at any temperature has the same polynomial mixing time bound.
AuthorsJERRUM, MR; Guo, H
- College Publications