Random matrices and complexity of spin glasses

Antonio Auffinger, Gérard Ben Arous, Jiří Černý

Research output: Contribution to journalArticlepeer-review

Abstract

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 k th-largest eigenvalue of the Gaussian orthogonal ensemble, extending the results of Ben Arous, Dembo, and Guionnet.

Original languageEnglish (US)
Pages (from-to)165-201
Number of pages37
JournalCommunications on Pure and Applied Mathematics
Volume66
Issue number2
DOIs
StatePublished - Feb 2013

ASJC Scopus subject areas

  • General Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Random matrices and complexity of spin glasses'. Together they form a unique fingerprint.

Cite this