arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0904.3395cond-mat.dis-nncond-mat.stat-mechcs.DM
收藏

抽取随机约束满足问题的腔方法及置信传播引导抽取算法分析

On the cavity method for decimated random constraint satisfaction problems and the analysis of belief propagation guided decimation algorithms

Federico Ricci-Tersenghi, Guilhem Semerjian

摘要:

我们介绍了一个版本的腔方法稀释的平均场自旋模型,允许计算类似的Franz-Parisi淬火势在稀疏随机图模型的热力学量。该方法是在部分抽取随机约束满足问题的特殊情况下开发的。这允许开发一类算法的理论理解,用于解决约束满足问题,其中基本的自由度顺序分配根据消息传递过程(置信传播)的结果。我们面对这种理论分析的结果,广泛的数值模拟。

英文摘要:

We introduce a version of the cavity method for diluted mean-field spin models that allows the computation of thermodynamic quantities similar to the Franz-Parisi quenched potential in sparse random graph models. This method is developed in the particular case of partially decimated random constraint satisfaction problems. This allows to develop a theoretical understanding of a class of algorithms for solving constraint satisfaction problems, in which elementary degrees of freedom are sequentially assigned according to the results of a message passing procedure (belief-propagation). We confront this theoretical analysis to the results of extensive numerical simulations.

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

↑