论文标题
如何计数层次景观：一种“完整”解决方案的均值复杂性
How to count in hierarchical landscapes: a 'full' solution to mean-field complexity
论文作者
论文摘要
我们得出了计算平均场复合物景观的固定点的一般解决方案。它纳入了Parisi的基础状态解决方案。使用此解决方案，我们计算两个模型的固定点：一个具有多步复制对称性破坏的固定点，另一个具有完整的副本对称性破坏。
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.
