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

Physica A Statistical Mechanics and its Applications

Critical slowing down in Ising model for Creutz algorithm

Bülent Kutlu, Nevzat AKTEKİN

Published Aug 1, 1994• 14 citations
Publisher
DOI
10.1016/0378-4371(94)00027-1

Related papers

Dynamical finite-size scaling function of the four dimensional ising model for Creutz algorithm

Ziya Merdan, Ali Günen, Şükrü Çavdar

Physica A Statistical Mechanics and its Applications•Jun 10, 2005•10 citations

Critical slowing down of diffusion in a one-dimensional kinetic Ising model

W. Zwerger

Physics Letters A•Aug 1, 1981•28 citations

Simulation of the four-dimensional Ising model on the Creutz cellular automaton

Nevzat AKTEKİN

Physica A Statistical Mechanics and its Applications•Oct 1, 1996•23 citations

Critical slowing down in microcanonical Ising dynamics

Richard C. Brower, K.J.M. Moriarty, Eric Myers +2 more

We describe measurements of autocorrelation times in a version of Creutz's microcanonical dynamics for the nearest-neighbor Ising system on a 128\ifmmode\times\else\texttimes\fi{}129\ifmmode\times\else\texttimes\fi{}128 lattice. The dynamical critical exponent z is found to be z=2.26\ifmmode\pm\else\textpm\fi{}0.05, which is comparable to the dynamical critical exponent for Monte Carlo algorithms.

Physical review. B, Condensed matter•Dec 1, 1988•7 citations

Critical behaviour of the Ising model

J. Hubbard

Physics Letters A•Jun 1, 1972•73 citations

Critical Slowing Down of Cluster Algorithms for Ising Models Coupled to 2-d Gravity

Mark J. Bowick, Marco Falcioni, Geoffrey Harris +1 more

We simulate single and multiple Ising models coupled to 2–d gravity using both the Swendsen-Wang and Wolff algorithms to update the spins. We study the integrated autocorrelation time and find that there is considerable critical slowing down, particularly in the magnetization. We argue that this is primarily due to the local nature of the dynamical triangulation algorithm and to the generation of a distribution of baby universes which inhibits cluster growth. SU–HEP–93–4241–560 SCCS 568 hep-lat/9311036 Considerable work has been devoted to the study of the performance of cluster algorithms in reducing the critical slowing down of many statistical models. The Swendsen-Wang [1] and the Wolff [2] algorithms have proven very effective in beating the critical slowing down (CSD) exhibited by these models when simulated with a standard Metropolis [3] update. Reviews on cluster algorithms and CSD may be found on refs. [4]. In recent years, the numerical study of Potts models coupled to 2–d gravity has received much attention [5, 6, 7], aided as well by increased analytical understanding of these models [8]. Cluster algorithms have proved useful in saving computational effort on the update of the Potts variables. The present study is motivated by the fact that there is little understanding of the actual extent of the improvement achieved in these simulations. It is worthwhile, therefore, to measure CSD in the case of simple Ising spins coupled to a dynamical lattice in order to quantify the performance of cluster algorithms. We find that there is considerable CSD, especially in the magnetization, and we relate this to the dynamics of cluster formation on a random lattice.

•Nov 23, 1993•4 citations
We simulate single and multiple Ising models coupled to 2–d gravity using both the Swendsen-Wang and Wolff algorithms to update the spins. We study the integrated autocorrelation time and find that there is considerable critical slowing down, particularly in the magnetization. We argue that this is primarily due to the local nature of the dynamical triangulation algorithm and to the generation of a distribution of baby universes which inhibits cluster growth. SU–HEP–93–4241–560 SCCS 568 hep-lat/9311036 Considerable work has been devoted to the study of the performance of cluster algorithms in reducing the critical slowing down of many statistical models. The Swendsen-Wang [1] and the Wolff [2] algorithms have proven very effective in beating the critical slowing down (CSD) exhibited by these models when simulated with a standard Metropolis [3] update. Reviews on cluster algorithms and CSD may be found on refs. [4]. In recent years, the numerical study of Potts models coupled to 2–d gravity has received much attention [5, 6, 7], aided as well by increased analytical understanding of these models [8]. Cluster algorithms have proved useful in saving computational effort on the update of the Potts variables. The present study is motivated by the fact that there is little understanding of the actual extent of the improvement achieved in these simulations. It is worthwhile, therefore, to measure CSD in the case of simple Ising spins coupled to a dynamical lattice in order to quantify the performance of cluster algorithms. We find that there is considerable CSD, especially in the magnetization, and we relate this to the dynamics of cluster formation on a random lattice.