Cluster algorithm for vertex models
- 15 February 1993
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 70 (7) , 875-879
- https://doi.org/10.1103/physrevlett.70.875
Abstract
We present a new type of cluster algorithm that strongly reduces critical slowing down in simulations of vertex models. Since the clusters are closed paths of bonds, we call it the loop algorithm. The basic steps in constructing a cluster are the breakup and the freezing of vertices. We concentrate on the case of the F model, which is a subset of the six-vertex model exhibiting a Kosterlitz-Thouless transition. The loop algorithm is also applicable to simulations of other vertex models and of one- and two-dimensional quantum spin systems.Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- How to beat critical slowing-down: 1990 updateNuclear Physics B - Proceedings Supplements, 1991
- General cluster Monte Carlo dynamicsPhysical Review B, 1991
- Critical slowing downNuclear Physics B - Proceedings Supplements, 1990
- Cluster dynamics for fully frustrated systemsPhysical Review Letters, 1990
- Critical acceleration of lattice gauge simulationsJournal of Statistical Physics, 1990
- Comparison between cluster Monte Carlo algorithms in the Ising modelPhysics Letters B, 1989
- Collective Monte Carlo updating in a high precision study of the x−y modelNuclear Physics B, 1989
- Embedded dynamics fortheoryPhysical Review Letters, 1989
- Collective Monte Carlo Updating for Spin SystemsPhysical Review Letters, 1989
- Nonuniversal critical dynamics in Monte Carlo simulationsPhysical Review Letters, 1987