Random matching problems on the complete graph

Electronic Communications in Probability

Volumn 13, Issue , 2008, Pages 258-265

  Wästlund, Johan ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

Expectation; Exponential; Mean field; Minimum matching; Network

Indexed keywords

EID: 44349167112     PISSN: None     EISSN: 1083589X     Source Type: Journal    
DOI: 10.1214/ECP.v13-1372     Document Type: Article

References (9)

1. Aldous, David, Asymptotics in the random assignment problem, Probab. Theory Relat. Fields 93 (1992), 507-534.
2. Aldous, David, The ζ(2) limit in the random assignment problem, Random Structures & Algorithms 18 no. 4 (2001), 381-418.
3. Coppersmith, Don and Sorkin, Gregory B., Constructive Bounds and Exact Expectations For the Random Assignment Problem, Random Structures & Algorithms 15 (1999), 133-144.
4. Linusson, Svante and Wästlund, Johan, A proof of Parisi’s conjecture on the random assignment problem, Probab. Theory Relat. Fields 128 (2004), 419-440.
5. Mezard, Marc and Parisi, Giorgio, Replicas and optimization, Journal de Physique Lettres 46 (1985), 771-778.
6. Mézard, Marc and Parisi, Giorgio, On the solution of the random link matching problems, Journal de Physique Lettres 48 (1987), 1451-1459.
7. Nair, Chandra, Prabhakar, Balaji and Sharma, Mayank, Proofs of the Parisi and Coppersmith-Sorkin random assignment conjectures, Random Structures & Algorithms 27 No. 4 (2005), 413-444.
8. Parisi, Giorgio, A conjecture on random bipartite matching, arXiv:cond-mat/9801176 (1998).
9. Wästlund, Johan, An easy proof of the ζ(2) limit in the random assignment problem, manuscript available at the author’s webpage.