arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1105.3657cond-mat.stat-mechcond-mat.dis-nn
收藏

随机匹配问题

The stochastic matching problem

Fabrizio Altarelli, Alfredo Braunstein, Abolfazl Ramezanpour, Riccardo Zecchina

摘要:

匹配问题在组合优化和统计力学中起着基础性的作用。在它的随机变量中,优化决策必须只给出关于实例的一些概率信息。虽然确定性情况可以在多项式时间内解决,但随机变量在最坏情况下是难以处理的。我们提出了一种有效的方法来解决随机匹配问题,结合了一些功能的调查传播方程和空腔方法。我们测试它的随机二部图,我们分析的相图,并比较结果与精确的界限。我们的方法被证明是有效的数值上的所有参数,并优于国家的最先进的方法。最后,我们讨论了该方法如何可以推广到其他问题的不确定性下的优化。

英文摘要:

The matching problem plays a basic role in combinatorial optimization and in statistical mechanics. In its stochastic variants, optimization decisions have to be taken given only some probabilistic information about the instance. While the deterministic case can be solved in polynomial time, stochastic variants are worst-case intractable. We propose an efficient method to solve stochastic matching problems which combines some features of the survey propagation equations and of the cavity method. We test it on random bipartite graphs, for which we analyze the phase diagram and compare the results with exact bounds. Our approach is shown numerically to be effective on the full range of parameters, and to outperform state-of-the-art methods. Finally we discuss how the method can be generalized to other problems of optimization under uncertainty.

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

↑