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

Materials Today Proceedings

Simulation of an extended 3D mixed Ising model by Monte Carlo method

Anouar Elidrysy, Said Harir, A. Zouhair, Y. Boughaleb

Published Jan 1, 2020• 16 citations
Publisher
DOI
10.1016/j.matpr.2020.04.370

Related papers

Pushing the Limits of Monte Carlo Simulations for the 3d Ising Model

Jiahao Xu, Alan M. Ferrenberg, David Paul Landau

Bulletin of the American Physical Society•Mar 14, 2017•1 citation

Exploration of dynamic phase transition of 3D Ising model with a new long-range interaction by using the Monte Carlo method

Bo-chen Li, Wei Wang

Chinese Journal of Physics•May 14, 2024•44 citations

Bond dilution in the 3D Ising model: a Monte Carlo study

Pierre Emmanuel Berche, Christophe Chatelain, Bertrand Berche +1 more

arXiv:cond-mat/0402596•The European Physical Journal B•Apr 1, 2004•68 citations

Static and dynamic critical behaviour of 3d random-site Ising model: Different Monte Carlo algorithms

Dmytro Ivaneyko, Jaroslav Ilnytskyi, Bertrand Berche +1 more

arXiv:cond-mat/0508719•Journal of Molecular Liquids•May 7, 2006•3 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
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).