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

Argyro Mainou; Nikolaos Fytas; Martin Weigel

doi:10.1088/1742-6596/2207/1/012009

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

Argyro Mainou
, Nikolaos Fytas
, Martin Weigel

College of Engineering, Environment & Science

Research output: Contribution to journal › Conference article › peer-review

1 Citation (Scopus)

69 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 language	English
Article number	012009
Number of pages	6
Journal	Journal of Physics: Conference Series
Volume	2207
DOIs	https://doi.org/10.1088/1742-6596/2207/1/012009
Publication status	Published - 29 Mar 2022
Event	XXXII IUPAP Conference on Computational Physics - Virtual, Coventry, United Kingdom Duration: 1 Aug 2021 → 5 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.

Access to Document

10.1088/1742-6596/2207/1/012009

PublishedFinal published version, 1 MBLicence: CC BY

Cite this

@article{7512f8763d71475291f4090d7e9bb66f,

title = "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.",

author = "Argyro Mainou and Nikolaos Fytas and Martin Weigel",

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.; XXXII IUPAP Conference on Computational Physics, CCP2021 ; Conference date: 01-08-2021 Through 05-08-2021",

year = "2022",

month = mar,

day = "29",

doi = "10.1088/1742-6596/2207/1/012009",

language = "English",

volume = "2207",

journal = "Journal of Physics: Conference Series",

issn = "1742-6588",

publisher = "IOP Publishing Ltd.",

url = "https://ccp2021.complexity-coventry.org/",

}

TY - JOUR

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

AU - Mainou, Argyro

AU - Fytas, Nikolaos

AU - Weigel, Martin

N1 - Conference code: 32

PY - 2022/3/29

Y1 - 2022/3/29

N2 - 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.

AB - 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.

U2 - 10.1088/1742-6596/2207/1/012009

DO - 10.1088/1742-6596/2207/1/012009

M3 - Conference article

SN - 1742-6588

VL - 2207

JO - Journal of Physics: Conference Series

JF - Journal of Physics: Conference Series

M1 - 012009

T2 - XXXII IUPAP Conference on Computational Physics

Y2 - 1 August 2021 through 5 August 2021

ER -

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

Abstract

Bibliographical note

Access to Document

Fingerprint

Cite this