Complexity of the Sherrington-Kirkpatrick Model in the Annealed Approximation
Disordered Systems and Neural Networks
2009-11-10 v1 Statistical Mechanics
Abstract
A careful critical analysis of the complexity, at the annealed level, of the Sherrington-Kirkpatrick model has been performed. The complexity functional is proved to be always invariant under the Becchi-Rouet-Stora-Tyutin supersymmetry, disregarding the formulation used to define it. We consider two different saddle points of such functional, one satisfying the supersymmetry [A. Cavagna {\it et al.}, J. Phys. A {\bf 36} (2003) 1175] and the other one breaking it [A.J. Bray and M.A. Moore, J. Phys. C {\bf 13} (1980) L469]. We review the previews studies on the subject, linking different perspectives and pointing out some inadequacies and even inconsistencies in both solutions.
Cite
@article{arxiv.cond-mat/0307082,
title = {Complexity of the Sherrington-Kirkpatrick Model in the Annealed Approximation},
author = {A. Crisanti and L. Leuzzi and G. Parisi and T. Rizzo},
journal= {arXiv preprint arXiv:cond-mat/0307082},
year = {2009}
}
Comments
20 pages, 4 figures