English

Counting metastable states of Ising spin glasses on arbitrary graphs

Disordered Systems and Neural Networks 2009-11-13 v1 Statistical Mechanics

Abstract

Using a field-theoretical representation of the Tanaka-Edwards integral we develop a method to systematically compute the number N_s of 1-spin-stable states (local energy minima) of a glassy Ising system with nearest-neighbor interactions and random Gaussian couplings on an arbitrary graph. In particular, we use this method to determine N_s for K-regular random graphs and d-dimensional regular lattices for d=2,3. The method works also for other graphs. Excellent accuracy of the results allows us to observe that the number of local energy minima depends mainly on local properties of the graph on which the spin glass is defined.

Keywords

Cite

@article{arxiv.0801.1224,
  title  = {Counting metastable states of Ising spin glasses on arbitrary graphs},
  author = {B. Waclaw and Z. Burda},
  journal= {arXiv preprint arXiv:0801.1224},
  year   = {2009}
}

Comments

8 pages, 4 figures (one in color), additional materials can be found under http://www.physik.uni-leipzig.de/~waclaw/glasses-data.htm