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 Letters

Cluster-update acceleration of interface roughening in the 3D Ising model

Martin Hasenbusch B, Steffen Meyer

Published Feb 4, 1991• 36 citations
Publisher

Abstract

We present a new cluster-update Monte Carlo algorithm for a fluctuating interface in the 3D Ising model. Critical slowing down is drastically reduced and the dynamical critical exponent at the roughening temperature of the 3D Ising model is found to be ${\mathit{z}}_{\mathrm{cl}}$=0.44\ifmmode\pm\else\textpm\fi{}0.03. For the Metropolis algorithm we obtain ${\mathit{z}}_{\mathrm{Met}}$=2.0\ifmmode\pm\else\textpm\fi{}0.1 while the Swendsen-Wang algorithm performs even worse than local updating. A new method which suppresses fluctuations in the two bulk phases is introduced to determine moments of the interfacial thickness.

DOI
10.1103/physrevlett.66.530

Related papers

MONTE CARLO SIMULATIONS OF THE ISING MODEL ON THREE-DIMENSIONAL RANDOM LATTICE USING THE CLUSTER ALGORITHM

JI DA-REN, J. B. Zhang, (1)浙江大学,杭州310027; (2)浙江近代物理中心,杭州310027

In order to reduce the critical slowing down in Monte Carlo simulations, a numerical study for the Ising model on 3-D random lattice using Swendsen-Wang algorithm is performed. The critical point obtained is βc=0. 075±0. 001. Moreover, to analyse the dynamical property of Swendsen-Wang method, the dynamical critical exponent z is estimated. The result is z =0. 74 ±0. 03. This indicates that the Swendsen-Wang method can greatly reduce the critical slowing down for the Ising model on 3-D random lattice.

Acta Physica Sinica•Jan 1, 1993•0 citations

MONTE CARLO SIMULATIONS OF THE ISING MODEL ON THREE-DIMENSIONAL RANDOM LATTICE USING THE CLUSTER ALGORITHM

J Hang

In order to reduce the critical slowing down in Monte Carlo simulations, a numerical study for the Ising model on 3-D random lattice using Swendsen-Wang algorithm is performed. The critical point obtained isβc=0. 075?. 001. Moreover, to analyse the dynamical property of Swendsen-Wang method, the dynamical critical exponent z is estimated. The result is z =0. 74 ±0. 03. This indicates that the Swendsen-Wang method can greatly reduce the critical slowing down for the Ising model on 3-D random lattice.

Acta Physica Sinica•Jan 1, 1993•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•2 citations

A new MCRG (Monte Carlo Renormalization Group) calculation of the critical behavior of the 3d ising model - preliminary results

CLIVE F. BAILLIE, Kenneth N. Barish, Rajan Gupta +1 more

We have undertaken a large-scale computer simulation of the 3d Ising model using the Monte Carlo Renormalization Group (MCRG) method. Our calculation improves on past calculations in three ways. Firstly, larger lattices are used -- we have run on 128{sup 3} as well as 64{sup 3}. Secondly, many more spin operators -- 53 even and 46 odd -- are measured. Lastly, we have incorporated more efficient ways of spin update -- Wolff's single-cluster variant of the Swendsen and Wang algorithm. In addition to calculating the critical temperature the thermal and magnetic exponents, and improving the estimate of the correction-to-scaling exponent, we are aiming to verify the presence of redundant operators. We do not yet have sufficient statistics to give final results so here we describe our calculation and present preliminary results which demonstrate that we have control over both finite size effects and systematic errors arising from truncation. 16 refs., 7 figs.

•Oct 5, 1989•0 citations

The Cluster Updating Monte Carlo Algorithm Applied to the 3 d Ising Problem

F. Livet

The cluster updating Monte Carlo algorithm is applied to the 3 d simple cubic Ising model. The experimental results are shown to have no critical slowing-down. A simple method predicts the limits of any Monte Carlo calculation. These limits are closely approached. The information treatment is then discussed in calculating the transition temperature. By the simple “fourth-order cumulant method” of Binder, one obtains β c ≃ 0.221 654 4(10).

