How to count in hierarchical landscapes: a 'full' solution to mean-field complexity
Statistical Mechanics
2023-06-21 v2 Disordered Systems and Neural Networks
Abstract
We derive the general solution for counting the stationary points of mean-field complex landscapes. It incorporates Parisi's solution for the ground state, as it should. Using this solution, we count the stationary points of two models: one with multi-step replica symmetry breaking, and one with full replica symmetry breaking.
Keywords
Cite
@article{arxiv.2207.06161,
title = {How to count in hierarchical landscapes: a 'full' solution to mean-field complexity},
author = {Jaron Kent-Dobias and Jorge Kurchan},
journal= {arXiv preprint arXiv:2207.06161},
year = {2023}
}