Random cluster dynamics for the Ising model is rapidly mixing

Abstract

We show 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.

Cited by in corpus (3)

• Active spanning trees and Schramm-Loewner evolution
• Mathematical Mechanism on Dynamical System Algorithms of the Ising Model
• On the coupling time of the heat-bath process for the Fortuin-Kasteleyn random-cluster model