arXiv Analytics

Sign in

arXiv:1003.1129 [math.PR]AbstractReferencesReviewsResources

Random Matrices and complexity of Spin Glasses

A. Auffinger, G. Ben Arous, J. Cerny

Published 2010-03-04, updated 2011-11-07Version 2

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), 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 TAP-complexity and extend the results known in the physics literature. As an independent tool, we prove a LDP for the k-th largest eigenvalue of the GOE, extending the results of Ben Arous, Dembo and Guionnett (2001).

Comments: 25 pages, 1 figure, references added
Categories: math.PR, math-ph, math.MP
Subjects: 60G15, 60B20, 82B44
Related articles: Most relevant | Search more
arXiv:2105.05043 [math.PR] (Published 2021-05-11, updated 2022-10-05)
Complexity of bipartite spherical spin glasses
arXiv:1103.2801 [math.PR] (Published 2011-03-14, updated 2011-05-09)
Random matrices: Universal properties of eigenvectors
arXiv:1206.5180 [math.PR] (Published 2012-06-22, updated 2013-01-30)
Invertibility of random matrices: unitary and orthogonal perturbations