arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2604.04652math.COmath.PR
收藏

临界区域中非存在概率和下尾问题的Belief Propagation方法

Non-existence probabilities and lower tails in the critical regime via Belief Propagation

King’s College London(伦敦国王学院);Georgia Institute of Technology(佐治亚理工学院);Max Planck Institute for Software Systems(马克斯·普朗克软件系统研究所);Massachusetts Institute of Technology(麻省理工学院)

Matthew Jenssen, Will Perkins, Aditya Potukuchi, Michael Simkin

AI总结:

本文通过Belief Propagation方法研究了临界区域中多种组合问题的非存在概率和下尾概率的对数渐进行为,适用于随机图子图和整数集中的k项等差数列。

摘要:

我们计算了在临界区域中,对于多种组合问题,参数范围内的非存在概率(更一般地说是下尾概率)的对数渐进行为。该方法适用于估计k-正则超图的p-随机顶点子集诱导的超边显著少于预期的概率。我们证明,在超图满足某些简单结构条件且p上界由硬核模型在无限k-正则线性超树上的相变确定时,该概率可近似为Bethe自由能函数在超图上Belief Propagation算子唯一固定点处的值。

英文摘要:

We compute the logarithmic asymptotics of the non-existence probability (and more generally the lower-tail probability) for a wide variety of combinatorial problems for a range of parameters in the `critical regime' between the regime amenable to hypergraph container methods and that amenable to Janson's inequality. Examples include lower tails and non-existence probabilities for subgraphs of random graphs and for $k$-term arithmetic progressions in random sets of integers. Our methods apply in the general framework of estimating the probability that a $p$-random subset of vertices in a $k$-uniform hypergraph induces significantly fewer hyperedges than expected. We show that under some simple structural conditions on the hypergraph and an upper bound on $p$ determined by a phase transition in the hard-core model on the infinite $k$-uniform, $Δ$-regular, linear hypertree, this probability can be accurately approximated by the Bethe free energy evaluated at the unique fixed point of a Belief Propagation operator on the hypergraph.

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

↑