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/9910136 · Journal of Physics A Mathematical and General

Invaded cluster algorithm for critical properties of periodic and aperiodic planar Ising models

Oliver Redner, Michael Baake A

Published Apr 28, 2000• 6 citations
arXivHTMLPDF

Abstract

We demonstrate that the invaded cluster algorithm, introduced by Machta et al (1995 Phys. Rev. Lett. 75 2792-5), is a fast and reliable tool for determining the critical temperature and the magnetic critical exponent of periodic and aperiodic ferromagnetic Ising models in two dimensions. The algorithm is shown to reproduce the known values of the critical temperature on various periodic and quasiperiodic graphs with an accuracy of more than three significant digits, but only modest computational effort. On two quasiperiodic graphs which were not investigated in this respect before, the 12-fold symmetric square-triangle tiling and the 10-fold symmetric Tübingen triangle tiling, we determine the critical temperature. Furthermore, a generalization of the algorithm to non-identical coupling strengths is presented and applied to a class of Ising models on the Labyrinth tiling. For generic cases in which the heuristic Harris-Luck criterion predicts deviations from the Onsager universality class, we find a magnetic critical exponent different from the Onsager value. But notable exceptions to the criterion are found which consist not only of the exactly solvable cases, in agreement with a recent exact result, but also of the self-dual ones and maybe more.

DOI
10.1088/0305-4470/33/16/304

Related papers

Generalization of the invaded cluster algorithm to the tricritical point

Ivan Balog, Katarina Uzelac

The invaded cluster algorithm [1] is generalized [2] to the tricritical point on the example of 2d Potts model with annealed dilution. Self-regulating procedure that locates the tricritical point in the two-parameter space spanned by temperature and chemical potential of vacancies is constructed based on geometrical arguments. The tricritical point is identified as a simultaneous percolation of the Fortuin-Kastelyn cluster and the geometrical cluster consisting of vacancies and isolated spins. The tricritical values of parameters and concentration are presented for q=1, 2, 3 and found to be in a good agreement with the best known results [3]. Scaling properties of the percolating scaling cluster and related critical exponents are also derived. Based on the idea that effective correlation of vacancies is important at the tricritical point, we also examine alternative stopping rules within generalized IC algorithm, and possible extension to higher dimensions. [1] J. Machta, Y. S. Choi, A. Lucke, T. Schweizer, L. V. Chayes, Phys. Rev. Lett. 75, 2792 (1995) ; J. Machta, Y. S. Choi, A. Lucke, T. Schweizer, L. M. Chayes, Phys. Rev. E 54, 1332 (1996). [2] I. Balog, K.Uzelac, preprint cond-mat/0703759. [3] X. Qian, Y. Deng, H. W. J. Bl¨ote, Phys. Rev. E 72, 056132 (2005).

•Jan 1, 2007•0 citations

Invaded cluster simulations of theXYmodel in two and three dimensions

Ilija Dukovski, Jonathan L. Machta, Lincoln Chayes

The invaded cluster algorithm is used to study the XY model in two and three dimensions up to sizes 2000(2) and 120(3), respectively. A soft spin O(2) model, in the same universality class as the three-dimensional XY model, is also studied. The static critical properties of the model and the dynamical properties of the algorithm are reported. The results are K(c)=0.454 12(2) for the three-dimensional XY model and eta=0.037(2) for the three-dimensional XY universality class. For the two-dimensional XY model the results are K(c)=1.120(1) and eta=0.251(5). The invaded cluster algorithm does not show any critical slowing for the magnetization or critical temperature estimator for the two-dimensional or three-dimensional XY models.

arXiv:cond-mat/0105143•Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics•Jan 3, 2002•24 citations

Locally converging algorithms for determining the critical temperature in Ising systems

Eshel Faraggi, Daniel T. Robb

We introduce a class of algorithms that converge to criticality automatically, in a way similar to the invaded cluster algorithm. Unlike the invaded cluster algorithm which uses global percolation as a test for criticality, these local algorithms use an average over local observables, specifically the number of satisfied bonds, in a feedback loop which drives the system toward criticality. Two specific algorithms are introduced, the average algorithm and the locally converging Wolff algorithm. We apply these algorithms to study the Ising square lattice and the Ising Bethe lattice. We find reasonable convergence to the critical temperature for both systems under the locally converging Wolff algorithm. We also re-examine the phase diagram of the dilute two-dimensional (2D) Ising model and find results supporting our previously reported conclusions regarding the existence of a local regime of magnetization below the percolations threshold. In addition, the presented algorithms are computationally more efficient than the invaded cluster algorithm, requiring less CPU time and memory.

