A dedicated algorithm for calculating ground states for the triangular random bond Ising model
arXiv:1007.5463 · doi:10.1016/j.cpc.2010.10.030
Abstract
In the presented article we present an algorithm for the computation of ground state spin configurations for the 2d random bond Ising model on planar triangular lattice graphs. Therefore, it is explained how the respective ground state problem can be mapped to an auxiliary minimum-weight perfect matching problem, solvable in polynomial time. Consequently, the ground state properties as well as minimum-energy domain wall (MEDW) excitations for very large 2d systems, e.g. lattice graphs with up to N=384x384 spins, can be analyzed very fast. Here, we investigate the critical behavior of the corresponding T=0 ferromagnet to spin-glass transition, signaled by a breakdown of the magnetization, using finite-size scaling analyses of the magnetization and MEDW excitation energy and we contrast our numerical results with previous simulations and presumably exact results.
5 pages, 5 figures
References in corpus (10)
- Low-temperature behavior of two-dimensional Gaussian Ising spin glasses
- A practical guide to computer simulations
- Domain-Wall Energies and Magnetization of the Two-Dimensional Random-Bond Ising Model
- Matching Kasteleyn Cities for Spin Glass Ground States
- Fractal dimension of domain walls in two-dimensional Ising spin glasses
- autoScale.py - A program for automatic finite-size scaling analyses: A user's guide
- Ground states of two-dimensional J Edwards-Anderson spin glasses
- Exact Ground States of Large Two-Dimensional Planar Ising Spin Glasses
- Negative-weight percolation
- Scaling behavior of domain walls at the T=0 ferromagnet to spin-glass transition
Cited by in corpus (9)
- Domain-wall excitations in the two-dimensional Ising spin glass
- Collective effects of the cost of opinion change
- Typical and large-deviation properties of minimum-energy paths on disordered hierarchical lattices
- Is negative-weight percolation compatible with SLE?
- Mean-field behavior of the negative-weight percolation model on random regular graphs
- Configurational statistics of densely and fully packed loops in the negative-weight percolation model
- Biased and greedy random walks on two-dimensional lattices with quenched randomness: the "greedy" ant within a disordered environment
- Exact Ground States of the Kaya-Berker Model
- Intrinsic Heralding and Optimal Decoders for Non-Abelian Topological Order