Efficient algorithms for computing ground states of the 2D random-field Ising model
Disordered Systems and Neural Networks
2022-04-04 v1
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.
Cite
@article{arxiv.2204.00042,
title = {Efficient algorithms for computing ground states of the 2D random-field Ising model},
author = {Argyro Mainou and Nikolaos G. Fytas and Martin Weigel},
journal= {arXiv preprint arXiv:2204.00042},
year = {2022}
}
Comments
6 pages, 4 figures, XXXII IUPAP Conference on Computational Physics