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

Journal of Statistical Physics

Single-cluster Monte Carlo dynamics for the Ising model

Pablo Tamayo, Richard C. Brower, W. Klein

Published Mar 1, 1990• 68 citations
Publisher
DOI
10.1007/bf01026564

Related papers

Comparison between cluster Monte Carlo algorithms in the Ising model

Ulli Wolff A

Physics Letters B•Sep 1, 1989•210 citations

Cluster Monte Carlo dynamics for the Ising model on fractal structures in dimensions between one and two

Pascal Monceau, Pai‐Yi Hsiao

The European Physical Journal B•Feb 1, 2003•8 citations

Monte Carlo study of the ising model phase transition in terms of the percolation transition of “physical clusters”

Marco D’Onorio De Meo, Dieter W. Heermann, Kurt Binder

Journal of Statistical Physics•Sep 1, 1990•60 citations

MONTE CARLO METHODS IN SEQUENTIAL AND PARALLEL COMPUTING OF 2D AND 3D ISING MODEL

M. Diaconu, R. Puscasu, Alexandru Stancu +1 more

Because of its complexity, the 3D Ising model has not been given an exact analytic solution so far, as well as the 2D Ising in non zero external field conditions. In real materials the phase transition creates a discontinuity. We analysed the Ising model that presents similar discontinuities. We use Monte Carlo methods with a single spin change or a spin cluster change to calculate macroscopic quantities, such as specific heat and magnetic susceptibility. We studied the differences between these methods. Local MC algorithms (such as Metropolis) perform poorly for large lattices because they update only one spin at a time, so it takes many iterations to get a statistically independent configuration. More recent spin cluster algorithms use clever ways of finding clusters of sites that can be updated at once. The single cluster method is probably the best sequential cluster algorithm. We also used the entropic sampling method to simulate the density of states. This method takes into account all possible configurations, not only the most probable. The entropic method also gives good results in the 3D case. We studied the usefulness of distributed computing for Ising model. We established a parallelization strategy to explore Metropolis Monte Carlo simulation and Swendsen-Wang Monte Carlo simulation of this spin model using the data parallel languages on different platform. After building a computer cluster we made a Monte Carlo estimation of 2D and 3D Ising thermodynamic properties and compare the results with the sequential computing. In the same time we made quantitative analysis such as speed up and efficiency for different sets of combined parameters (e.g. lattice size, parallel algorithms, chosen model).

•Jan 1, 2003•0 citations

Monte Carlo simulations of Ising models

Walter Selke

Computer Physics Communications•Aug 1, 1996•1 citation

Cluster Monte Carlo dynamics for the antiferromagnetic Ising model on a triangular lattice

G. M. Zhang, C. Z. Yang

Within the general cluster framework of Kandel, Ben-Av, and Domany, we develop a cluster algorithm for Monte Carlo simulations of the antiferromagnetic Ising model on a triangular lattice. The algorithm does not suffer from problems of metastability and is extremely efficient even at T=0, which allows us to extract the static exponent \ensuremath{\eta}=0.5 as well as the effective dynamical critical exponent of the algorithm z=0.64\ifmmode\pm\else\textpm\fi{}0.02.

Physical review. B, Condensed matter•Nov 1, 1994•16 citations
Because of its complexity, the 3D Ising model has not been given an exact analytic solution so far, as well as the 2D Ising in non zero external field conditions. In real materials the phase transition creates a discontinuity. We analysed the Ising model that presents similar discontinuities. We use Monte Carlo methods with a single spin change or a spin cluster change to calculate macroscopic quantities, such as specific heat and magnetic susceptibility. We studied the differences between these methods. Local MC algorithms (such as Metropolis) perform poorly for large lattices because they update only one spin at a time, so it takes many iterations to get a statistically independent configuration. More recent spin cluster algorithms use clever ways of finding clusters of sites that can be updated at once. The single cluster method is probably the best sequential cluster algorithm. We also used the entropic sampling method to simulate the density of states. This method takes into account all possible configurations, not only the most probable. The entropic method also gives good results in the 3D case. We studied the usefulness of distributed computing for Ising model. We established a parallelization strategy to explore Metropolis Monte Carlo simulation and Swendsen-Wang Monte Carlo simulation of this spin model using the data parallel languages on different platform. After building a computer cluster we made a Monte Carlo estimation of 2D and 3D Ising thermodynamic properties and compare the results with the sequential computing. In the same time we made quantitative analysis such as speed up and efficiency for different sets of combined parameters (e.g. lattice size, parallel algorithms, chosen model).