arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0508097cs.DScs.DM
收藏

基于最大乘积置信传播的LP紧性

Tightness of LP via Max-product Belief Propagation

Sujay Sanghavi, Devavrat Shah

摘要:

研究了稀疏随机加权图中寻找最大权独立集的线性规划松弛的紧性问题。我们证明了当节点权重为i.i.d.时,Erdos-Renyi图$G(n,c/n)$对于$c \leq 2e$和随机正则图$G(n,r)$对于$r\leq 4$是渐近紧的.平均值为1的指数分布。我们建立这些结果,通过LP松弛的紧密性和最大乘积置信传播算法的收敛性之间的精确关系。我们相信,这种新的方法理解的结构特性的组合问题,通过性能的迭代过程,如最大产品应感兴趣的权利。

英文摘要:

We investigate the question of tightness of linear programming (LP) relaxation for finding a maximum weight independent set (MWIS) in sparse random weighted graphs. We show that an edge-based LP relaxation is asymptotically tight for Erdos-Renyi graph $G(n,c/n)$ for $c \leq 2e$ and random regular graph $G(n,r)$ for $r\leq 4$ when node weights are i.i.d. with exponential distribution of mean 1. We establish these results, through a precise relation between the tightness of LP relaxation and convergence of the max-product belief propagation algorithm. We believe that this novel method of understanding structural properties of combinatorial problems through properties of iterative procedure such as the max-product should be of interest in its own right.

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

↑