Ergodicity of the Wang--Swendsen--Koteck\'y algorithm on several classes of lattices on the torus
Jes\'us Salas, Alan D. Sokal

TL;DR
This paper proves the ergodicity of the Wang--Swendsen--Kotecký algorithm for certain classes of lattices on the torus, expanding understanding of its behavior in statistical mechanics models.
Contribution
It establishes ergodicity conditions for the WSK algorithm on various toroidal lattices, including quadrangulations and Eulerian triangulations, for specific q-values.
Findings
WSK is ergodic for q≥4 on quadrangulations of girth ≥4
Ergodicity holds for q≥5 on certain Eulerian triangulations
Includes many lattices relevant in statistical mechanics
Abstract
We prove the ergodicity of the Wang--Swendsen--Koteck\'y (WSK) algorithm for the zero-temperature -state Potts antiferromagnet on several classes of lattices on the torus. In particular, the WSK algorithm is ergodic for on any quadrangulation of the torus of girth . It is also ergodic for (resp. ) on any Eulerian triangulation of the torus such that one sublattice consists of degree-4 vertices while the other two sublattices induce a quadrangulation of girth (resp.~a bipartite quadrangulation) of the torus. These classes include many lattices of interest in statistical mechanics.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
