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

Physical review. E

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

Ulvi Kanbur, Zeynep Demir Vatansever

Published Feb 28, 2024• 4 citations
Publisher

Abstract

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.

DOI
10.1103/physreve.109.024140

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

Dynamical critical properties of the random-bond three-state Potts model

Anonymous, Ulvi Kanbur, Mohammad Sadra Najafi +2 more

We study the dynamic critical behavior of the two-dimensional random-bond three-state Potts model using large-scale Monte Carlo simulations with the Wolff and Swendsen-Wang cluster algorithms. At the disorder-dependent critical temperature, we compute integrated and exponential autocorrelation times and extract the dynamic critical exponent z via finite-size scaling. Critical slowing down is significantly weakened by bond randomness, with the dynamic exponent decreasing from z≈0.54 in the pure system to z≈0.24 at strong disorder. From the finite-size scaling of the Wolff cluster size, we obtain γ/ν≈1.73, where γ and ν are the susceptibility and correlation-length exponents, respectively, consistent with the universality class of the two-dimensional three-state Potts model. These results indicate that bond randomness strongly affects the critical dynamics but leaves the underlying static universality class unchanged. Furthermore, both static and dynamic observables, including the specific heat and the autocorrelation times, show a lack of self-averaging.

arXiv:2610.01176•Physical review. E•Aug 13, 2026•0 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

Critical relaxation in two-dimensional random-bond Potts models

S. Chen, David Paul Landau

We present an extensive Monte Carlo study of the critical relaxation for the two-dimensional square lattice random-bond Potts model using Swendsen-Wang cluster flipping. The integrated autocorrelation time \ensuremath{\tau} is calculated and the dynamic exponent z is estimated by analyzing the size dependence of \ensuremath{\tau}. We find that z\ensuremath{\approx}0 in agreement with estimates for the two-dimensional Ising model. We also present a study of the size dependence of the dynamic behavior of the pure eight-state Potts model which undergoes a first-order transition. The scaling is describable by the product of an exponential times a power law, a behavior which is quite different from that found in the random-bond case.

Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics•Jan 1, 1997•3 citations

Dynamic critical exponents for Swendsen–Wang and Wolff algorithms obtained by a nonequilibrium relaxation method

Jianqing Du, Bo Zheng, Jian‐Sheng Wang

Using a nonequilibrium relaxation method, we calculate the dynamic critical exponent z of the two-dimensional Ising model for the Swendsen–Wang and Wolff algorithms. We examine dynamic relaxation processes following a quench from a disordered or an ordered initial state to the critical temperature T c , and measure the exponential relaxation time of the system energy. For the Swendsen–Wang algorithm with an ordered or a disordered initial state, and for the Wolff algorithm with an ordered initial state, the exponential relaxation time fits well to a logarithmic size dependence up to a lattice size L = 8192. For the Wolff algorithm with a disordered initial state, we obtain an effective dynamic exponent z exp = 1.19(2) up to L = 2048. For comparison, we also compute the effective dynamic exponents through the integrated correlation times. In addition, an exact result of the Swendsen–Wang dynamic spectrum of a one-dimensional Ising chain is derived.

arXiv:cond-mat/0603038•Journal of Statistical Mechanics Theory and Experiment•May 11, 2006•14 citations

Criticality of the random-site Ising model: Metropolis, Swendsen-Wang and Wolff Monte Carlo algorithms

Dmytro Ivaneyko, Jaroslav Ilnytskyi, Bertrand Berche +1 more

We apply numerical simulations to study the criticality of the 3D Ising model with random site quenched dilution. The emphasis is given to the issues not being discussed in detail before. In particular, we attempt a comparison of different Monte Carlo techniques, discussing regions of their applicability and advantages/disadvantages depending on the aim of a particular simulation set. Moreover, besides evaluation of the critical indices we estimate the universal ratio $Γ^+/Γ^-$ for the magnetic susceptibility critical amplitudes. Our estimate $Γ^+/Γ^- = 1.67 \pm 0.15$ is in a good agreement with the recent MC analysis of the random-bond Ising model giving further support that both random-site and random-bond dilutions lead to the same universality class.

arXiv:cond-mat/0501291•Condensed Matter Physics•Jan 1, 2005•19 citations
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.
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 study the dynamic critical behavior of the two-dimensional random-bond three-state Potts model using large-scale Monte Carlo simulations with the Wolff and Swendsen-Wang cluster algorithms. At the disorder-dependent critical temperature, we compute integrated and exponential autocorrelation times and extract the dynamic critical exponent z via finite-size scaling. Critical slowing down is significantly weakened by bond randomness, with the dynamic exponent decreasing from z≈0.54 in the pure system to z≈0.24 at strong disorder. From the finite-size scaling of the Wolff cluster size, we obtain γ/ν≈1.73, where γ and ν are the susceptibility and correlation-length exponents, respectively, consistent with the universality class of the two-dimensional three-state Potts model. These results indicate that bond randomness strongly affects the critical dynamics but leaves the underlying static universality class unchanged. Furthermore, both static and dynamic observables, including the specific heat and the autocorrelation times, show a lack of self-averaging.
We present an extensive Monte Carlo study of the critical relaxation for the two-dimensional square lattice random-bond Potts model using Swendsen-Wang cluster flipping. The integrated autocorrelation time \ensuremath{\tau} is calculated and the dynamic exponent z is estimated by analyzing the size dependence of \ensuremath{\tau}. We find that z\ensuremath{\approx}0 in agreement with estimates for the two-dimensional Ising model. We also present a study of the size dependence of the dynamic behavior of the pure eight-state Potts model which undergoes a first-order transition. The scaling is describable by the product of an exponential times a power law, a behavior which is quite different from that found in the random-bond case.
Using a nonequilibrium relaxation method, we calculate the dynamic critical exponent z of the two-dimensional Ising model for the Swendsen–Wang and Wolff algorithms. We examine dynamic relaxation processes following a quench from a disordered or an ordered initial state to the critical temperature T c , and measure the exponential relaxation time of the system energy. For the Swendsen–Wang algorithm with an ordered or a disordered initial state, and for the Wolff algorithm with an ordered initial state, the exponential relaxation time fits well to a logarithmic size dependence up to a lattice size L = 8192. For the Wolff algorithm with a disordered initial state, we obtain an effective dynamic exponent z exp = 1.19(2) up to L = 2048. For comparison, we also compute the effective dynamic exponents through the integrated correlation times. In addition, an exact result of the Swendsen–Wang dynamic spectrum of a one-dimensional Ising chain is derived.
We apply numerical simulations to study the criticality of the 3D Ising model with random site quenched dilution. The emphasis is given to the issues not being discussed in detail before. In particular, we attempt a comparison of different Monte Carlo techniques, discussing regions of their applicability and advantages/disadvantages depending on the aim of a particular simulation set. Moreover, besides evaluation of the critical indices we estimate the universal ratio Γ+/Γ−Γ^+/Γ^-Γ+/Γ− for the magnetic susceptibility critical amplitudes. Our estimate Γ+/Γ−=1.67±0.15Γ^+/Γ^- = 1.67 \pm 0.15Γ+/Γ−=1.67±0.15 is in a good agreement with the recent MC analysis of the random-bond Ising model giving further support that both random-site and random-bond dilutions lead to the same universality class.