Next nearest neighbour Ising models on random graphs
arXiv:1206.4270 · doi:10.1088/1742-5468/2012/09/P09007
Abstract
This paper develops results for the next nearest neighbour Ising model on random graphs. Besides being an essential ingredient in classic models for frustrated systems, second neighbour interactions interactions arise naturally in several applications such as the colour diversity problem and graphical games. We demonstrate ensembles of random graphs, including regular connectivity graphs, that have a periodic variation of free energy, with either the ratio of nearest to next nearest couplings, or the mean number of nearest neighbours. When the coupling ratio is integer paramagnetic phases can be found at zero temperature. This is shown to be related to the locked or unlocked nature of the interactions. For anti-ferromagnetic couplings, spin glass phases are demonstrated at low temperature. The interaction structure is formulated as a factor graph, the solution on a tree is developed. The replica symmetric and energetic one-step replica symmetry breaking solution is developed using the cavity method. We calculate within these frameworks the phase diagram and demonstrate the existence of dynamical transitions at zero temperature for cases of anti-ferromagnetic coupling on regular and inhomogeneous random graphs.
55 pages, 15 figures, version 2 with minor revisions, to be published J. Stat. Mech
References in corpus (5)
- Gibbs States and the Set of Solutions of Random Constraint Satisfaction Problems
- Constraint satisfaction problems with isolated solutions are hard
- On the exactness of the cavity method for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs
- Phase diagram of the three states Potts model with next nearest neighbor interactions on the Bethe lattice
- Phase diagram of an Ising model with competitive interactions on a Husimi tree and its disordered counterpart