Cutoff for the Swendsen-Wang dynamics on the complete graph
Antonio Blanca, Zhezheng Song
TL;DR
This work resolves the mixing-time behavior of Swendsen–Wang dynamics for the $q$-state mean-field Potts model on the complete graph in the low-temperature regime $β>q$. By constructing a multi-phase coupling and introducing a $q\times q$ projection to the majority vector, the authors prove a sharp cutoff: the mixing time is $τ_{\rm mix}^{\mathrm{SW}} = c(β,q) \log n + Θ(1)$, with the constant $c(β,q)$ depending explicitly on the derivative at the drift-function fixed point $a(β,q)$. The analysis hinges on the drift function $F$ governing the evolution of the largest color class, percolation-based random-graph controls for the SW steps, and a projection-chain coupling that aligns color counts across copies. These techniques yield a precise, finite-window cutoff result in a regime where previous work only showed $Θ(\log n)$ growth, highlighting both the dynamics' sharp transition and its algorithmic implications for sampling from the Potts model on complete graphs.
Abstract
We study the speed of convergence of the Swendsen-Wang (SW) dynamics for the $q$-state ferromagnetic Potts model on the $n$-vertex complete graph, known as the mean-field model. The SW dynamics was introduced as an attractive alternative to the local Glauber dynamics, often offering faster convergence rates to stationarity in a variety of settings. A series of works have characterized the asymptotic behavior of the speed of convergence of the mean-field SW dynamics for all $q \ge 2$ and all values of the inverse temperature parameter $β> 0$. In particular, it is known that when $β> q$ the mixing time of the SW dynamics is $Θ(\log n)$. We strengthen this result by showing that for all $β> q$, there exists a constant $c(β,q) > 0$ such that the mixing time of the SW dynamics is $c(β,q) \log n + Θ(1)$. This implies that the mean-field SW dynamics exhibits the cutoff phenomenon in this temperature regime, demonstrating that this Markov chain undergoes a sharp transition from ''far from stationarity'' to ''well-mixed'' within a narrow $Θ(1)$ time window. The presence of cutoff is algorithmically significant, as simulating the chain for fewer steps than its mixing time could lead to highly biased samples.
