The worm algorithm for the Ising model is rapidly mixing
From MaRDI portal
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 page was built for publication: The worm algorithm for the Ising model is rapidly mixing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6254684)
