arXiv · cond-mat/9211006
Cluster Algorithm for Vertex Models
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 {\em loop algorithm}. The basic steps in constructing a cluster are the break-up and the freezing of vertices. We concentrate on the case of the F model, which is a subset of the 6-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.
Explore related subjects
Keep this discovery
H. G. Evertz, G. Lana, M. Marcu. 1992-11-16. Cluster Algorithm for Vertex Models. https://doi.org/10.1103/physrevlett.70.875
Cite the original work for its findings. Save a collection to share your selection of sources.