2001
DOI: 10.1007/pl00011151
|View full text |Cite
|
Sign up to set email alerts
|

A cluster Monte Carlo algorithm for 2-dimensional spin glasses

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 2 down to temperature T = 0.1. Our main result is that the correlation length diverges as an exponential (ξ ∼ e 2βJ ) and not as a power law as T → Tc = 0.PACS. 75.10.Nr Spin glass and other random m… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

4
175
2

Year Published

2005
2005
2024
2024

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 142 publications
(181 citation statements)
references
References 18 publications
4
175
2
Order By: Relevance
“…The latter estimate was qualitatively confirmed by a Monte Carlo renormalizationgroup measurement which indicated η ∼ 0.20 [18] again in what can now be recognized as being the T > T * (L) regime [19]. Later numerical simulation estimates were η ∼ 0.20 [20], η ∼ 0.138 [21], η > 0.20 [22], η = 0.20(2) [7].…”
Section: Introductionmentioning
confidence: 70%
See 1 more Smart Citation
“…The latter estimate was qualitatively confirmed by a Monte Carlo renormalizationgroup measurement which indicated η ∼ 0.20 [18] again in what can now be recognized as being the T > T * (L) regime [19]. Later numerical simulation estimates were η ∼ 0.20 [20], η ∼ 0.138 [21], η > 0.20 [22], η = 0.20(2) [7].…”
Section: Introductionmentioning
confidence: 70%
“…The spin interactions J ij were chosen from a bimodal distribution (±1 with equal probability) and from a Gaussian distribution N (0, 1) respectively. During the equilibration phase standard heat-bath updates were combined with the exchange Monte Carlo [17] and the Houdayer cluster method [20] on four replicas. We used 75 temperatures in geometric progression between 0.50 ≤ β ≤ 1.50 and also for 1 ≤ β ≤ 3.…”
Section: Correlation Function Measurementsmentioning
confidence: 99%
“…The Monte Carlo algorithm that we use also makes use of the CMR representation in addition to parallel tempering and Metropolis sweeps. Similar methods have been previously applied by Swendsen and Wang [17,26,37] and others [38,39,40]. The algorithm is described in more detail in [21], here we provide some additional details about the CMR component of the algorithm.…”
Section: Numerical Methods and Resultsmentioning
confidence: 97%
“…Las Vegas algorithms are widely used in fields like artificial intelligence [4], biology [5] and others. Monte Carlo algorithms are used in mathematics, condensed matter physics [6]- [8] and others.…”
Section: Introductionmentioning
confidence: 99%