We present an efficient algorithm for finding the first excited state of the randomfield Ising model based on the equivalence of its Hamiltonian with the capacity of cuts of a certain network. Some preliminary results in the two-dimensional case with a Gaussian distribution of random fields are pres
Efficient Algorithm for Finding Ground-States in the Random Field Ising Model with an External Field
✍ Scribed by Carlos Frontera; Jürgen Goicoechea; Jordi Ortı́n; Eduard Vives
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 68 KB
- Volume
- 160
- Category
- Article
- ISSN
- 0021-9991
No coin nor oath required. For personal study only.
✦ Synopsis
We present an efficient algorithm that, combined with a max-flow, min-cut minimization algorithm, makes it possible to find the ground states of the Gaussian Random Field Ising model when the external applied field B is continuously varied from -∞ to +∞. The algorithm exactly finds all the possible ground states and their limiting range (B min , B max ). Examples of the dependence of the magnetization and energy with B are shown for the 2d-RFIM.
📜 SIMILAR VOLUMES
It is proven that the Dirac Hamiltonian H for a spin 1r2 neutral particle with an anomalous magnetic moment in an arbitrary dimensional electrostatic field has supersymmetric quantum mechanical structure. By estimating the number of the zero-energy ground states of H from below, it is proven that th