arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1910.03504cond-mat.dis-nnmath-phmath.MP
收藏

随机正则图上的随机链接匹配问题

Random-link matching problems on random regular graphs

Giorgio Parisi, Gianmarco Perrupato, Gabriele Sicuro

摘要:

我们研究了随机正则图上的随机链接匹配问题,以及该问题的两个放松版本,即分数匹配和所谓的“循环”分数匹配。我们估计的渐近平均最优成本使用腔的方法。此外,我们还研究了有限尺寸修正,由于罕见的拓扑结构出现在大尺寸的图。我们估计这些贡献使用腔的方法,我们比较我们的结果与数值模拟的输出。分析还澄清了在完全连接的版本的问题,已经在文献中分析的有限大小的贡献的意义。

英文摘要:

We study the random-link matching problem on random regular graphs, alongside with two relaxed versions of the problem, namely the fractional matching and the so-called "loopy" fractional matching. We estimated the asymptotic average optimal cost using the cavity method. Moreover, we also study the finite-size corrections due to rare topological structures appearing in the graph at large sizes. We estimate these contributions using the cavity approach, and we compare our results with the output of numerical simulations. The analysis also clarifies the meaning of the finite-size contributions appearing in the fully-connected version of the problem, that has been already analyzed in the literature.

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

↑