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

Monte Carlo Studies of the Globally-Coupled Ising Model

Daniel Shai

Published Jan 1, 2007• 0 citations
OpenAlex

Abstract

•Goal: determine the density of states (g[E]): the number of spin configurations producing an energy, E. • In an unbiased random walk in energy space, realized by randomly flipping spins, the histogram of the energy distribution (h[E]) converges to the density of states (g[E]), but too slowly to be practical. •When the random walk is biased inversely to g[E] so that h[E] becomes flat, g[E] is constructed to within an error ∝ ln[f ] if at each energy visited, g[E] is redefined as g[E]× f . If f is incrementally reduced to = 1, g[E] becomes exact. •Random walk acceptance bias: P [E1 → E2] = min g[E1] g[E2] , 1 

Related papers

Monte Carlo study of the random-field Ising model

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

Using a cluster-flipping Monte Carlo algorithm combined with a generalization of the histogram reweighting scheme of Ferrenberg and Swendsen [Phys. Rev. Lett. 61, 2635 (1988); 63, 1195 (1989)], we have studied the equilibrium properties of the thermal random-field Ising model on a cubic lattice in three dimensions. We have equilibrated systems of L\ifmmode\times\else\texttimes\fi{}L\ifmmode\times\else\texttimes\fi{}L spins, with values of L up to 32, and for these systems the cluster-flipping method appears to a large extent to overcome the slow equilibration seen in single-spin-flip methods. From the results of our simulations we have extracted values for the critical exponents and the critical temperature and randomness of the model by finite size scaling. For the exponents we find \ensuremath{\nu}=1.02\ifmmode\pm\else\textpm\fi{}0.06, \ensuremath{\beta}=0.06\ifmmode\pm\else\textpm\fi{}0.07, \ensuremath{\gamma}=1.9\ifmmode\pm\else\textpm\fi{}0.2, and \ensuremath{\gamma}\ifmmode\bar\else\textasciimacron\fi{}=2.9\ifmmode\pm\else\textpm\fi{}0.2, where \ensuremath{\nu}, \ensuremath{\beta}, \ensuremath{\gamma}, and \ensuremath{\gamma}\ifmmode\bar\else\textasciimacron\fi{} govern the critical singularities in the correlation length, magnetization, and connected and disconnected susceptibilities, respectively. \textcopyright{} 1996 The American Physical Society.

arXiv:cond-mat/9507044•Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics•Jan 1, 1996•80 citations

Monte Carlo simulation of quenched two-dimensional single spin flip kinetic Ising model

Chikao Kawabata, Kyozi Kawasaki

Physics Letters A•Feb 1, 1978•23 citations

Optimality of Wang-Landau Sampling and Performance Limitations of Flat Histogram Methods

Simon Trebst

We determine the optimal scaling of local‐update flat‐histogram methods (such as multicanonical, broad histograms, tempering, or Wang‐Landau sampling) with system size by using a perfect flat‐histogram scheme based on the exact density of states of 2D Ising models. We find that the Wang‐Landau algorithm shows the same scaling as the perfect scheme and is thus optimal. However, even for the perfect scheme the scaling with the number of spins N is slower than the minimal N2 of an unbiased random walk in energy space for both, local and N‐fold way updates. While it still follows a power law N2Lz for the ferromagnetic and fully frustrated Ising model we find exponential scaling of the tunneling times in the case of the ±J Ising spin glass. The tunneling times of the ±J Ising spin glass are found to follow a fat‐tailed Fréchet extremal value distribution.

AIP conference proceedings•Jan 1, 2003•0 citations

Calculation of relative variance of the magnetization and susceptibility in a disordered Ising model. Results of monte carlo simulation

А. А. Бабаев, Akai Kurbanovich Murtazaev

Matematicheskoe modelirovanie•Dec 1, 2018•0 citations

Fast flat-histogram method for generalized spin models

Sylvain Reynal, H. T. Diep

We present a Monte Carlo method that efficiently computes the density of states for spin models having any number of interaction per spin. By combining a random walk in the energy space with collective updates controlled by the microcanonical temperature, our method yields dynamic exponents close to their ideal random-walk values, reduced equilibrium times, and very low statistical error in the density of states. The method can host any density of states estimation scheme, including the Wang-Landau algorithm and the transition matrix method. Our approach proves remarkably powerful in the numerical study of models governed by long-range interactions, where it is shown to reduce the algorithm complexity to that of a short-range model with the same number of spins. We apply the method to the -state Potts chains with power-law decaying interactions in their first-order regime; we find that conventional local-update algorithms are outperformed already for sizes above a few hundred spins. By considering chains containing up to spins, which we simulated in fairly reasonable time, we obtain estimates of transition temperatures correct to five-figure accuracy. Finally, we propose several efficient schemes aimed at estimating the microcanonical temperature.

