arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0810.0584cond-mat.dis-nn
收藏

随机顶点覆盖问题的基态熵

Ground-State Entropy of the Random Vertex-Cover Problem

Jie Zhou, Haijun Zhou

摘要:

计算自旋玻璃或NP完全组合优化问题的基态的数量甚至比找到单个基态的已经很难的任务更困难。本文基于统计力学的空腔方法,通过一组迭代方程估计了随机图的最小顶点覆盖的熵。在迭代过程中,每个顶点的腔熵贡献和腔磁化都被更新。这种方法克服了零温第一步复制对称破缺(1RSB)自旋玻璃理论中迭代发散的困难。当1RSB平均场论不再稳定时,它仍然适用。该方法可以推广到计算其他随机图自旋玻璃系统的基态和亚稳最小能态的熵。

英文摘要:

Counting the number of ground states for a spin-glass or NP-complete combinatorial optimization problem is even more difficult than the already hard task of finding a single ground state. In this paper the entropy of minimum vertex-covers of random graphs is estimated through a set of iterative equations based on the cavity method of statistical mechanics. During the iteration both the cavity entropy contributions and cavity magnetizations for each vertex are updated. This approach overcomes the difficulty of iterative divergence encountered in the zero temperature first-step replica-symmetry-breaking (1RSB) spin-glass theory. It is still applicable when the 1RSB mean-field theory is no longer stable. The method can be extended to compute the entropies of ground-states and metastable minimal-energy states for other random-graph spin-glass systems.

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

↑