A sampling algorithm is presented that generates spin-glass configurations of the two-dimensional Edwards-Anderson Ising spin glass at finite temperature with probabilities proportional to their Boltzmann weights. Such an algorithm overcomes the slow dynamics of direct simulation and can be used to study long-range correlation functions and coarse-grained dynamics. The algorithm uses a correspondence between spin configurations on a regular lattice and dimer (edge) coverings of a related graph: Wilson's algorithm for sampling dimer coverings on a planar lattice is adapted to generate samplings for the dimer problem corresponding to both planar and toroidal spin-glass samples. This algorithm is recursive: it computes probabilities for spins along a "separator" that divides the sample in half. Given the spins on the separator, sample configurations for the two separated halves are generated by further division and assignment. The algorithm is simplified by using Pfaffian elimination rather than Gaussian elimination for sampling dimer configurations. For n spins and given floating point precision, the algorithm has an asymptotic run-time of O (n3/2); it is found that the required precision scales as inverse temperature and grows only slowly with system size. Sample applications and benchmarking results are presented for samples of size up to n= 1282, with fixed and periodic boundary conditions.
|Original language||English (US)|
|Journal||Physical Review E - Statistical, Nonlinear, and Soft Matter Physics|
|State||Published - Oct 30 2009|
ASJC Scopus subject areas
- Statistical and Nonlinear Physics
- Statistics and Probability
- Condensed Matter Physics