arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1212.6027math.PRcs.DMcs.ITmath.IT
收藏

随机完全图中最优边覆盖的置信传播

Belief propagation for optimal edge cover in the random complete graph

Mustafa Khandwawala, Rajesh Sundaresan

摘要:

本文将Aldous的客观方法应用于边费用为随机独立同分布的完全图的最小费用边覆盖问题。极限,作为顶点的数量趋于无穷大,预期的最小成本为这个问题是已知的通过组合方法的赫斯勒和韦斯特隆德。我们使用客观方法和局部弱收敛的机制证明了这一结果,并将其用于证明随机分配问题的$ζ(2)$极限。通过客观方法的证明是有用的,因为它为我们提供了更多的信息,在最小成本的边覆盖的一个典型的根上的边的事件的性质。我们进一步证明了置信传播算法渐近收敛到最优解。这可以应用于语义投射的计算语言学问题。置信度传播算法产生一个接近最优解的复杂性比已知的最佳算法设计的最优性在最坏的情况下设置。

英文摘要:

We apply the objective method of Aldous to the problem of finding the minimum-cost edge cover of the complete graph with random independent and identically distributed edge costs. The limit, as the number of vertices goes to infinity, of the expected minimum cost for this problem is known via a combinatorial approach of Hessler and Wästlund. We provide a proof of this result using the machinery of the objective method and local weak convergence, which was used to prove the $ζ(2)$ limit of the random assignment problem. A proof via the objective method is useful because it provides us with more information on the nature of the edge's incident on a typical root in the minimum-cost edge cover. We further show that a belief propagation algorithm converges asymptotically to the optimal solution. This can be applied in a computational linguistics problem of semantic projection. The belief propagation algorithm yields a near optimal solution with lesser complexity than the known best algorithms designed for optimality in worst-case settings.

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

↑