arXiv · cond-mat/9807260
Degeneracy Algorithm for Random Magnets
Abstract
It has been known for a long time that the ground state problem of random magnets, e.g. random field Ising model (RFIM), can be mapped onto the max-flow/min-cut problem of transportation networks. I build on this approach, relying on the concept of residual graph, and design an algorithm that I prove to be exact for finding all the minimum cuts, i.e. the ground state degeneracy of these systems. I demonstrate that this algorithm is also relevant for the study of the ground state properties of the dilute Ising antiferromagnet in a constant field (DAFF) and interfaces in random bond magnets.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Sorin Bastea. 1998-10-08. Degeneracy Algorithm for Random Magnets. https://doi.org/10.1103/physreve.58.7978
Cite the original work for its findings. Save a collection to share your selection of sources.