Electronic Communications in Probability

The Mézard-Parisi equation for matchings in pseudo-dimension $d>1$

Justin Salez

Full-text: Open access

Abstract

We establish existence and uniqueness of the solution to the cavity equation for the random assignment problem in pseudo-dimension $d>1$, as conjectured by Aldous and Bandyopadhyay (Annals of Applied Probability, 2005) and Wästlund (Annals of Mathematics, 2012). This fills the last remaining gap in the proof of the original Mézard-Parisi prediction for this problem (Journal de Physique Lettres, 1985).

Article information

Source
Electron. Commun. Probab., Volume 20 (2015), paper no. 13, 7 pp.

Dates
Accepted: 14 February 2015
First available in Project Euclid: 7 June 2016

Permanent link to this document
https://projecteuclid.org/euclid.ecp/1465320940

Digital Object Identifier
doi:10.1214/ECP.v20-3791

Mathematical Reviews number (MathSciNet)
MR3314648

Zentralblatt MATH identifier
1353.60011

Subjects
Primary: 60C05: Combinatorial probability
Secondary: 82B44: Disordered systems (random Ising models, random Schrödinger operators, etc.) 90C35: Programming involving graphs or networks [See also 90C27]

Keywords
Recursive distributional equation Random assignment problem Cavity method

Rights
This work is licensed under a Creative Commons Attribution 3.0 License.

Citation

Salez, Justin. The Mézard-Parisi equation for matchings in pseudo-dimension $d>1$. Electron. Commun. Probab. 20 (2015), paper no. 13, 7 pp. doi:10.1214/ECP.v20-3791. https://projecteuclid.org/euclid.ecp/1465320940


Export citation

References

  • Aldous, David. Asymptotics in the random assignment problem. Probab. Theory Related Fields 93 (1992), no. 4, 507–534.
  • Aldous, David J. The $\zeta(2)$ limit in the random assignment problem. Random Structures Algorithms 18 (2001), no. 4, 381–418.
  • Aldous, David J.; Bandyopadhyay, Antar. A survey of max-type recursive distributional equations. Ann. Appl. Probab. 15 (2005), no. 2, 1047–1110.
  • Aldous, David; Steele, J. Michael. The objective method: probabilistic combinatorial optimization and local weak convergence. Probability on discrete structures, 1–72, Encyclopaedia Math. Sci., 110, Springer, Berlin, 2004.
  • Gamarnik, David; Nowicki, Tomasz; Swirszcz, Grzegorz. Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method. Random Structures Algorithms 28 (2006), no. 1, 76–106.
  • Mustafa Khandwawala, phSolutions to recursive distributional equations for the mean-field TSP and related problems. ARXIV1405.1316
  • A. N. Kolmogorov and S. V. Fomin, Introductory real analysis, Dover Publications, Inc., New York, 1975, Translated from the second Russian edition and edited by Richard A. Silverman, Corrected reprinting.
  • Joel Larsson, The Minimum Perfect Matching in Pseudo-dimension 0<q<1. ARXIV1403.3635
  • Linusson, Svante; Wästlund, Johan. A proof of Parisi's conjecture on the random assignment problem. Probab. Theory Related Fields 128 (2004), no. 3, 419–440.
  • Marc Mézard and Giorgio Parisi, Replicas and optimization, J. Physique Lett. 46 (1985), no. 17, 771–778.
  • Marc Mézard and Giorgio Parisi, Mean-field equations for the matching and the travelling salesman problems, EPL (Europhysics Letters) 2 (1986), no. 12, 913.
  • Marc Mézard and Giorgio Parisi, On the solution of the random link matching problems, J. Phys. France 48 (1987), no. 9, 1451–1459.
  • Nair, Chandra; Prabhakar, Balaji; Sharma, Mayank. Proofs of the Parisi and Coppersmith-Sorkin random assignment conjectures. Random Structures Algorithms 27 (2005), no. 4, 413–444.
  • Giorgio Parisi and Johan Wästlund, Mean field matching and traveling salesman problems in pseudo-dimension 1, (2012).
  • Wästlund, Johan. An easy proof of the $\zeta(2)$ limit in the random assignment problem. Electron. Commun. Probab. 14 (2009), 261–269.
  • Wästlund, Johan. Replica symmetry of the minimum matching. Ann. of Math. (2) 175 (2012), no. 3, 1061–1091.