Cluster Algorithm for Vertex Models
Condensed Matter
2009-01-23 v1 High Energy Physics - Lattice
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.
Cite
@article{arxiv.cond-mat/9211006,
title = {Cluster Algorithm for Vertex Models},
author = {H. G. Evertz and G. Lana and M. Marcu},
journal= {arXiv preprint arXiv:cond-mat/9211006},
year = {2009}
}
Comments
9 pages, Latex, 2 figures in Latex, FSU-SCRI-92-164