Degeneracy Algorithm for Random Magnets
| dc.creator | Bastea, Sorin | |
| dc.date | 1998-07-17 | |
| dc.date | 1998-10-08 | |
| dc.date.accessioned | 2026-07-07T06:25:00Z | |
| dc.date.available | 2026-07-07T06:25:00Z | |
| dc.description | 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. | |
| dc.description | 17 pages(Revtex), 8 Postscript figures(5color) to appear in Phys. Rev. E 58, December 1st (1998) | |
| dc.identifier | https://arxiv.org/abs/cond-mat/9807260 | |
| dc.identifier | http://arxiv.org/abs/cond-mat/9807260 | |
| dc.identifier | Physical Review E 58, 7978 (1998) | |
| dc.identifier | doi:10.1103/PhysRevE.58.7978 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/96733 | |
| dc.subject | Disordered Systems and Neural Networks | |
| dc.subject | Statistical Mechanics | |
| dc.title | Degeneracy Algorithm for Random Magnets | |
| dc.type | text |