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

随机K-可满足性公式的单解簇中的解的社区

Communities of solutions in single solution clusters of a random K-Satisfiability formula

Haijun Zhou, Hui Ma

摘要:

K-可满足性(K-SAT)公式的解空间是解簇的集合,每个解簇包含通过一系列单自旋翻转相互可达的所有解。了解解簇的统计性质对于全面理解随机K-SAT问题的解空间结构和计算复杂性是很有价值的。本文通过无偏和有偏随机游走过程以及统计物理中的复制对称腔方法,研究了随机3-和4-SAT公式的单解簇。我们发现当公式的约束密度仍然低于解空间聚类过渡点时,解空间的巨连通分支已经形成了许多不同的社区。同一社区的解决方案彼此之间的相似性更高,并且彼此之间的联系比与其他解决方案之间的联系更紧密。一个解决方案社区的熵密度计算使用信念传播,并发现是不同的同一集群的不同社区。当约束密度超过聚类过渡点时,几种随机搜索算法得到的解簇也表现出相同的行为。总而言之,这项工作的结果为随机K-SAT问题的解空间结构的演变提供了更精确的图像;它们也可能有助于设计新的启发式算法。

英文摘要:

The solution space of a K-satisfiability (K-SAT) formula is a collection of solution clusters, each of which contains all the solutions that are mutually reachable through a sequence of single-spin flips. Knowledge of the statistical property of solution clusters is valuable for a complete understanding of the solution space structure and the computational complexity of the random K-SAT problem. This paper explores single solution clusters of random 3- and 4-SAT formulas through unbiased and biased random walk processes and the replica-symmetric cavity method of statistical physics. We find that the giant connected component of the solution space has already formed many different communities when the constraint density of the formula is still lower than the solution space clustering transition point. Solutions of the same community are more similar with each other and more densely connected with each other than with the other solutions. The entropy density of a solution community is calculated using belief propagation and is found to be different for different communities of the same cluster. When the constraint density is beyond the clustering transition point, the same behavior is observed for the solution clusters reached by several stochastic search algorithms. Taking together, the results of this work suggests a refined picture on the evolution of the solution space structure of the random K-SAT problem; they may also be helpful for designing new heuristic algorithms.

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

↑