警告传播:稳定性与次临界性
Warning Propagation: stability and subcriticality
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 a very general class of multi-type random graphs. We prove that under mild assumptions on the random graph model and the stability of the the message limit, 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 multi-type 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分析而来,可能存在错误,请以论文正文为准。