2000 character limit reached
The worm algorithm for the Ising model is rapidly mixing
Published 16 Sep 2014 in math-ph, cond-mat.stat-mech, cs.DM, math.CO, math.MP, and math.PR | (1409.4484v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.