English

Finite-size corrections in the random assignment problem

Disordered Systems and Neural Networks 2017-05-18 v2

Abstract

We analytically derive, in the context of the replica formalism, the first finite size corrections to the average optimal cost in the random assignment problem for a quite generic distribution law for the costs. We show that, when moving from a power-law distribution to a Γ\Gamma distribution, the leading correction changes both in sign and in its scaling properties. We also examine the behavior of the corrections when approaching a δ\delta-function distribution. By using a numerical solution of the saddle-point equations, we provide predictions that are confirmed by numerical simulations.

Keywords

Cite

@article{arxiv.1702.05991,
  title  = {Finite-size corrections in the random assignment problem},
  author = {Sergio Caracciolo and Matteo P. D'Achille and Enrico M. Malatesta and Gabriele Sicuro},
  journal= {arXiv preprint arXiv:1702.05991},
  year   = {2017}
}

Comments

16 pages, 4 figures

R2 v1 2026-06-22T18:23:00.890Z