Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:cond-mat/0608447 · Physical Review Letters

Cluster Simulations of Loop Models on Two-Dimensional Lattices

Youjin Deng, Timothy M. Garoni, Wenan Guo, Henk W. J. Blöte, Alan D. Sokal

Published Mar 21, 2007• 34 citations
arXivHTMLPDF

Abstract

We develop cluster algorithms for a broad class of loop models on two-dimensional lattices, including several standard O(n) loop models at n> or =1. We show that our algorithm has little or no critical slowing-down when 1< or =n< or =2. We use this algorithm to investigate the honeycomb-lattice O(n) loop model, for which we determine several new critical exponents, and a square-lattice O(n) loop model, for which we obtain new information on the phase diagram.

DOI
10.1103/physrevlett.98.120601

Related papers

Cluster Simulations of Loop Models on Planar Lattices

Youjin Deng, Wenan Guo, Timothy M. Garoni +2 more

Making use of the duality relation of the Ising model, we develop cluster algorithms for several loop models on planar lattices. We then investigate the O(n) model on the honeycomb lattice and face- and corner-cubic models on the square lattice. Several new physical phenomena are observed. For instance, critical exponents, which have not been reported for the O(n) model in literature, are determined; both ‘ferromagnetic ” and “antiferromagnetic” phase transitions are located for the cubic models. Dynamical behavior is also studied. It is shown that, for 1 < n ≤ 2, our cluster algorithms hardly suffer from critical slowing down. Typeset using REVTEX

•Aug 21, 2006•0 citations

Cluster Simulation of the O(N) loop model on the Honeycomb lattice

Youjin Deng, Wenan Guo, Henk W. J. Blöte

We study the O(N) loop model on the Honeycomb lattice with real value $N \geq 1$ by means of a cluster algorithm. The formulation of the algorithm is based on the equivalence of the O(N) loop model and the low-temperature graphical representation of a $N$-color Ashkin-Teller model on the triangular lattice. The latter model with integer $N$ can be simulated by means of an embedding Swendsen-Wang-type cluster method. By taking into account the symmetry among loops of different colors, we develop another version of the Swendsen-Wang-type method. This version allows the number of colors $N$ to take any real value $N \geq 1$. As an application, we investigate the $N=1.25, 1.50, 1.75$, and 2 loop model at criticality. The determined values of various critical exponents are in excellent agreement with theoretical predictions. In particular, from quantities associated with half of the loops, we determine some critical exponents that corresponds to those for the tricritical $q=N^2$ Potts model but have not been observed yet. Dynamic scaling behavior of the algorithm is also analyzed. The numerical data strongly suggest that our cluster algorithm {\it hardly} suffers from critical slowing down.

arXiv:cond-mat/0605165•May 6, 2006•3 citations

Cluster algorithm for vertex models

Hans Gerd Evertz, Gideon Lana, Mihai Marcu

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.

arXiv:cond-mat/9211006•Physical Review Letters•Feb 15, 1993•372 citations

Monte Carlo algorithm for simulating the O (N) loop model on the square lattice

Antônio Márcio P. Silva, Adriaan M. J. Schakel, Giovani L. Vasconcelos

An efficient algorithm is presented to simulate the O(N) loop model on the square lattice for arbitrary values of N>0. The scheme combines the worm algorithm with a new data structure to resolve both the problem of loop crossings and the necessity of counting the number of loops at each Monte Carlo update. With the use of this scheme, the line of critical points (and other properties) of the O(N) model on the square lattice for 0<N≤2 have been determined.

arXiv:1306.4996•Physical Review E•Aug 5, 2013•1 citation

OVERCOMING CRITICAL SLOWING DOWN IN QUANTUM MONTE CARLO SIMULATIONS

Hans Gerd Evertz, Mihai Marcu

The classical d +1-dimensional spin systems used for the simulation of quantum spin systems in d dimensions are, quite generally, vertex models. Standard simulation methods for such models strongly suffer from critical slowing down. Recently, we developed the loop algorithm , a new type of cluster algorithm that to a large extent overcomes critical slowing down for vertex models. We present the basic ideas on the example of the F model, a special case of the 6-vertex model. Numerical results clearly demonstrate the effectiveness of the loop algorithm. Then, using the framework for cluster algorithms developed by Kandel and Domany, we explain how to adapt our algorithm to the cases of the 6-vertex model and the 8-vertex model, which are relevant for spin systems. The techniqes presented here can be applied without modification to 2-dimensional spin systems, provided that in the Suzuki-Trotter formula the Hamiltonian is broken up into 4 sums of link terms. Generalizations to more complicated situations (higher spins, different uses of the Suzuki-Trotter formula) are, at least in principle, straightforward.

WORLD SCIENTIFIC eBooks•Dec 1, 1993•2 citations

Percolation and critical O(n) loop configurations

Chengxiang Ding, Youjin Deng, Wenan Guo +1 more

