Random Matrices and Complexity of Spin Glasses

We give an asymptotic evaluation of the complexity of spherical p‐spin spin glass models via random matrix theory. This study enables us to obtain detailed information about the bottom of the energy landscape, including the absolute minimum (the ground state), and the other local minima, and describ...

Full description

Saved in:
Bibliographic Details
Published in:Communications on pure and applied mathematics 2013-02, Vol.66 (2), p.165-201
Main Authors: Auffinger, Antonio, Arous, Gérard Ben, Černý, Jiří
Format: Article
Language:English
Subjects:
Asymptotic methods
Eigenvalues
Information
Normal distribution
Physics
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We give an asymptotic evaluation of the complexity of spherical p‐spin spin glass models via random matrix theory. This study enables us to obtain detailed information about the bottom of the energy landscape, including the absolute minimum (the ground state), and the other local minima, and describe an interesting layered structure of the low critical values for the Hamiltonians of these models. We also show that our approach allows us to compute the related TAPcomplexity and extend the results known in the physics literature. As an independent tool, we prove a large deviation principle for the kth‐largest eigenvalue of the Gaussian orthogonal ensemble, extending the results of Ben Arous, Dembo, and Guionnet. © 2012 Wiley Periodicals, Inc.
ISSN:0010-3640
1097-0312
DOI:10.1002/cpa.21422