The worm algorithm for the Ising model is rapidly mixing
classification
🧮 math-ph
cond-mat.stat-mechcs.DMmath.COmath.MPmath.PR
keywords
isingalgorithmmixingmodelwormapproximationconstructcorollary
read the original abstract
We prove rapid mixing of the Prokofiev-Svistunov (or worm) algorithm for the zero-field ferromagnetic Ising model, on all finite graphs and at all temperatures. As a corollary, we show how to rigorously construct simple and efficient approximation schemes for the Ising susceptibility and two-point correlation function.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.