Type: Article
Publication Date: 2018-04-01
Citations: 28
DOI: https://doi.org/10.1214/17-aap1335
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.