Worm algorithm for two-dimensional spin glasses
- 28 September 2005
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 72 (3) , 036706
Abstract
A worm algorithm is proposed for the two-dimensional spin glasses. The method is based on a low-temperature expansion of the partition function. The low-temperature configurations of the spin glass on square lattice can be viewed as strings connecting pairs of frustrated plaquettes. The worm algorithm directly manipulates these strings. It is shown that the worm algorithm is efficient, particularly if free boundary conditions are used. We obtain accurate low-temperature specific heat data consistent with a form , where is temperature and is coupling constant, for the two-dimensional spin glass.
Keywords
All Related Versions
This publication has 23 references indexed in Scilit:
- Correlation length of the two-dimensional Ising spin glass with bimodal interactionsPhysical Review B, 2005
- Dual geometric worm algorithm for two-dimensional discrete classical lattice modelsPhysical Review E, 2004
- Critical Thermodynamics of the Two-DimensionalIsing Spin GlassPhysical Review Letters, 2004
- Cluster Monte Carlo algorithm for the quantum rotor modelPhysical Review E, 2003
- Monte Carlo simulation of ice modelsPhysical Review E, 1998
- Monte Carlo Algorithms with Absorbing Markov Chains: Fast Local Algorithms for Slow DynamicsPhysical Review Letters, 1995
- Exact integer algorithm for the two-dimensional ±JIsing spin glassPhysical Review E, 1993
- Application of cluster algorithms to spin glassesPhysical Review Letters, 1992
- Low-temperature properties of theIsing spin glass in two dimensionsPhysical Review B, 1988
- Spin glasses: Experimental facts, theoretical concepts, and open questionsReviews of Modern Physics, 1986