Random cluster dynamics for the Ising model is rapidly mixing
Data Structures and Algorithms
2016-05-03 v1 Probability
Abstract
We show that the mixing time of Glauber (single edge update) dynamics for the random cluster model at 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.
Cite
@article{arxiv.1605.00139,
title = {Random cluster dynamics for the Ising model is rapidly mixing},
author = {Heng Guo and Mark Jerrum},
journal= {arXiv preprint arXiv:1605.00139},
year = {2016}
}