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/0405469 · Journal of Physics A Mathematical and General

Dynamical critical behaviours of the Ising spin chain: Swendsen–Wang and Wolff algorithms

P. L. Krapivsky

Published Jun 22, 2004• 3 citations
arXivHTMLPDF

Abstract

We study the zero-temperature Ising chain evolving according to the Swendsen–Wang dynamics. We determine analytically the domain length distribution and various 'historical' characteristics, e.g. the density of unreacted domains is shown to scale with the average domain length as ⟨ l ⟩ −δ with δ = 3/2 (for the q -state Potts model, δ = 1 + q −1 ). We also compute the domain length distribution for the Ising chain endowed with the zero-temperature Wolff dynamics.

DOI
10.1088/0305-4470/37/27/004

Related papers

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

Dynamic exponents for potts model cluster algorithms

Paul David 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

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•4 citations

Critical behavior of the long-range Ising chain from the largest-cluster probability distribution

Katarina Uzelac, Zvonko Glumac, A. Aničić

Monte Carlo simulations of the one-dimensional Ising model with ferromagnetic interactions decaying with distance r as 1/r(1+sigma) are performed by applying the Swendsen-Wang cluster algorithm with cumulative probabilities. The critical behavior in the nonclassical critical regime corresponding to 0.5<sigma<1 is derived from finite-size scaling analysis of the largest cluster.

arXiv:cond-mat/0011306•Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics•Feb 20, 2001•11 citations

Nonequilibrium behaviors of the three-dimensional Heisenberg model in the Swendsen-Wang algorithm

Yoshihiko Nonomura, Yusuke Tomita

Recently, it was shown [Y. Nonomura, J. Phys. Soc. Jpn. 83, 113001 (2014)JUPSAU0031-901510.7566/JPSJ.83.113001] that the nonequilibrium critical relaxation of the two-dimensional (2D) Ising model from a perfectly ordered state in the Wolff algorithm is described by stretched-exponential decay, and a universal scaling scheme was found to connect nonequilibrium and equilibrium behaviors. In the present study we extend these findings to vector spin models, and the 3D Heisenberg model could be a typical example. To evaluate the critical temperature and critical exponents precisely using the above scaling scheme, we calculate nonequilibrium ordering from the perfectly disordered state in the Swendsen-Wang algorithm, and we find that the critical ordering process is described by stretched-exponential growth with a comparable exponent to that of the 3D XY model. The critical exponents evaluated in the present study are consistent with those in previous studies.

arXiv:1508.05218•Physical review. E•Jan 4, 2016•8 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•2 citations
We study the zero-temperature Ising chain evolving according to the Swendsen–Wang dynamics. We determine analytically the domain length distribution and various 'historical' characteristics, e.g. the density of unreacted domains is shown to scale with the average domain length as ⟨ l ⟩ −δ with δ = 3/2 (for the q -state Potts model, δ = 1 + q −1 ). We also compute the domain length distribution for the Ising chain endowed with the zero-temperature Wolff dynamics.
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.
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).
Recently, it was shown [Y. Nonomura, J. Phys. Soc. Jpn. 83, 113001 (2014)JUPSAU0031-901510.7566/JPSJ.83.113001] that the nonequilibrium critical relaxation of the two-dimensional (2D) Ising model from a perfectly ordered state in the Wolff algorithm is described by stretched-exponential decay, and a universal scaling scheme was found to connect nonequilibrium and equilibrium behaviors. In the present study we extend these findings to vector spin models, and the 3D Heisenberg model could be a typical example. To evaluate the critical temperature and critical exponents precisely using the above scaling scheme, we calculate nonequilibrium ordering from the perfectly disordered state in the Swendsen-Wang algorithm, and we find that the critical ordering process is described by stretched-exponential growth with a comparable exponent to that of the 3D XY model. The critical exponents evaluated in the present study are consistent with those in previous studies.
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.