Degeneracy algorithm for random magnets
Sorin Bastea · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · 1998
It has been known for a long time that the ground-state problem of random magnets, e.g., the random field Ising model, can be mapped onto the maximum flow, minimum cut problem of transportation networks. We build on this approach, relying on the concept of residual graph, and design an algorithm that we prove to be exact for finding all the minimum cuts, i.e., the ground-state degeneracy of these systems. We demonstrate that this algorithm is also relevant for the study of the ground-state properties of the dilute Ising antiferromagnet in a constant field and interfaces in random bond magnets.