arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2207.06161cond-mat.stat-mechcond-mat.dis-nn
收藏

如何在层级景观中计数:平均场复杂性的“完整”解

How to count in hierarchical landscapes: a 'full' solution to mean-field complexity

Jaron Kent-Dobias, Jorge Kurchan

AI总结:

本文推导了平均场复杂景观中驻点计数的通解,包含Parisi基态解,并应用于多步及完全复制对称破缺模型。

摘要:

我们推导了计数平均场复杂景观中驻点的通解。该解自然地包含了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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