The ground state of the k J spin glass from a heuristic matching algorithm
نویسندگان
چکیده
We present a heuristic matching algorithm for the generation of ground states of the short-range * J spin glass in two dimensions. It is much faster than previous heuristic algorithms. I t achieves near optimal solutions in time O( N ) in contrast to the best known exact algorithm which needs a time of O ( N S ” ) . From simulations with lattice sizes of up to 210 x 210 we confirm a phase transition at p = 0.105 but we cannot confirm a proposed second transition near p = 0.15.
منابع مشابه
The ground state energy of the Edwards-Anderson spin glass model with a parallel tempering Monte Carlo algorithm
We study the efficiency of parallel tempering Monte Carlo technique for calculating true ground states of the Edwards-Anderson spin glass model. Bimodal and Gaussian bond distributions were considered in two and three-dimensional lattices. By a systematic analysis we find a simple formula to estimate the values of the parameters needed in the algorithm to find the GS with a fixed average probab...
متن کاملNumerical results for ground states of spin glasses on Bethe lattices
The average ground state energy and entropy for ±J spin glasses on Bethe lattices of connectivities k + 1 = 3 . . . , 26 at T = 0 are approximated numerically. To obtain sufficient accuracy for large system sizes (up to n = 2), the Extremal Optimization heuristic is employed which provides high-quality results not only for the ground state energies per spin ek+1 but also for their entropies sk+...
متن کاملSpin and chiral stiffness of the XY spin glass in two dimensions
We analyze the zero-temperature behavior of the XY EdwardsAnderson spin glass model on a square lattice. A newly developed algorithm combining exact ground-state computations for Ising variables embedded into the planar spins with a specially tailored evolutionary method, resulting in the genetic embedded matching (GEM) approach, allows for the computation of numerically exact ground states for...
متن کاملOptimization by Move–Class Deflation
A new approach to combinatorial optimization based on systematic move– class deflation is proposed. The algorithm combines heuristics of genetic algorithms and simulated annealing, and is mainly entropy–driven. It is tested on two problems known to be NP hard, namely the problem of finding ground states of the SK spin–glass and of the 3-D ±J spin–glass. The algorithm is sensitive to properties ...
متن کاملGROUND MOTION CLUSTERING BY A HYBRID K-MEANS AND COLLIDING BODIES OPTIMIZATION
Stochastic nature of earthquake has raised a challenge for engineers to choose which record for their analyses. Clustering is offered as a solution for such a data mining problem to automatically distinguish between ground motion records based on similarities in the corresponding seismic attributes. The present work formulates an optimization problem to seek for the best clustering measures. In...
متن کامل