Worm Algorithms for Classical Statistical Models
Top Cited Papers
- 27 September 2001
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 87 (16) , 160601
- https://doi.org/10.1103/physrevlett.87.160601
Abstract
We show that high-temperature expansions provide a basis for the novel approach to efficient Monte Carlo simulations. “Worm” algorithms utilize the idea of updating closed-path configurations (produced by high-temperature expansions) through the motion of end points of a disconnected path. An amazing result is that local, Metropolis-type schemes using this approach appear to have dynamical critical exponents close to zero (i.e., their efficiency is comparable to the best cluster methods) as proved by finite-size scaling of the autocorrelation time for various universality classes.Keywords
All Related Versions
This publication has 15 references indexed in Scilit:
- “Worm” algorithm in quantum Monte Carlo simulationsPhysics Letters A, 1998
- Invaded Cluster Algorithm for Equilibrium Critical PointsPhysical Review Letters, 1995
- Cluster algorithm for vertex modelsPhysical Review Letters, 1993
- Rigorous lower bound on the dynamic critical exponents of the Swendsen-Wang algorithmPhysical Review Letters, 1989
- Collective Monte Carlo Updating for Spin SystemsPhysical Review Letters, 1989
- Statistical Field TheoryPhysics Today, 1988
- Path-integral computation of superfluid densitiesPhysical Review B, 1987
- Nonuniversal critical dynamics in Monte Carlo simulationsPhysical Review Letters, 1987
- Critical Slowing Down in the Kinetic Ising ModelJournal of the Physics Society Japan, 1969
- Equation of State Calculations by Fast Computing MachinesThe Journal of Chemical Physics, 1953