Cluster Algorithm for Vertex Models

Simple item page
dc.creatorEvertz, H. G.
dc.creatorLana, G.
dc.creatorMarcu, M.
dc.date1992-11-16
dc.date.accessioned2026-07-07T12:33:07Z
dc.date.available2026-07-07T12:33:07Z
dc.descriptionWe 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.
dc.description9 pages, Latex, 2 figures in Latex, FSU-SCRI-92-164
dc.identifierhttps://arxiv.org/abs/cond-mat/9211006
dc.identifierhttp://arxiv.org/abs/cond-mat/9211006
dc.identifierPhys.Rev.Lett.70:875-879,1993
dc.identifierdoi:10.1103/PhysRevLett.70.875
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/217019
dc.subjectCondensed Matter
dc.subjectHigh Energy Physics - Lattice
dc.titleCluster Algorithm for Vertex Models
dc.typetext

Files

Collections

arXiv