Random cluster dynamics for the Ising model is rapidly mixing
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 …