Efficient algorithms for computing ground states of the 2D random-field Ising model

Argyro Mainou, Nikolaos Fytas, Martin Weigel

Research output: Contribution to journalConference articlepeer-review

1 Citation (Scopus)
45 Downloads (Pure)

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.
Original languageEnglish
Article number012009
Number of pages6
JournalJournal of Physics: Conference Series
Volume2207
DOIs
Publication statusPublished - 29 Mar 2022
EventXXXII IUPAP Conference on Computational Physics - Virtual, Coventry, United Kingdom
Duration: 1 Aug 20215 Aug 2021
Conference number: 32
https://ccp2021.complexity-coventry.org/

Bibliographical note

Content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.

Fingerprint

Dive into the research topics of 'Efficient algorithms for computing ground states of the 2D random-field Ising model'. Together they form a unique fingerprint.

Cite this