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:2107.08534 · Physical review. E

Comparison of cluster algorithms for the bond-diluted Ising model

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

Published Jan 31, 2022• 7 citations
arXivHTMLPDF

Abstract

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).

DOI
10.1103/physreve.105.015313

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

Single-cluster algorithm for the site-bond-correlated Ising model

Paulo R. A. Campos, Roberto Nicolau Onody

We extend the Wolff algorithm to include correlated spin interactions in diluted magnetic systems. This algorithm is applied to study the site-bond-correlated Ising model on a two-dimensional square lattice. We use a finite-size scaling procedure to obtain the phase diagram in the temperature-concentration space. We also have verified that the autocorrelation time diminishes in the presence of dilution and correlation, showing that the Wolff algorithm performs even better in such situations.

arXiv:cond-mat/9709317•Physical review. B, Condensed matter•Dec 1, 1997•4 citations

Empirical relations between static and dynamic exponents for Ising model cluster algorithms

Paul Coddington, CLIVE F. BAILLIE

We have measured the autocorrelations for the Swendsen-Wang and the Wolff cluster update algorithms for the Ising model in two, three, and four dimensions. The data for the Wolff algorithm suggest that the autocorrelations are linearly related to the specific heat, in which case the dynamic critical exponent is ${\mathit{z}}_{\mathrm{i}\mathrm{n}\mathrm{t},}$${\mathit{E}}^{\mathrm{W}}$=\ensuremath{\alpha}/\ensuremath{\nu}. For the Swendsen-Wang algorithm, scaling the autocorrelations by the average maximum cluster size gives either a constant or a logarithm, which implies that ${\mathit{z}}_{\mathrm{i}\mathrm{n}\mathrm{t},}$${\mathit{E}}^{\mathrm{SW}}$=\ensuremath{\beta}/\ensuremath{\nu} for the Ising model.

Physical Review Letters•Feb 17, 1992•46 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

Critical Dynamics Behavior of the Wolff Algorithm in the Site-Bond-Correlated Ising Model

Paulo R. A. Campos, Roberto Nicolau Onody

Here we apply the Wolff single-cluster algorithm to the site-bond-correlated Ising model and study its critical dynamical behavior. We have verified that the autocorrelation time diminishes in the presence of dilution and correlation, showing that the Wolff algorithm performs even better in such situations. The critical dynamical exponents are also estimated.

International Journal of Modern Physics C•Sep 1, 1998•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).
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.
We have measured the autocorrelations for the Swendsen-Wang and the Wolff cluster update algorithms for the Ising model in two, three, and four dimensions. The data for the Wolff algorithm suggest that the autocorrelations are linearly related to the specific heat, in which case the dynamic critical exponent is zint,{\mathit{z}}_{\mathrm{i}\mathrm{n}\mathrm{t},}zint,​EW{\mathit{E}}^{\mathrm{W}}EW=\ensuremath{\alpha}/\ensuremath{\nu}. For the Swendsen-Wang algorithm, scaling the autocorrelations by the average maximum cluster size gives either a constant or a logarithm, which implies that zint,{\mathit{z}}_{\mathrm{i}\mathrm{n}\mathrm{t},}zint,​ESW{\mathit{E}}^{\mathrm{SW}}ESW=\ensuremath{\beta}/\ensuremath{\nu} for the Ising model.
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.