arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0010063math.PRmath-phmath.MP
收藏

随机指派问题中的zeta(2)极限

The zeta(2) limit in the random assignment problem

David J. Aldous

摘要:

随机分配(或二部匹配)问题研究n个工件中的每一个到n台机器中的每一台的最优分配的随机总成本A_n,其中n^2个可能的工件-机器匹配的成本具有指数(均值1)分布。梅扎德-帕里西(Mezard - Parisi,1987)利用统计物理学中的复制方法,非严格地论证了EA_n收敛于zeta(2)= pi^2/6。Aldous(1992)将极限定义为无限树上匹配问题的最优解。继续这种方法,我们构造无限树上的最佳匹配。这给出了最优匹配中边代价及其秩序的zeta(2)极限和严格极限分布的严格证明。

英文摘要:

The random assignment (or bipartite matching) problem studies the random total cost A_n of the optimal assignment of each of n jobs to each of n machines, where the costs of the n^2 possible job-machine matches has exponential (mean 1) distribution. Mezard - Parisi (1987) used the replica method from statistical physics to argue non-rigorously that EA_n converges to zeta(2) = pi^2/6. Aldous (1992) identified the limit as the optimal solution of a matching problem on an infinite tree. Continuing that approach, we construct the optimal matching on the infinite tree. This yields a rigorous proof of the zeta(2) limit and of the conjectured limit distribution of edge-costs and their rank-orders in the optimal matching.

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

↑