We study a percolation problem based on critical loop configurations of the O(n) loop model on the honeycomb lattice. We define dual clusters as groups of sites on the dual triangular lattice that are not separated by a loop, and investigate the bond-percolation properties of these dual clusters. The universal properties at the percolation threshold are argued to match those of Kasteleyn-Fortuin random clusters in the critical Potts model. This relation is checked numerically by means of cluster simulations of several O(n) models in the range 1<or=n<or=2. The simulation results include the percolation threshold for several values of n, as well as the universal exponents associated with bond dilution and the size distribution of the diluted clusters at the percolation threshold. Our numerical results for the exponents are in agreement with existing Coulomb-gas results for the random-cluster model, which confirms the relation between both models. We discuss the renormalization flow of the bond-dilution parameter p as a function of n, and provide an expression that accurately describes a line of unstable fixed points as a function of n, corresponding with the percolation threshold. Furthermore, the renormalization scenario indicates the existence, in a p versus n diagram, of another line of fixed points at p=1, which is stable with respect to p.

arXiv:0903.2359•Physical Review E•Jun 22, 2009•9 citations
We develop cluster algorithms for a broad class of loop models on two-dimensional lattices, including several standard O(n) loop models at n> or =1. We show that our algorithm has little or no critical slowing-down when 1< or =n< or =2. We use this algorithm to investigate the honeycomb-lattice O(n) loop model, for which we determine several new critical exponents, and a square-lattice O(n) loop model, for which we obtain new information on the phase diagram.
Making use of the duality relation of the Ising model, we develop cluster algorithms for several loop models on planar lattices. We then investigate the O(n) model on the honeycomb lattice and face- and corner-cubic models on the square lattice. Several new physical phenomena are observed. For instance, critical exponents, which have not been reported for the O(n) model in literature, are determined; both ‘ferromagnetic ” and “antiferromagnetic” phase transitions are located for the cubic models. Dynamical behavior is also studied. It is shown that, for 1 < n ≤ 2, our cluster algorithms hardly suffer from critical slowing down. Typeset using REVTEX
We study the O(N) loop model on the Honeycomb lattice with real value N≥1N \geq 1N≥1 by means of a cluster algorithm. The formulation of the algorithm is based on the equivalence of the O(N) loop model and the low-temperature graphical representation of a NNN-color Ashkin-Teller model on the triangular lattice. The latter model with integer NNN can be simulated by means of an embedding Swendsen-Wang-type cluster method. By taking into account the symmetry among loops of different colors, we develop another version of the Swendsen-Wang-type method. This version allows the number of colors NNN to take any real value N≥1N \geq 1N≥1. As an application, we investigate the N=1.25,1.50,1.75N=1.25, 1.50, 1.75N=1.25,1.50,1.75, and 2 loop model at criticality. The determined values of various critical exponents are in excellent agreement with theoretical predictions. In particular, from quantities associated with half of the loops, we determine some critical exponents that corresponds to those for the tricritical q=N2q=N^2q=N2 Potts model but have not been observed yet. Dynamic scaling behavior of the algorithm is also analyzed. The numerical data strongly suggest that our cluster algorithm {\it hardly} suffers from critical slowing down.
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.
The classical d +1-dimensional spin systems used for the simulation of quantum spin systems in d dimensions are, quite generally, vertex models. Standard simulation methods for such models strongly suffer from critical slowing down. Recently, we developed the loop algorithm , a new type of cluster algorithm that to a large extent overcomes critical slowing down for vertex models. We present the basic ideas on the example of the F model, a special case of the 6-vertex model. Numerical results clearly demonstrate the effectiveness of the loop algorithm. Then, using the framework for cluster algorithms developed by Kandel and Domany, we explain how to adapt our algorithm to the cases of the 6-vertex model and the 8-vertex model, which are relevant for spin systems. The techniqes presented here can be applied without modification to 2-dimensional spin systems, provided that in the Suzuki-Trotter formula the Hamiltonian is broken up into 4 sums of link terms. Generalizations to more complicated situations (higher spins, different uses of the Suzuki-Trotter formula) are, at least in principle, straightforward.
We study a percolation problem based on critical loop configurations of the O(n) loop model on the honeycomb lattice. We define dual clusters as groups of sites on the dual triangular lattice that are not separated by a loop, and investigate the bond-percolation properties of these dual clusters. The universal properties at the percolation threshold are argued to match those of Kasteleyn-Fortuin random clusters in the critical Potts model. This relation is checked numerically by means of cluster simulations of several O(n) models in the range 1<or=n<or=2. The simulation results include the percolation threshold for several values of n, as well as the universal exponents associated with bond dilution and the size distribution of the diluted clusters at the percolation threshold. Our numerical results for the exponents are in agreement with existing Coulomb-gas results for the random-cluster model, which confirms the relation between both models. We discuss the renormalization flow of the bond-dilution parameter p as a function of n, and provide an expression that accurately describes a line of unstable fixed points as a function of n, corresponding with the percolation threshold. Furthermore, the renormalization scenario indicates the existence, in a p versus n diagram, of another line of fixed points at p=1, which is stable with respect to p.