The minimum perfect matching in pseudo-dimension 0

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

It is known that for Kn, n equipped with i.i.d. exp (1) edge costs, the minimum total cost of a perfect matching converges to ζ (2)=π2/6 in probability. Similar convergence has been established for all edge cost distributions of pseudo-dimension q≥ 1. In this paper we extend those results to all real positive q, confirming the Mézard-Parisi conjecture in the last remaining applicable case.

Cite

CITATION STYLE

APA

Larsson, J. (2021). The minimum perfect matching in pseudo-dimension 0. Combinatorics Probability and Computing, 30(3), 374–397. https://doi.org/10.1017/S0963548320000425

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free