Physical Review B•Oct 20, 2008•4 citations

Equilibriumlike invaded cluster algorithm: Critical exponents and dynamical properties

Ivan Balog, Katarina Uzelac

We present a detailed study of the equilibrium-like invaded cluster algorithm, recently proposed as an extension of the invaded cluster algorithm, designed to drive the system to criticality while still preserving the equilibrium ensemble. We perform extensive simulations on two special cases of the Potts model and examine the precision of critical exponents by including the leading corrections. We show that both thermal and magnetic critical exponents can be obtained with high accuracy compared to the best available results. The choice of the auxiliary parameters of the algorithm is discussed in context of dynamical properties. We also discuss the relation to the Li-Sokal bound for the dynamical exponent z.

arXiv:1004.1509•Physical Review E•Apr 15, 2010•3 citations

Fixed-cluster acceleration algorithm for spin systems

Tanniemola B. Liverpool, Sharon C. Glotzer

A recently introduced cluster acceleration algorithm for spin models [J. Machta et al., Phys. Rev. Lett. 75, 2792 (1995)] based on invasion percolation is generalized to temperatures away from the critical point using concepts of random bond percolation. The generalized algorithm is equivalent to an "optimized" version of the Swendsen-Wang cluster algorithm [R. H. Swendsen and J. S. Wang, Phys. Rev. Lett. 58, 86 (1987)], and we demonstrate its success and speed at all temperatures for the $d=2$ Ising model. We argue that the previously discussed connection to self-organized criticality may be viewed as one limit of the fixed-cluster algorithm.

Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics•May 1, 1996•14 citations

Critical behavior of the Ising model on square-triangle tilings

Akihisa Koga, 志朗 酒井

We investigate magnetic properties of the ferromagnetic Ising model on square-triangle tilings to explore how the hyperuniformity, which characterizes long-range behavior of the point pattern, influences critical phenomena where long-range correlations play a crucial role. The square-triangle tilings are spatially random structures in two dimensions constructed by densely packing the plane with squares and triangles. The growth rule with a parameter $p$ proposed in our previous paper enables systematic generations of hyperuniform, nonhyperuniform, and antihyperuniform tilings. Classical Monte Carlo simulations of the Ising model on these tilings show that critical behavior always belongs to the two-dimensional Ising universality class. It is clarified that the critical temperature is higher for the tiling with higher regularity in terms of hyperuniformity. Critical phenomena in the Ising models on the periodic and quasiperiodic tilings composed of the square and triangle tiles are also addressed.

