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:hep-lat/0510040 · Proceedings of XXIIIrd International Symposium on Lattice Field Theory — PoS(LAT2005)

A new efficient cluster algorithm for the Ising model

Matthias Nyfeler, Michele Pepe A, U.‐J. Wiese

Published Dec 14, 2005• 0 citations
arXivHTMLPDF

Abstract

Using D-theory we construct a new efficient cluster algorithm for the Ising model.The construction is very different from the standard Swendsen-Wang algorithm and related to worm algorithms.With the new algorithm we have measured the correlation function with high precision over a surprisingly large number of orders of magnitude.
DOI
10.22323/1.020.0112

Related papers

Comparison of cluster algorithms for the bond-diluted Ising model

Arnold H. Kole, G. T. Barkema, Lars Fritz

Monte Carlo cluster algorithms are popular for their efficiency in studying the Ising model near its critical temperature. We might expect that this efficiency extends to the bond-diluted Ising model. We show, however, that this is not always the case by comparing how the correlation times τ_{w} and τ_{sw} of the Wolff and Swendsen-Wang cluster algorithms scale as a function of the system size L when applied to the two-dimensional bond-diluted Ising model. We demonstrate that the Wolff algorithm suffers from a much longer correlation time than in the pure Ising model, caused by isolated (groups of) spins which are infrequently visited by the algorithm. With a simple argument we prove that these cause the correlation time τ_{w} to be bounded from below by L^{z_{w}} with a dynamical exponent z_{w}=γ/ν≈1.75 for a bond concentration p<1. Furthermore, we numerically show that this lower bound is actually taken for several values of p in the range 0.5<p<1. Moreover, we show that the Swendsen-Wang algorithm does not suffer from the same problem. Consequently, it has a much shorter correlation time, shorter than in the pure Ising model even. Numerically at p=0.6, we find that its dynamical exponent is z_{sw}=0.09(4).

arXiv:2107.08534•Physical review. E•Jan 31, 2022•7 citations

Dual Monte Carlo and cluster algorithms

Naoki Kawashima, James E. Gubernatis

We discuss the development of cluster algorithms from the viewpoint of probability theory and not from the usual viewpoint of a particular model. From the viewpoint of probability theory, we detail the nature of a cluster algorithm, make explicit the assumptions embodied in all clusters of which we are aware, and define the construction of free-cluster algorithms. We also illustrate these procedures by rederiving the Swendsen-Wang algorithm, presenting the details of the loop algorithm for a worldline simulation of a quantum S=1/2 model, and proposing a free-cluster version of the Swendsen-Wang replica method for the random Ising model. How the principle of maximum entropy might be used to aid the construction of cluster algorithms is also discussed.

arXiv:cond-mat/9411110•Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics•Feb 1, 1995•44 citations

Droplets in Ising models

Dietrich Stauffer

The Swendsen-Wang cluster flipping algorithm gives a better way to simulate equilibrium critical phenomena. This review summarizes recent applications, in particular of Wang and Kertész, to better understand the Ising model.

Physica A Statistical Mechanics and its Applications•Sep 1, 1990•8 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

Invaded Cluster Algorithm for Equilibrium Critical Points

Jonathan L. Machta, Y. S. Choi, A. Lücke +2 more

A new cluster algorithm based on invasion percolation is described. The algorithm samples the critical point of a spin system without a priori knowledge of the critical temperature and provides an efficient way to determine the critical temperature and other observables in the critical region. The method is illustrated for the two- and three-dimensional Ising models. The algorithm equilibrates spin configurations much faster than the closely related Swendsen-Wang algorithm.

arXiv:cond-mat/9507094•Physical Review Letters•Oct 9, 1995•75 citations

Replica-exchange cluster algorithm

Wolfhard Janke E, Elmar Bittner

In finite-size scaling analyses of Monte Carlo simulations of second-order phase transitions one often needs an extended temperature/energy range around the critical point.By combining the replica-exchange algorithm with cluster updates and an adaptive routine to find the range of interest, we introduce a new flexible and powerful method for systematic investigations of critical phenomena.As a result, we gain two further orders of magnitude in the performance for 2D and 3D Ising models in comparison with the recently proposed Wang-Landau recursion for cluster algorithms based on the multibondic algorithm, which is already a great improvement over the standard multicanonical variant.

arXiv:1108.0354•International Symposium on Lattice Field Theory (LATTICE)•Jun 23, 2010•0 citations
Monte Carlo cluster algorithms are popular for their efficiency in studying the Ising model near its critical temperature. We might expect that this efficiency extends to the bond-diluted Ising model. We show, however, that this is not always the case by comparing how the correlation times τ_{w} and τ_{sw} of the Wolff and Swendsen-Wang cluster algorithms scale as a function of the system size L when applied to the two-dimensional bond-diluted Ising model. We demonstrate that the Wolff algorithm suffers from a much longer correlation time than in the pure Ising model, caused by isolated (groups of) spins which are infrequently visited by the algorithm. With a simple argument we prove that these cause the correlation time τ_{w} to be bounded from below by L^{z_{w}} with a dynamical exponent z_{w}=γ/ν≈1.75 for a bond concentration p<1. Furthermore, we numerically show that this lower bound is actually taken for several values of p in the range 0.5<p<1. Moreover, we show that the Swendsen-Wang algorithm does not suffer from the same problem. Consequently, it has a much shorter correlation time, shorter than in the pure Ising model even. Numerically at p=0.6, we find that its dynamical exponent is z_{sw}=0.09(4).
We discuss the development of cluster algorithms from the viewpoint of probability theory and not from the usual viewpoint of a particular model. From the viewpoint of probability theory, we detail the nature of a cluster algorithm, make explicit the assumptions embodied in all clusters of which we are aware, and define the construction of free-cluster algorithms. We also illustrate these procedures by rederiving the Swendsen-Wang algorithm, presenting the details of the loop algorithm for a worldline simulation of a quantum S=1/2 model, and proposing a free-cluster version of the Swendsen-Wang replica method for the random Ising model. How the principle of maximum entropy might be used to aid the construction of cluster algorithms is also discussed.
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.
In finite-size scaling analyses of Monte Carlo simulations of second-order phase transitions one often needs an extended temperature/energy range around the critical point.By combining the replica-exchange algorithm with cluster updates and an adaptive routine to find the range of interest, we introduce a new flexible and powerful method for systematic investigations of critical phenomena.As a result, we gain two further orders of magnitude in the performance for 2D and 3D Ising models in comparison with the recently proposed Wang-Landau recursion for cluster algorithms based on the multibondic algorithm, which is already a great improvement over the standard multicanonical variant.