arXiv:cond-mat/0504367•Physical Review E•Nov 28, 2005•18 citations

Monte Carlo renormalisation of the five-dimensional Ising model

R. Hirsch, Peter Freche

Analyses the five-dimensional Ising model using Monte Carlo methods.

Journal of Physics A Mathematical and General•Aug 21, 1985•1 citation
•Goal: determine the density of states (g[E]): the number of spin configurations producing an energy, E. • In an unbiased random walk in energy space, realized by randomly flipping spins, the histogram of the energy distribution (h[E]) converges to the density of states (g[E]), but too slowly to be practical. •When the random walk is biased inversely to g[E] so that h[E] becomes flat, g[E] is constructed to within an error ∝ ln[f ] if at each energy visited, g[E] is redefined as g[E]× f . If f is incrementally reduced to = 1, g[E] becomes exact. •Random walk acceptance bias: P [E1 → E2] = min g[E1] g[E2] , 1 
Using a cluster-flipping Monte Carlo algorithm combined with a generalization of the histogram reweighting scheme of Ferrenberg and Swendsen [Phys. Rev. Lett. 61, 2635 (1988); 63, 1195 (1989)], we have studied the equilibrium properties of the thermal random-field Ising model on a cubic lattice in three dimensions. We have equilibrated systems of L\ifmmode\times\else\texttimes\fi{}L\ifmmode\times\else\texttimes\fi{}L spins, with values of L up to 32, and for these systems the cluster-flipping method appears to a large extent to overcome the slow equilibration seen in single-spin-flip methods. From the results of our simulations we have extracted values for the critical exponents and the critical temperature and randomness of the model by finite size scaling. For the exponents we find \ensuremath{\nu}=1.02\ifmmode\pm\else\textpm\fi{}0.06, \ensuremath{\beta}=0.06\ifmmode\pm\else\textpm\fi{}0.07, \ensuremath{\gamma}=1.9\ifmmode\pm\else\textpm\fi{}0.2, and \ensuremath{\gamma}\ifmmode\bar\else\textasciimacron\fi{}=2.9\ifmmode\pm\else\textpm\fi{}0.2, where \ensuremath{\nu}, \ensuremath{\beta}, \ensuremath{\gamma}, and \ensuremath{\gamma}\ifmmode\bar\else\textasciimacron\fi{} govern the critical singularities in the correlation length, magnetization, and connected and disconnected susceptibilities, respectively. \textcopyright{} 1996 The American Physical Society.
We determine the optimal scaling of local‐update flat‐histogram methods (such as multicanonical, broad histograms, tempering, or Wang‐Landau sampling) with system size by using a perfect flat‐histogram scheme based on the exact density of states of 2D Ising models. We find that the Wang‐Landau algorithm shows the same scaling as the perfect scheme and is thus optimal. However, even for the perfect scheme the scaling with the number of spins N is slower than the minimal N2 of an unbiased random walk in energy space for both, local and N‐fold way updates. While it still follows a power law N2Lz for the ferromagnetic and fully frustrated Ising model we find exponential scaling of the tunneling times in the case of the ±J Ising spin glass. The tunneling times of the ±J Ising spin glass are found to follow a fat‐tailed Fréchet extremal value distribution.
We present a Monte Carlo method that efficiently computes the density of states for spin models having any number of interaction per spin. By combining a random walk in the energy space with collective updates controlled by the microcanonical temperature, our method yields dynamic exponents close to their ideal random-walk values, reduced equilibrium times, and very low statistical error in the density of states. The method can host any density of states estimation scheme, including the Wang-Landau algorithm and the transition matrix method. Our approach proves remarkably powerful in the numerical study of models governed by long-range interactions, where it is shown to reduce the algorithm complexity to that of a short-range model with the same number of spins. We apply the method to the -state Potts chains with power-law decaying interactions in their first-order regime; we find that conventional local-update algorithms are outperformed already for sizes above a few hundred spins. By considering chains containing up to spins, which we simulated in fairly reasonable time, we obtain estimates of transition temperatures correct to five-figure accuracy. Finally, we propose several efficient schemes aimed at estimating the microcanonical temperature.