Degeneracy Algorithm for Random Magnets
arXiv:cond-mat/9807260 · doi:10.1103/PhysRevE.58.7978
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.
17 pages(Revtex), 8 Postscript figures(5color) to appear in Phys. Rev. E 58, December 1st (1998)
References in corpus (7)
- Stressed backbone and elasticity of random central-force systems
- The 3-d Random Field Ising Model at zero temperature
- Numerical Results for the Ground-State Interface in a Random Medium
- Scaling of the Random-Field Ising Model at Zero Temperature
- Frustrated Systems: Ground State Properties via Combinatorial Optimization
- Ground State Structure of Random Magnets
- Ground state structure of diluted antiferromagnets and random field systems