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

Oxford University Press eBooks

Other Algorithms for the Using Model

Mark E. J. Newman, G. T. Barkema

Published Feb 11, 1999• 0 citations
Publisher

Abstract

Abstract In the last chapter we saw that the Metropolis algorithm with single-spin-flip dynamics is an excellent Monte Carlo algorithm for simulating the using model when we are interested in temperatures well away from the critical temperature Tc However, as we approach the critical temperature, the combination of large critical fluctuations and long correlation time makes the errors on measured quantities grow enormously. As we pointed out, there is little to be done about the critical fluctuations, since these are an intrinsic property of the model near its phase transition (and are, what’s more, precisely the kind of interesting physical effect that we want to study with our simulations). On the other hand, the increase in the correlation time close to the phase transition is a function of the particular algorithm we are using-the Metropolis algorithm in this case-and it turns out that by using different algorithms we can greatly reduce this undesirable effect. In the first part of this chapter we will study one of the most widely used and successful such algorithms, the Wolff algorithm. Before introducing the algorithm however, we need to define a few terms.

DOI
10.1093/oso/9780198517962.003.0004

Related papers

Cluster hybrid Monte Carlo simulation algorithms

J. A. Plascak, Alan M. Ferrenberg, David Paul Landau

We show that addition of Metropolis single spin flips to the Wolff cluster-flipping Monte Carlo procedure leads to a dramatic increase in performance for the spin-1/2 Ising model. We also show that adding Wolff cluster flipping to the Metropolis or heat bath algorithms in systems where just cluster flipping is not immediately obvious (such as the spin-3/2 Ising model) can substantially reduce the statistical errors of the simulations. A further advantage of these methods is that systematic errors introduced by the use of imperfect random-number generation may be largely healed by hybridizing single spin flips with cluster flipping.

arXiv:cond-mat/0205264•Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics•Jun 13, 2002•39 citations

How much faster is Wolff than Metropolis at the critical point?

Musa Ahmad

I simulated the two-dimensional Ising model at its exact critical temperature with two Markov chain Monte Carlo methods, the single-spin Metropolis algorithm and the Wolff cluster algorithm, on periodic L×L lattices from L = 8 to L = 64. For each method I measured the integrated autocorrelation time of the energy and of the absolute magnetization, using four independent runs per lattice size. Both methods reproduce the exact finite-lattice energy within statistical error. For Metropolis, the autocorrelation time of |M| grows as L^z with z = 2.11(3) for L ≥ 16 and 2.16(5) for L ≥ 24, in line with the accepted value z ≈ 2.17 for local dynamics. For Wolff, measured in sweep-equivalent units, I get z = 0.29(1) from the energy and 0.15(1) from |M| for L ≥ 24, within the range of published values. In CPU time per statistically independent sample of |M|, Wolff was 5 times faster at L = 8 and 275 times faster at L = 64, and the gap grows roughly as L^2. All code and raw results are available, and the full study runs in under an hour on two CPU cores.

•Oct 30, 2026•0 citations

Numerical methods

Hidetoshi Nishimori, Gerardo Ortíz

Abstract This chapter introduces a few typical numerical methods used in modern studies of phase transitions and critical phenomena in spin systems. The first section describes the stochastic dynamics of a generic system with discrete degrees of freedom following the master equation. This section serves as a theoretical basis for the Monte Carlo method that includes the heat bath and Metropolis algorithms of configuration updates. Another useful numerical technique is the transfer matrix method, described in the last section, and which is applied for numerically exact evaluation of the free energy and related physical quantities.

Oxford University Press eBooks•Dec 2, 2010•1 citation

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 simulation of classical Heisenberg model in three dimensions

Ville Jantunen

We study the efficiency and theory behind various Markov chain Monte Carlo update methods (later MCMC) in the classical Heisenberg model in three dimensions. Classical Heisenberg model is a model in statistical physics that describes ferromagnetic phenomena. Classical Heisenberg model is a generalization of the Ising model where the spin is three dimensional unit vector instead of scalar -1 or 1. Both models show a second order phase transition which is the main reason we are interested in these models. The transition in our case describes the loss of magnetization of a ferromagnet as it is heated to its Curie temperature. Monte Carlo simulating the Classical Heisenberg model uses the same MCMC update methods as the Ising model. We introduce the theoretical background of Metropolis, Overrelaxation, and Wolff single cluster updates and study the dynamic critical exponents of Metropolis and Wolff updates. Results of this study are as expected: metropolis suffers from critical slowing down near the phase transition temperature and the autocorrelation time scales to L^5.08 , where L^3 is the size of the lattice. Wolff single cluster update avoids critical slowing down and scales very well with autocorrelation time scaling to L^3.28 . Even though Wolff update scales much better it has its downsides. Parallelization is a very important factor in modern scientific computing and Wolff update is very tricky to parallelize where as Metropolis parallelizes very well. Usually we can avoid this problem by running multiple instances of the simulation at the same time as varying simulation parameters such as the temperature. For large lattices the problems is that getting moderate results requires a lot of time.

