Counting metastable states of Ising spin glasses on arbitrary graphs

Details Counting metastable states of Ising spin glasses on arbitrary graphs Counting metastable states of Ising spin glasses on arbitrary graphs

2008-01-08

arxiv.org/abs/0801.1224v1

Phys. Rev. E 77, 041114 (2008)

Physics

Condensed Matter

Disordered Systems and Neural Networks

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

Scientific paper

10.1103/PhysRevE.77.041114

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.

Affiliated with

Also associated with

No associations

Rating

Counting metastable states of Ising spin glasses on arbitrary graphs 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 Counting metastable states of Ising spin glasses on arbitrary graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting metastable states of Ising spin glasses on arbitrary graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-421162