arXiv · 2204.00042
Efficient algorithms for computing ground states of the 2D random-field Ising model
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.
Explore related subjects
Keep this discovery
Argyro Mainou, Nikolaos G. Fytas, Martin Weigel. 2022-03-31. Efficient algorithms for computing ground states of the 2D random-field Ising model. https://doi.org/10.1088/1742-6596/2207/1/012009
Cite the original work for its findings. Save a collection to share your selection of sources.