随机图上的警告传播
Warning Propagation on random graphs
AI总结:
该论文在二项随机图上全面分析警告传播算法,证明在温和稳定性假设下其快速收敛,并将不动点分析归结为 Galton-Watson 树上的过程,证实并推广了 Pittel 等人的经典启发式结果。
摘要:
警告传播是一种组合消息传递算法,它统一并推广了多种递归组合过程。特殊情况包括用于可满足性的单元子句传播和纯文字算法,以及用于识别随机图 $k$-核的剥离过程。在此,我们在二项随机图上全面分析警告传播。我们证明,在温和的稳定性假设下,警告传播快速收敛。实际上,对随机图上消息传递过程不动点的分析归结为对 Galton-Watson 树上的过程进行分析。这一结果证实并推广了 Pittel、Spencer 和 Wormald 在其开创性的 $k$-核论文(JCTB 1996)中首次提出的启发式方法。
英文摘要:
Warning Propagation is a combinatorial message passing algorithm that unifies and generalises a wide variety of recursive combinatorial procedures. Special cases include the Unit Clause Propagation and Pure Literal algorithms for satisfiability as well as the peeling process for identifying the $k$-core of a random graph. Here we analyse Warning Propagation in full generality on the binomial random graph. We prove that under a mild stability assumption Warning Propagation converges rapidly. In effect, the analysis of the fixed point of the message passing process on a random graph reduces to analysing the process on a Galton-Watson tree. This result corroborates and generalises a heuristic first put forward by Pittel, Spencer and Wormald in their seminal $k$-core paper (JCTB 1996).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。