Cluster-exact approximation of spin glass groundstates
โ Scribed by Alexander K. Hartmann
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 385 KB
- Volume
- 224
- Category
- Article
- ISSN
- 0378-4371
No coin nor oath required. For personal study only.
โฆ Synopsis
We present a fast (,-, O(N3)) algorithm which calculates groundstates of Ising spin glasses approximately. It works by randomly selecting clusters of spins which exhibit no frustrations. The spins which were not selected, contribute to the local fields of the selected spins. For the spin-cluster a groundstate is exactly calculated by using graphtheoretical methods. The other spins remain unchanged. This procedure is repeated many times resulting in a state of low energy. The total time complexity of this scheme is approximately cubic. To demonstrate how deep in energy this algorithm can get, we applied it to the +J model. We estimate that the groundstate energy density of the infinite system is -1.400-t-0.005 (2d) and -1.766 + 0.002 (3d). Finally the distribution of overlaps for selected systems is calculated in order to characterize the algorithm.
๐ SIMILAR VOLUMES
The spin glass in the random-bond Ising model on a simple cubic lattice is considered. A simple method to calculate the partial trace of the density matrices of a fairly large cluster by use of the REDUCE system is presented. The phase diagram showing the paramagnetic, ferromagnetic, antiferromagnet