arXiv:2411.18338•Physical review. B./Physical review. B•Jan 22, 2025•2 citations
We demonstrate that the invaded cluster algorithm, introduced by Machta et al (1995 Phys. Rev. Lett. 75 2792-5), is a fast and reliable tool for determining the critical temperature and the magnetic critical exponent of periodic and aperiodic ferromagnetic Ising models in two dimensions. The algorithm is shown to reproduce the known values of the critical temperature on various periodic and quasiperiodic graphs with an accuracy of more than three significant digits, but only modest computational effort. On two quasiperiodic graphs which were not investigated in this respect before, the 12-fold symmetric square-triangle tiling and the 10-fold symmetric Tübingen triangle tiling, we determine the critical temperature. Furthermore, a generalization of the algorithm to non-identical coupling strengths is presented and applied to a class of Ising models on the Labyrinth tiling. For generic cases in which the heuristic Harris-Luck criterion predicts deviations from the Onsager universality class, we find a magnetic critical exponent different from the Onsager value. But notable exceptions to the criterion are found which consist not only of the exactly solvable cases, in agreement with a recent exact result, but also of the self-dual ones and maybe more.
The invaded cluster algorithm [1] is generalized [2] to the tricritical point on the example of 2d Potts model with annealed dilution. Self-regulating procedure that locates the tricritical point in the two-parameter space spanned by temperature and chemical potential of vacancies is constructed based on geometrical arguments. The tricritical point is identified as a simultaneous percolation of the Fortuin-Kastelyn cluster and the geometrical cluster consisting of vacancies and isolated spins. The tricritical values of parameters and concentration are presented for q=1, 2, 3 and found to be in a good agreement with the best known results [3]. Scaling properties of the percolating scaling cluster and related critical exponents are also derived. Based on the idea that effective correlation of vacancies is important at the tricritical point, we also examine alternative stopping rules within generalized IC algorithm, and possible extension to higher dimensions. [1] J. Machta, Y. S. Choi, A. Lucke, T. Schweizer, L. V. Chayes, Phys. Rev. Lett. 75, 2792 (1995) ; J. Machta, Y. S. Choi, A. Lucke, T. Schweizer, L. M. Chayes, Phys. Rev. E 54, 1332 (1996). [2] I. Balog, K.Uzelac, preprint cond-mat/0703759. [3] X. Qian, Y. Deng, H. W. J. Bl¨ote, Phys. Rev. E 72, 056132 (2005).
The invaded cluster algorithm is used to study the XY model in two and three dimensions up to sizes 2000(2) and 120(3), respectively. A soft spin O(2) model, in the same universality class as the three-dimensional XY model, is also studied. The static critical properties of the model and the dynamical properties of the algorithm are reported. The results are K(c)=0.454 12(2) for the three-dimensional XY model and eta=0.037(2) for the three-dimensional XY universality class. For the two-dimensional XY model the results are K(c)=1.120(1) and eta=0.251(5). The invaded cluster algorithm does not show any critical slowing for the magnetization or critical temperature estimator for the two-dimensional or three-dimensional XY models.
We introduce a class of algorithms that converge to criticality automatically, in a way similar to the invaded cluster algorithm. Unlike the invaded cluster algorithm which uses global percolation as a test for criticality, these local algorithms use an average over local observables, specifically the number of satisfied bonds, in a feedback loop which drives the system toward criticality. Two specific algorithms are introduced, the average algorithm and the locally converging Wolff algorithm. We apply these algorithms to study the Ising square lattice and the Ising Bethe lattice. We find reasonable convergence to the critical temperature for both systems under the locally converging Wolff algorithm. We also re-examine the phase diagram of the dilute two-dimensional (2D) Ising model and find results supporting our previously reported conclusions regarding the existence of a local regime of magnetization below the percolations threshold. In addition, the presented algorithms are computationally more efficient than the invaded cluster algorithm, requiring less CPU time and memory.
We present a detailed study of the equilibrium-like invaded cluster algorithm, recently proposed as an extension of the invaded cluster algorithm, designed to drive the system to criticality while still preserving the equilibrium ensemble. We perform extensive simulations on two special cases of the Potts model and examine the precision of critical exponents by including the leading corrections. We show that both thermal and magnetic critical exponents can be obtained with high accuracy compared to the best available results. The choice of the auxiliary parameters of the algorithm is discussed in context of dynamical properties. We also discuss the relation to the Li-Sokal bound for the dynamical exponent z.
A recently introduced cluster acceleration algorithm for spin models [J. Machta et al., Phys. Rev. Lett. 75, 2792 (1995)] based on invasion percolation is generalized to temperatures away from the critical point using concepts of random bond percolation. The generalized algorithm is equivalent to an "optimized" version of the Swendsen-Wang cluster algorithm [R. H. Swendsen and J. S. Wang, Phys. Rev. Lett. 58, 86 (1987)], and we demonstrate its success and speed at all temperatures for the d=2d=2d=2 Ising model. We argue that the previously discussed connection to self-organized criticality may be viewed as one limit of the fixed-cluster algorithm.
We investigate magnetic properties of the ferromagnetic Ising model on square-triangle tilings to explore how the hyperuniformity, which characterizes long-range behavior of the point pattern, influences critical phenomena where long-range correlations play a crucial role. The square-triangle tilings are spatially random structures in two dimensions constructed by densely packing the plane with squares and triangles. The growth rule with a parameter ppp proposed in our previous paper enables systematic generations of hyperuniform, nonhyperuniform, and antihyperuniform tilings. Classical Monte Carlo simulations of the Ising model on these tilings show that critical behavior always belongs to the two-dimensional Ising universality class. It is clarified that the critical temperature is higher for the tiling with higher regularity in terms of hyperuniformity. Critical phenomena in the Ising models on the periodic and quasiperiodic tilings composed of the square and triangle tiles are also addressed.