Europhysics Letters (EPL)•Sep 7, 1991•24 citations

Replica-exchange cluster algorithm

Wolfhard Janke E, Elmar Bittner

In finite-size scaling analyses of Monte Carlo simulations of second-order phase transitions one often needs an extended temperature/energy range around the critical point.By combining the replica-exchange algorithm with cluster updates and an adaptive routine to find the range of interest, we introduce a new flexible and powerful method for systematic investigations of critical phenomena.As a result, we gain two further orders of magnitude in the performance for 2D and 3D Ising models in comparison with the recently proposed Wang-Landau recursion for cluster algorithms based on the multibondic algorithm, which is already a great improvement over the standard multicanonical variant.

arXiv:1108.0354•International Symposium on Lattice Field Theory (LATTICE)•Jun 23, 2010•0 citations
We present a new cluster-update Monte Carlo algorithm for a fluctuating interface in the 3D Ising model. Critical slowing down is drastically reduced and the dynamical critical exponent at the roughening temperature of the 3D Ising model is found to be zcl{\mathit{z}}_{\mathrm{cl}}zcl​=0.44\ifmmode\pm\else\textpm\fi{}0.03. For the Metropolis algorithm we obtain zMet{\mathit{z}}_{\mathrm{Met}}zMet​=2.0\ifmmode\pm\else\textpm\fi{}0.1 while the Swendsen-Wang algorithm performs even worse than local updating. A new method which suppresses fluctuations in the two bulk phases is introduced to determine moments of the interfacial thickness.
In order to reduce the critical slowing down in Monte Carlo simulations, a numerical study for the Ising model on 3-D random lattice using Swendsen-Wang algorithm is performed. The critical point obtained is βc=0. 075±0. 001. Moreover, to analyse the dynamical property of Swendsen-Wang method, the dynamical critical exponent z is estimated. The result is z =0. 74 ±0. 03. This indicates that the Swendsen-Wang method can greatly reduce the critical slowing down for the Ising model on 3-D random lattice.
In order to reduce the critical slowing down in Monte Carlo simulations, a numerical study for the Ising model on 3-D random lattice using Swendsen-Wang algorithm is performed. The critical point obtained isβc=0. 075?. 001. Moreover, to analyse the dynamical property of Swendsen-Wang method, the dynamical critical exponent z is estimated. The result is z =0. 74 ±0. 03. This indicates that the Swendsen-Wang method can greatly reduce the critical slowing down for the Ising model on 3-D random lattice.
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 undertaken a large-scale computer simulation of the 3d Ising model using the Monte Carlo Renormalization Group (MCRG) method. Our calculation improves on past calculations in three ways. Firstly, larger lattices are used -- we have run on 128{sup 3} as well as 64{sup 3}. Secondly, many more spin operators -- 53 even and 46 odd -- are measured. Lastly, we have incorporated more efficient ways of spin update -- Wolff's single-cluster variant of the Swendsen and Wang algorithm. In addition to calculating the critical temperature the thermal and magnetic exponents, and improving the estimate of the correction-to-scaling exponent, we are aiming to verify the presence of redundant operators. We do not yet have sufficient statistics to give final results so here we describe our calculation and present preliminary results which demonstrate that we have control over both finite size effects and systematic errors arising from truncation. 16 refs., 7 figs.
In finite-size scaling analyses of Monte Carlo simulations of second-order phase transitions one often needs an extended temperature/energy range around the critical point.By combining the replica-exchange algorithm with cluster updates and an adaptive routine to find the range of interest, we introduce a new flexible and powerful method for systematic investigations of critical phenomena.As a result, we gain two further orders of magnitude in the performance for 2D and 3D Ising models in comparison with the recently proposed Wang-Landau recursion for cluster algorithms based on the multibondic algorithm, which is already a great improvement over the standard multicanonical variant.