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/9603134 · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics

Mean-field behavior of cluster dynamics

N. Persky, Radel Ben-Av, Ido Kanter, Eytan Domany

Published Sep 1, 1996• 18 citations
arXivHTMLPDF

Abstract

The dynamic behavior of cluster algorithms is analyzed in the classical mean-field limit. Rigorous analytical results below ${\mathit{T}}_{\mathit{c}}$ establish that the dynamic exponent has the value ${\mathit{z}}_{\mathrm{SW}}$=1 for the Swendsen-Wang algorithm and ${\mathit{z}}_{\mathit{W}}$=0 for the Wolff algorithm. An efficient Monte Carlo implementation is introduced, adapted for using these algorithms for fully connected graphs. Extensive simulations both above and below ${\mathit{T}}_{\mathit{c}}$ demonstrate scaling and evaluate the finite-size scaling function by means of a rather impressive collapse of the data. \textcopyright{} 1996 The American Physical Society.

DOI
10.1103/physreve.54.2351

Related papers

Single-cluster dynamics for the random-cluster model

Youjin Deng, Xiaofeng Qian, Henk W. J. Blöte

We formulate a single-cluster Monte Carlo algorithm for the simulation of the random-cluster model. This algorithm is a generalization of the Wolff single-cluster method for the q-state Potts model to noninteger values q>1. Its results for static quantities are in a satisfactory agreement with those of the existing Swendsen-Wang-Chayes-Machta (SWCM) algorithm, which involves a full-cluster decomposition of random-cluster configurations. We explore the critical dynamics of this algorithm for several two-dimensional Potts and random-cluster models. For integer q, the single-cluster algorithm can be reduced to the Wolff algorithm, for which case we find that the autocorrelation functions decay almost purely exponentially, with dynamic exponents z(exp)=0.07 (1), 0.521 (7), and 1.007 (9) for q=2, 3, and 4, respectively. For noninteger q, the dynamical behavior of the single-cluster algorithm appears to be very dissimilar to that of the SWCM algorithm. For large critical systems, the autocorrelation function displays a range of power-law behavior as a function of time. The dynamic exponents are relatively large. We provide an explanation for this peculiar dynamic behavior.

arXiv:0907.1711•Physical Review E•Sep 30, 2009•4 citations

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

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

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 and static properties of the invaded cluster algorithm

K. Moriarty, Jonathan L. Machta, L. Chayes

Simulations of the two-dimensional Ising and three-state Potts models at their critical points are performed using the invaded cluster (IC) algorithm. It is argued that observables measured on a sublattice of size l should exhibit a crossover to Swendsen-Wang (SW) behavior for l sufficiently less than the lattice size L, and a scaling form is proposed to describe the crossover phenomenon. It is found that the energy autocorrelation time ${\ensuremath{\tau}}_{\ensuremath{\varepsilon}}(l,L)$ for an $l\ifmmode\times\else\texttimes\fi{}l$ sublattice attains a maximum in the crossover region, and a dynamic exponent ${z}^{\mathrm{IC}}$ for the IC algorithm is defined according to ${\ensuremath{\tau}}_{\ensuremath{\varepsilon},\mathrm{max}}\ensuremath{\sim}{L}^{{z}^{\mathrm{IC}}}.$ Simulation results for the three-state model yield ${z}^{\mathrm{IC}}=0.346\ifmmode\pm\else\textpm\fi{}0.002,$ which is smaller than values of the dynamic exponent found for the SW and Wolff algorithms and also less than the Li-Sokal bound. The results are less conclusive for the Ising model, but it appears that ${z}^{\mathrm{IC}}<0.21$ and possibly that ${\ensuremath{\tau}}_{\ensuremath{\varepsilon},\mathrm{max}}\ensuremath{\sim}\mathrm{ln}L$ so that ${z}^{\mathrm{IC}}=0$---similar to previous results for the SW and Wolff algorithms.

arXiv:cond-mat/9811138•Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics•Feb 1, 1999•7 citations

