Degeneracy Algorithm for Random Magnets

Details Degeneracy Algorithm for Random Magnets Degeneracy Algorithm for Random Magnets

1998-07-17

arxiv.org/abs/cond-mat/9807260v3

Physical Review E 58, 7978 (1998)

Physics

Condensed Matter

Disordered Systems and Neural Networks

17 pages(Revtex), 8 Postscript figures(5color) to appear in Phys. Rev. E 58, December 1st (1998)

Scientific paper

10.1103/PhysRevE.58.7978

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.

Affiliated with

Also associated with

No associations

Rating

Degeneracy Algorithm for Random Magnets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Degeneracy Algorithm for Random Magnets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Degeneracy Algorithm for Random Magnets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-357087