Työväentutkimus Vuosikirja•Jan 1, 2017•0 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
Abstract In the last chapter we saw that the Metropolis algorithm with single-spin-flip dynamics is an excellent Monte Carlo algorithm for simulating the using model when we are interested in temperatures well away from the critical temperature Tc However, as we approach the critical temperature, the combination of large critical fluctuations and long correlation time makes the errors on measured quantities grow enormously. As we pointed out, there is little to be done about the critical fluctuations, since these are an intrinsic property of the model near its phase transition (and are, what’s more, precisely the kind of interesting physical effect that we want to study with our simulations). On the other hand, the increase in the correlation time close to the phase transition is a function of the particular algorithm we are using-the Metropolis algorithm in this case-and it turns out that by using different algorithms we can greatly reduce this undesirable effect. In the first part of this chapter we will study one of the most widely used and successful such algorithms, the Wolff algorithm. Before introducing the algorithm however, we need to define a few terms.
We show that addition of Metropolis single spin flips to the Wolff cluster-flipping Monte Carlo procedure leads to a dramatic increase in performance for the spin-1/2 Ising model. We also show that adding Wolff cluster flipping to the Metropolis or heat bath algorithms in systems where just cluster flipping is not immediately obvious (such as the spin-3/2 Ising model) can substantially reduce the statistical errors of the simulations. A further advantage of these methods is that systematic errors introduced by the use of imperfect random-number generation may be largely healed by hybridizing single spin flips with cluster flipping.
I simulated the two-dimensional Ising model at its exact critical temperature with two Markov chain Monte Carlo methods, the single-spin Metropolis algorithm and the Wolff cluster algorithm, on periodic L×L lattices from L = 8 to L = 64. For each method I measured the integrated autocorrelation time of the energy and of the absolute magnetization, using four independent runs per lattice size. Both methods reproduce the exact finite-lattice energy within statistical error. For Metropolis, the autocorrelation time of |M| grows as L^z with z = 2.11(3) for L ≥ 16 and 2.16(5) for L ≥ 24, in line with the accepted value z ≈ 2.17 for local dynamics. For Wolff, measured in sweep-equivalent units, I get z = 0.29(1) from the energy and 0.15(1) from |M| for L ≥ 24, within the range of published values. In CPU time per statistically independent sample of |M|, Wolff was 5 times faster at L = 8 and 275 times faster at L = 64, and the gap grows roughly as L^2. All code and raw results are available, and the full study runs in under an hour on two CPU cores.
Abstract This chapter introduces a few typical numerical methods used in modern studies of phase transitions and critical phenomena in spin systems. The first section describes the stochastic dynamics of a generic system with discrete degrees of freedom following the master equation. This section serves as a theoretical basis for the Monte Carlo method that includes the heat bath and Metropolis algorithms of configuration updates. Another useful numerical technique is the transfer matrix method, described in the last section, and which is applied for numerically exact evaluation of the free energy and related physical quantities.
We study the efficiency and theory behind various Markov chain Monte Carlo update methods (later MCMC) in the classical Heisenberg model in three dimensions. Classical Heisenberg model is a model in statistical physics that describes ferromagnetic phenomena. Classical Heisenberg model is a generalization of the Ising model where the spin is three dimensional unit vector instead of scalar -1 or 1. Both models show a second order phase transition which is the main reason we are interested in these models. The transition in our case describes the loss of magnetization of a ferromagnet as it is heated to its Curie temperature. Monte Carlo simulating the Classical Heisenberg model uses the same MCMC update methods as the Ising model. We introduce the theoretical background of Metropolis, Overrelaxation, and Wolff single cluster updates and study the dynamic critical exponents of Metropolis and Wolff updates. Results of this study are as expected: metropolis suffers from critical slowing down near the phase transition temperature and the autocorrelation time scales to L^5.08 , where L^3 is the size of the lattice. Wolff single cluster update avoids critical slowing down and scales very well with autocorrelation time scaling to L^3.28 . Even though Wolff update scales much better it has its downsides. Parallelization is a very important factor in modern scientific computing and Wolff update is very tricky to parallelize where as Metropolis parallelizes very well. Usually we can avoid this problem by running multiple instances of the simulation at the same time as varying simulation parameters such as the temperature. For large lattices the problems is that getting moderate results requires a lot of time.
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.