The minimum perfect matching in pseudo-dimension 0 < q < 1

DOI10.1017/S0963548320000425zbMath1466.05184arXiv1403.3635OpenAlexW3095267822MaRDI QIDQ4993130

Joel Larsson

Publication date: 15 June 2021

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.3635

zbMATH Keywords

Mézard-Parisi conjecture

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Replica symmetry of the minimum matching
• Random assignment problems
• Asymptotics in the random assignment problem
• A proof of Parisi's conjecture on the random assignment problem
• The ?(2) limit in the random assignment problem
• On the Expected Value of a Random Assignment Problem
• Belief Propagation: An Asymptotically Optimal Algorithm for the Random Assignment Problem
• A proof of a conjecture of Buck, Chan, and Robbins on the expected value of the minimum assignment
• Proofs of the Parisi and Coppersmith‐Sorkin random assignment conjectures

This page was built for publication: The minimum perfect matching in pseudo-dimension 0 < q < 1