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/0605165

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

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

Published May 6, 2006• 1 citation
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.cond-mat/0605165

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

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

Cluster Simulations of Loop Models on Two-Dimensional Lattices

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

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.

arXiv:cond-mat/0608447•Physical Review Letters•Mar 21, 2007•34 citations

Single-cluster dynamics for the random-cluster model

Youjin Deng, Xiaofeng Qian, Henk W. J. Blöte

We formulate a single-cluster Monte Carlo algorithm for the simulation of the random-cluster model. This algorithm is a generalization of the Wolff single-cluster method for the q-state Potts model to noninteger values q>1. Its results for static quantities are in a satisfactory agreement with those of the existing Swendsen-Wang-Chayes-Machta (SWCM) algorithm, which involves a full-cluster decomposition of random-cluster configurations. We explore the critical dynamics of this algorithm for several two-dimensional Potts and random-cluster models. For integer q, the single-cluster algorithm can be reduced to the Wolff algorithm, for which case we find that the autocorrelation functions decay almost purely exponentially, with dynamic exponents z(exp)=0.07 (1), 0.521 (7), and 1.007 (9) for q=2, 3, and 4, respectively. For noninteger q, the dynamical behavior of the single-cluster algorithm appears to be very dissimilar to that of the SWCM algorithm. For large critical systems, the autocorrelation function displays a range of power-law behavior as a function of time. The dynamic exponents are relatively large. We provide an explanation for this peculiar dynamic behavior.

arXiv:0907.1711•Physical Review E•Sep 30, 2009•5 citations

Dynamic critical behavior of cluster algorithms for 2D Ashkin-Teller and Potts models

Jesús Salas

We study the dynamic critical behavior of two algorithms: the Swendsen-Wang algorithm for the two-dimensional Potts model with q=2,3,4 and a Swendsen-Wang-type algorithm for the two-dimensional symmetric Ashkin-Teller model on the self-dual curve. We find that the Li--Sokal bound on the autocorrelation time τ_{{\rm int},{\cal E}} \geq const \times C_H is almost, but not quite sharp. The ratio τ_{{\rm int},{\cal E}}/C_H appears to tend to infinity either as a logarithm or as a small power (0.05 \ltapprox p \ltapprox 0.12). We also show that the exponential autocorrelation time τ_{{\rm exp},{\cal E}} is proportional to the integrated autocorrelation time τ_{{\rm int},{\cal E}}.

arXiv:cond-mat/0004329•Apr 19, 2000•3 citations

Cluster method for the Ashkin-Teller model

Shai Wiseman, Eytan Domany

A cluster Monte Carlo algorithm for the Ashkin-Teller (AT) model is constructed according to the guidelines of a general scheme for such algorithms. Its dynamical behavior is tested for the square-lattice AT model. We perform simulations on the line of critical points along which the exponents vary continuously, and find that critical slowing down is significantly reduced. We find continuous variation of the dynamical exponent z along the line, following the variation of the ratio of specific-heat and correlation-length exponents \ensuremath{\alpha}/\ensuremath{\nu}, in a manner which satisfies the Li-Sokal bound ${\mathit{z}}_{\mathrm{cluster}}$\ensuremath{\ge}\ensuremath{\alpha}/\ensuremath{\nu}, that was so far proved only for Potts models.

arXiv:hep-lat/9310015•Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics•Nov 1, 1993•55 citations
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.
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 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.
We formulate a single-cluster Monte Carlo algorithm for the simulation of the random-cluster model. This algorithm is a generalization of the Wolff single-cluster method for the q-state Potts model to noninteger values q>1. Its results for static quantities are in a satisfactory agreement with those of the existing Swendsen-Wang-Chayes-Machta (SWCM) algorithm, which involves a full-cluster decomposition of random-cluster configurations. We explore the critical dynamics of this algorithm for several two-dimensional Potts and random-cluster models. For integer q, the single-cluster algorithm can be reduced to the Wolff algorithm, for which case we find that the autocorrelation functions decay almost purely exponentially, with dynamic exponents z(exp)=0.07 (1), 0.521 (7), and 1.007 (9) for q=2, 3, and 4, respectively. For noninteger q, the dynamical behavior of the single-cluster algorithm appears to be very dissimilar to that of the SWCM algorithm. For large critical systems, the autocorrelation function displays a range of power-law behavior as a function of time. The dynamic exponents are relatively large. We provide an explanation for this peculiar dynamic behavior.
We study the dynamic critical behavior of two algorithms: the Swendsen-Wang algorithm for the two-dimensional Potts model with q=2,3,4 and a Swendsen-Wang-type algorithm for the two-dimensional symmetric Ashkin-Teller model on the self-dual curve. We find that the Li--Sokal bound on the autocorrelation time τ_{{\rm int},{\cal E}} \geq const \times C_H is almost, but not quite sharp. The ratio τ_{{\rm int},{\cal E}}/C_H appears to tend to infinity either as a logarithm or as a small power (0.05 \ltapprox p \ltapprox 0.12). We also show that the exponential autocorrelation time τ_{{\rm exp},{\cal E}} is proportional to the integrated autocorrelation time τ_{{\rm int},{\cal E}}.
A cluster Monte Carlo algorithm for the Ashkin-Teller (AT) model is constructed according to the guidelines of a general scheme for such algorithms. Its dynamical behavior is tested for the square-lattice AT model. We perform simulations on the line of critical points along which the exponents vary continuously, and find that critical slowing down is significantly reduced. We find continuous variation of the dynamical exponent z along the line, following the variation of the ratio of specific-heat and correlation-length exponents \ensuremath{\alpha}/\ensuremath{\nu}, in a manner which satisfies the Li-Sokal bound zcluster{\mathit{z}}_{\mathrm{cluster}}zcluster​\ensuremath{\ge}\ensuremath{\alpha}/\ensuremath{\nu}, that was so far proved only for Potts models.