arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1707.05541cond-mat.dis-nnmath-phmath.MP
收藏

一维随机欧氏匹配问题

Random Euclidean matching problems in one dimension

Sergio Caracciolo, Matteo D'Achille, Gabriele Sicuro

摘要:

本文讨论了一类凸代价函数的一维分配问题和一维匹配问题的最优匹配解。我们考虑的问题,在一个紧集的拓扑的间隔和周长。然后,我们假设点的位置是随机变量的相同和独立的分布在所考虑的区域。我们解析地获得了在非常大量的点$N$和一些关联函数的幂律型成本函数的形式$c(z)=z^p$,无论是在$p>1$的情况下,在$p<0$的情况下的渐近制度的平均最优成本。最优平均成本与点数的比例对于分配为$N^{-\frac{p}{2}}$,对于匹配为$N^{-p}$,当为$p>1$时,而在这两种情况下,当为$p<0$时,它都是常数。最后,我们的预测与数值模拟的结果进行了比较。

英文摘要:

We discuss the optimal matching solution for both the assignment problem and the matching problem in one dimension for a large class of convex cost functions. We consider the problem in a compact set with the topology both of the interval and of the circumference. Afterwards, we assume the points' positions to be random variables identically and independently distributed on the considered domain. We analytically obtain the average optimal cost in the asymptotic regime of very large number of points $N$ and some correlation functions for a power-law type cost function in the form $c(z)=z^p$, both in the $p>1$ case and in the $p<0$ case. The scaling of the optimal mean cost with the number of points is $N^{-\frac{p}{2}}$ for the assignment and $N^{-p}$ for the matching when $p>1$, whereas in both cases it is a constant when $p<0$. Finally, our predictions are compared with the results of numerical simulations.

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

↑