Dynamic exponents for potts model cluster algorithms

Paul Coddington, CLIVE F. BAILLIE

We have studied the Swendsen-Wang and Wolff cluster update algorithms for the Ising model in 2, 3 and 4 dimensions. The data indicate simple relations between the specific heat and the Wolff autocorrelations, and between the magnetization and the Swendsen-Wang autocorrelations. This implies that the dynamic critical exponents are related to the static exponents of the Ising model. We also investigate the possibility of similar relationships for the Q-state Potts model.

Nuclear Physics B - Proceedings Supplements•Jan 1, 1992•1 citation
The dynamic behavior of cluster algorithms is analyzed in the classical mean-field limit. Rigorous analytical results below Tc{\mathit{T}}_{\mathit{c}}Tc​ establish that the dynamic exponent has the value zSW{\mathit{z}}_{\mathrm{SW}}zSW​=1 for the Swendsen-Wang algorithm and zW{\mathit{z}}_{\mathit{W}}zW​=0 for the Wolff algorithm. An efficient Monte Carlo implementation is introduced, adapted for using these algorithms for fully connected graphs. Extensive simulations both above and below Tc{\mathit{T}}_{\mathit{c}}Tc​ demonstrate scaling and evaluate the finite-size scaling function by means of a rather impressive collapse of the data. \textcopyright{} 1996 The American Physical Society.
We formulate a single-cluster Monte Carlo algorithm for the simulation of the random-cluster model. This algorithm is a generalization of the Wolff single-cluster method for the q-state Potts model to noninteger values q>1. Its results for static quantities are in a satisfactory agreement with those of the existing Swendsen-Wang-Chayes-Machta (SWCM) algorithm, which involves a full-cluster decomposition of random-cluster configurations. We explore the critical dynamics of this algorithm for several two-dimensional Potts and random-cluster models. For integer q, the single-cluster algorithm can be reduced to the Wolff algorithm, for which case we find that the autocorrelation functions decay almost purely exponentially, with dynamic exponents z(exp)=0.07 (1), 0.521 (7), and 1.007 (9) for q=2, 3, and 4, respectively. For noninteger q, the dynamical behavior of the single-cluster algorithm appears to be very dissimilar to that of the SWCM algorithm. For large critical systems, the autocorrelation function displays a range of power-law behavior as a function of time. The dynamic exponents are relatively large. We provide an explanation for this peculiar dynamic behavior.
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.
Simulations of the two-dimensional Ising and three-state Potts models at their critical points are performed using the invaded cluster (IC) algorithm. It is argued that observables measured on a sublattice of size l should exhibit a crossover to Swendsen-Wang (SW) behavior for l sufficiently less than the lattice size L, and a scaling form is proposed to describe the crossover phenomenon. It is found that the energy autocorrelation time ${\ensuremath{\tau}}_{\ensuremath{\varepsilon}}(l,L)$ for an $l\ifmmode\times\else\texttimes\fi{}l$ sublattice attains a maximum in the crossover region, and a dynamic exponent zIC{z}^{\mathrm{IC}}zIC for the IC algorithm is defined according to ${\ensuremath{\tau}}_{\ensuremath{\varepsilon},\mathrm{max}}\ensuremath{\sim}{L}^{{z}^{\mathrm{IC}}}.$ Simulation results for the three-state model yield ${z}^{\mathrm{IC}}=0.346\ifmmode\pm\else\textpm\fi{}0.002,$ which is smaller than values of the dynamic exponent found for the SW and Wolff algorithms and also less than the Li-Sokal bound. The results are less conclusive for the Ising model, but it appears that zIC<0.21{z}^{\mathrm{IC}}<0.21zIC<0.21 and possibly that ${\ensuremath{\tau}}_{\ensuremath{\varepsilon},\mathrm{max}}\ensuremath{\sim}\mathrm{ln}L$ so that zIC=0{z}^{\mathrm{IC}}=0zIC=0---similar to previous results for the SW and Wolff algorithms.