随机分式匹配问题
The Random Fractional Matching Problem
摘要:
我们考虑两个配方的随机链接分数匹配问题,更标准的随机链接(整数)匹配问题的一个轻松的版本。在一个公式中,我们允许每个节点在最佳匹配配置中与其自身链接。相反,在另一个国家,这种联系是被禁止的。这两个问题在完全图上具有相同的随机链接匹配问题的渐近平均最优代价。使用复制方法和Wästlund [Acta Mathematica 204,91-150(2010)]的先前结果,我们解析地导出对渐近最优成本的有限大小校正。我们比较我们的结果与数值模拟,我们讨论了随机链接分数匹配问题和随机链接匹配问题之间的主要区别。
英文摘要:
We consider two formulations of the random-link fractional matching problem, a relaxed version of the more standard random-link (integer) matching problem. In one formulation, we allow each node to be linked to itself in the optimal matching configuration. In the other one, on the contrary, such a link is forbidden. Both problems have the same asymptotic average optimal cost of the random-link matching problem on the complete graph. Using a replica approach and previous results of Wästlund [Acta Mathematica 204, 91-150 (2010)], we analytically derive the finite-size corrections to the asymptotic optimal cost. We compare our results with numerical simulations and we discuss the main differences between random-link fractional matching problems and the random-link matching problem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。