Efficient algorithms for computing ground states of the 2D random-field Ising model
arXiv:2204.00042 · doi:10.1088/1742-6596/2207/1/012009
Abstract
We investigate the application of graph-cut methods for the study of the critical behaviour of the two-dimensional random-field Ising model. We focus on exact ground-state calculations, crossing the phase boundary of the model at zero temperature and varying the disorder strength. For this purpose we employ two different minimum-cut--maximum-flow algorithms, one of augmenting-path and another of push-relabel style. We implement these approaches for the square and triangular lattice problems and compare their computational efficiency.
6 pages, 4 figures, XXXII IUPAP Conference on Computational Physics
References in corpus (6)
- The three-dimensional random field Ising magnet: interfaces, scaling, and the nature of states
- Universality in the three-dimensional random-field Ising model
- Critical behavior of colloid-polymer mixtures in random porous media
- Efficient numerical methods for the random-field Ising model: Finite-size scaling, reweighting extrapolation, and computation of response functions
- Critical slowing down in polynomial time algorithms
- Domain walls and Schramm-Loewner evolution in the random-field Ising model