A cluster Monte Carlo algorithm for 2-dimensional spin glasses

2001/01/31 by J. Houdayer · 11 citations
Economics, Econometrics and Finance · Mathematics · Physics and Astronomy · #Complex Systems and Time Series Analysis #Random Matrices and Applications #Theoretical and Computational Physics #cond-mat.dis-nn

paper · pdf · doi:10.1007/pl00011151

published as Eur. Phys. J. B 22, 479 (2001) · 6 pages, 9 figures, section 2 completly rewritten

arxiv created 2001/05/28 · openalex publication_date 2001/08/01 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29

Abstract

A new Monte Carlo algorithm for 2-dimensional spin glasses is presented. The use of clusters makes possible global updates and leads to a gain in speed of several orders of magnitude. As an example, we study the 2-dimensional +/-J Edwards-Anderson model. The new algorithm allows us to equilibrate systems of size 100² down to temperature T = 0.1. Our main result is that the correlation length diverges as an exponential and not as a power law as T -> Tc = 0.

Cited by

• Fair sampling of ground-state configurations of binary optimization problems
• Energy gap of the bimodal two-dimensional Ising spin glass
• Evidence for Two-Dimensional Spin-Glass Ordering in Submonolayer Fe Films on Cleaved InAs Surfaces
• The nature of the different zero-temperature phases in discrete two-dimensional spin glasses: entropy, universality, chaos and cascades in the renormalization group flow
• Critical behavior of the three-dimensional bond-diluted Ising spin glass: Finite-size scaling functions and universality
• Finite-Size Scaling in the Energy-Entropy Plane for the 2D ± Ising Spin Glass
• The Percolation Signature of the Spin Glass Transition
• Critical thermodynamics of the two-dimensional +/-J Ising spin glass
• Worm algorithm for two-dimensional spin glasses
• Bimodal and Gaussian Ising spin glasses in dimension two
• Author Correction: Analog errors in quantum annealing: doom and hope