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

A Markov-property Monte Carlo method: One-dimensional Ising model

George Allen Baker Jr.

Published Aug 1, 1993• 7 citations
Publisher
DOI
10.1007/bf01048026

Related papers

The Markov property method applied to Ising model calculations

George Allen Baker Jr.

Journal of Statistical Physics•Dec 1, 1994•14 citations

Tensor network Monte Carlo simulations for the two-dimensional random-bond Ising model

Tao Chen, Erdong Guo, Wanzhou Zhang +2 more

Disordered lattice spin systems are crucial in both theoretical and applied physics. However, understanding their properties poses significant challenges to Monte Carlo simulations. In this work, we investigate the two-dimensional random-bond Ising model using the recently proposed tensor network Monte Carlo (TNMC) method. This method generates biased samples from conditional probabilities computed via tensor network contractions and corrects the bias using the Metropolis scheme. Consequently, the proposals provided by tensor networks function as block updates for Monte Carlo simulations. Through extensive numerical experiments, we demonstrate that TNMC simulations can be performed on lattices as large as $1024\ifmmode\times\else\texttimes\fi{}1024$ spins with moderate computational resources, a substantial increase from the previous maximum size of $64\ifmmode\times\else\texttimes\fi{}64$ in Markov-chain Monte Carlo. Notably, we observe an almost complete absence of critical slowing down, enabling the efficient collection of unbiased samples and averaging over a large number of random realizations of bond disorders. We successfully pinpoint the multicritical point along the Nishimori line with significant precision and accurately determined the bulk and surface critical exponents. Our findings suggest that TNMC is a highly efficient algorithm for exploring disordered and frustrated systems in two dimensions.

arXiv:2409.06538•Physical review. B./Physical review. B•Mar 4, 2025•12 citations

Some Monte-Carlo Studies of the Ising Model

George Allen Baker Jr., Jerome J. Erpenbeck

Springer proceedings in physics•Jan 1, 1994•1 citation

Monte Carlo Study of One-Dimensional Ising Models with Long-Range Interactions

Yusuke Tomita

Recently, Fukui and Todo have proposed a new effective Monte Carlo algorithm for long-range interacting systems. Using the algorithm with the nonequilibrium relaxation method, we investigated long-range interacting one-dimensional Ising models both ferromagnetic and antiferromagnetic with the nearest-neighbor ferromagnetic interaction. For the antiferromagnetic model, we found the systems are paramagnetic at finite temperatures.

Journal of the Physical Society of Japan•Dec 25, 2008•21 citations

Acceptance rate is a thermodynamic function in local Monte Carlo algorithms

Evgeni Burovski, Wolfhard Janke E, Maria Guskova +1 more

We study properties of Markov chain Monte Carlo simulations of classical spin models with local updates. We derive analytic expressions for the mean value of the acceptance rate of single-spin-flip algorithms for the one-dimensional Ising model. We find that for the Metropolis algorithm the average acceptance rate is a linear function of energy. We further provide numerical results for the energy dependence of the average acceptance rate for the three- and four-state Potts model, and the XY model in one and two spatial dimensions. In all cases, the acceptance rate is an almost linear function of the energy in the critical region. The variance of the acceptance rate is studied as a function of the specific heat. While the specific heat develops a singularity in the vicinity of a phase transition, the variance of the acceptance rate stays finite.

arXiv:1907.06776•Physical review. E•Dec 10, 2019•4 citations

Hierarchical Monte Carlo simulation of the Ising model

Michael Faas, H. J. Hilhorst

Physica A Statistical Mechanics and its Applications•Apr 1, 1986•11 citations
Disordered lattice spin systems are crucial in both theoretical and applied physics. However, understanding their properties poses significant challenges to Monte Carlo simulations. In this work, we investigate the two-dimensional random-bond Ising model using the recently proposed tensor network Monte Carlo (TNMC) method. This method generates biased samples from conditional probabilities computed via tensor network contractions and corrects the bias using the Metropolis scheme. Consequently, the proposals provided by tensor networks function as block updates for Monte Carlo simulations. Through extensive numerical experiments, we demonstrate that TNMC simulations can be performed on lattices as large as $1024\ifmmode\times\else\texttimes\fi{}1024$ spins with moderate computational resources, a substantial increase from the previous maximum size of $64\ifmmode\times\else\texttimes\fi{}64$ in Markov-chain Monte Carlo. Notably, we observe an almost complete absence of critical slowing down, enabling the efficient collection of unbiased samples and averaging over a large number of random realizations of bond disorders. We successfully pinpoint the multicritical point along the Nishimori line with significant precision and accurately determined the bulk and surface critical exponents. Our findings suggest that TNMC is a highly efficient algorithm for exploring disordered and frustrated systems in two dimensions.
We study properties of Markov chain Monte Carlo simulations of classical spin models with local updates. We derive analytic expressions for the mean value of the acceptance rate of single-spin-flip algorithms for the one-dimensional Ising model. We find that for the Metropolis algorithm the average acceptance rate is a linear function of energy. We further provide numerical results for the energy dependence of the average acceptance rate for the three- and four-state Potts model, and the XY model in one and two spatial dimensions. In all cases, the acceptance rate is an almost linear function of the energy in the critical region. The variance of the acceptance rate is studied as a function of the specific heat. While the specific heat develops a singularity in the vicinity of a phase transition, the variance of the acceptance rate stays finite.