论文信息 - The worm algorithm for the Ising model is rapidly mixing

The worm algorithm for the Ising model is rapidly mixing

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.

[1] Colin J. Thompson,et al. Mathematical Statistical Mechanics , 1972 .

[2] Dan Suciu,et al. Journal of the ACM , 2006 .

[3] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.

[4] Niels Henrik David Bohr,et al. Proceedings of the Cambridge Philosophical Society , 1843 .

[5] Reinhard Diestel,et al. Graph Theory , 1997 .

[6] Ericka Stricklin-Parker,et al. Ann , 2005 .

[7] Mario Ullrich. Rapid mixing of Swendsen–Wang dynamics in two dimensions , 2012, 1212.4908.

[8] Asaf Nachmias,et al. A power law of order 1/4 for critical mean-field Swendsen-Wang dynamics , 2011 .

[9] Geoffrey Grimmett. The Random-Cluster Model , 2002, math/0205237.

[10] F. Jotzo,et al. Double counting and the Paris Agreement rulebook , 2019, Science.

[11] V. Climenhaga. Markov chains and mixing times , 2013 .

[12] Bimal Kumar Roy,et al. Counting, sampling and integrating: Algorithms and complexity , 2013 .