The Minimum Perfect Matching in Pseudo-dimension $0<q<1$
Combinatorics
2019-06-13 v3 Probability
Abstract
It is known that for equipped with i.i.d. edge costs, the minimum total cost of a perfect matching converges to in probability. Similar convergence has been established for all edge cost distributions of pseudo-dimension , such as Wei(1,q) costs. In this paper we extend those results all , confirming the M\'ezard-Parisi conjecture in the last remaining applicable case.
Cite
@article{arxiv.1403.3635,
title = {The Minimum Perfect Matching in Pseudo-dimension $0<q<1$},
author = {Joel Larsson},
journal= {arXiv preprint arXiv:1403.3635},
year = {2019}
}
Comments
Revised journal version, to appear in 'Combinatorics, Probability and Computing'