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/0703787 · Physical Review Letters

Dynamic Critical Behavior of the Worm Algorithm for the Ising Model

Youjin Deng, Timothy M. Garoni, Alan D. Sokal

Published Sep 10, 2007• 46 citations
arXivHTMLPDF

Abstract

We study the dynamic critical behavior of the worm algorithm for the two- and three-dimensional Ising models, by Monte Carlo simulation. The autocorrelation functions exhibit an unusual three-time-scale behavior. As a practical matter, the worm algorithm is slightly more efficient than the Swendsen-Wang algorithm for simulating the two-point function of the three-dimensional Ising model.

DOI
10.1103/physrevlett.99.110601

Related papers

Critical dynamics of cluster algorithms in the random-bond Ising model

Ulvi Kanbur, Zeynep Demir Vatansever

In the present work, we present an extensive Monte Carlo simulation study on the dynamical properties of the two-dimensional random-bond Ising model. The correlation time τ of the Swendsen-Wang and Wolff cluster algorithms is calculated at the critical point. The dynamic critical exponent z of both algorithms is also measured by using the numerical data for several lattice sizes up to L=512. It is found for both algorithms that the autocorrelation time decreases considerably and the critical slowing-down effect reduces upon the introduction of bond disorder. Additionally, simulations with the Metropolis algorithm are performed, and the critical slowing-down effect is observed to be more pronounced in the presence of disorder, confirming the previous findings in the literature. Moreover, the existence of the non-self-averaging property of the model is demonstrated by calculating the scaled form of the standard deviation of autocorrelation times. Finally, the critical exponent ratio of the magnetic susceptibility is estimated by using the average cluster size of the Wolff algorithm.

Physical review. E•Feb 28, 2024•4 citations

Comparison of Monte Carlo Metropolis, Swendsen-Wang, and Wolff Algorithms in the Critical Region for the 2-dimensional Ising Model

Eloi-Alain Kyimba

Comparison of Monte Carlo Metropolis, Swendsen-Wang, and Wolff Algorithms in the Critical Region for the 2-Dimensional Ising Model.(Under the direction of Dean J. Lee.)We measure the efficiency of the Metropolis, Swendsen-Wang, and Wolff algorithms in the critical region as characterized by the correlation timeτ .This correlation time τ is then used to determine the dynamical critical exponent z using τ = L with L representing the linear dimension of the 2-dimensional Ising model.

•Mar 22, 2008•1 citation

MONTE CARLO SIMULATIONS OF THE ISING MODEL ON THREE-DIMENSIONAL RANDOM LATTICE USING THE CLUSTER ALGORITHM

JI DA-REN, J. B. Zhang, (1)浙江大学,杭州310027; (2)浙江近代物理中心,杭州310027

In order to reduce the critical slowing down in Monte Carlo simulations, a numerical study for the Ising model on 3-D random lattice using Swendsen-Wang algorithm is performed. The critical point obtained is βc=0. 075±0. 001. Moreover, to analyse the dynamical property of Swendsen-Wang method, the dynamical critical exponent z is estimated. The result is z =0. 74 ±0. 03. This indicates that the Swendsen-Wang method can greatly reduce the critical slowing down for the Ising model on 3-D random lattice.

Acta Physica Sinica•Jan 1, 1993•0 citations

Dynamic Critical Behavior of Percolation Observables in the 2d Ising Model

Wanderson Gonçalves Wanzeller, G. Krein, T. Mendes

Abstract. We present preliminary results of our numerical study of the critical dynamics of percolation observables for the two-dimensional Ising model. We consider the (Monte-Carlo) short-time evolution of the system obtained with a local heat-bath method and with the global Swendsen-Wang algorithm. In both cases, we find qualitatively different dynamic behaviors for the magnetization and Ω, the order parameter of the percolation transition. This may have implications for the recent attempts to describe the dynamics of the QCD phase transition using cluster observables.

•May 17, 2006•2 citations

Dynamic Critical Behavior of Percolation Observables in the 2d Ising Model

Wanderson Gonçalves Wanzeller

We present preliminary results of our numerical study of the critical dynamics of percolation observables for the two‐dimensional Ising model. We consider the (Monte‐Carlo) short‐time evolution of the system obtained with a local heat‐bath method and with the global Swendsen‐Wang algorithm. In both cases, we find qualitatively different dynamic behaviors for the magnetization and Ω, the order parameter of the percolation transition. This may have implications for the recent attempts to describe the dynamics of the QCD phase transition using cluster observables.

arXiv:hep-lat/0605015•AIP conference proceedings•Jan 1, 2004•2 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
We study the dynamic critical behavior of the worm algorithm for the two- and three-dimensional Ising models, by Monte Carlo simulation. The autocorrelation functions exhibit an unusual three-time-scale behavior. As a practical matter, the worm algorithm is slightly more efficient than the Swendsen-Wang algorithm for simulating the two-point function of the three-dimensional Ising model.
In the present work, we present an extensive Monte Carlo simulation study on the dynamical properties of the two-dimensional random-bond Ising model. The correlation time τ of the Swendsen-Wang and Wolff cluster algorithms is calculated at the critical point. The dynamic critical exponent z of both algorithms is also measured by using the numerical data for several lattice sizes up to L=512. It is found for both algorithms that the autocorrelation time decreases considerably and the critical slowing-down effect reduces upon the introduction of bond disorder. Additionally, simulations with the Metropolis algorithm are performed, and the critical slowing-down effect is observed to be more pronounced in the presence of disorder, confirming the previous findings in the literature. Moreover, the existence of the non-self-averaging property of the model is demonstrated by calculating the scaled form of the standard deviation of autocorrelation times. Finally, the critical exponent ratio of the magnetic susceptibility is estimated by using the average cluster size of the Wolff algorithm.
In order to reduce the critical slowing down in Monte Carlo simulations, a numerical study for the Ising model on 3-D random lattice using Swendsen-Wang algorithm is performed. The critical point obtained is βc=0. 075±0. 001. Moreover, to analyse the dynamical property of Swendsen-Wang method, the dynamical critical exponent z is estimated. The result is z =0. 74 ±0. 03. This indicates that the Swendsen-Wang method can greatly reduce the critical slowing down for the Ising model on 3-D random lattice.
Abstract. We present preliminary results of our numerical study of the critical dynamics of percolation observables for the two-dimensional Ising model. We consider the (Monte-Carlo) short-time evolution of the system obtained with a local heat-bath method and with the global Swendsen-Wang algorithm. In both cases, we find qualitatively different dynamic behaviors for the magnetization and Ω, the order parameter of the percolation transition. This may have implications for the recent attempts to describe the dynamics of the QCD phase transition using cluster observables.
We present preliminary results of our numerical study of the critical dynamics of percolation observables for the two‐dimensional Ising model. We consider the (Monte‐Carlo) short‐time evolution of the system obtained with a local heat‐bath method and with the global Swendsen‐Wang algorithm. In both cases, we find qualitatively different dynamic behaviors for the magnetization and Ω, the order parameter of the percolation transition. This may have implications for the recent attempts to describe the dynamics of the QCD phase transition using cluster observables.
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}}.