Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
  1. Home
  2. Probability Theory and Related Fields
  3. Article
A proof of Parisi’s conjecture on the random assignment problem
Download PDF
Download PDF
  • Published: 26 November 2003

A proof of Parisi’s conjecture on the random assignment problem

  • Svante Linusson1 &
  • Johan Wästlund1 

Probability Theory and Related Fields volume 128, pages 419–440 (2004)Cite this article

  • 216 Accesses

  • 59 Citations

  • Metrics details

Abstract.

An assignment problem is the optimization problem of finding, in an m by n matrix of nonnegative real numbers, k entries, no two in the same row or column, such that their sum is minimal. Such an optimization problem is called a random assignment problem if the matrix entries are random variables. We give a formula for the expected value of the optimal k-assignment in a matrix where some of the entries are zero, and all other entries are independent exponentially distributed random variables with mean 1. Thereby we prove the formula 1+1/4+1/9+\...+1/k 2 conjectured by G. Parisi for the case k=m=n, and the generalized conjecture of D. Coppersmith and G. B. Sorkin for arbitrary k, m and n.

Download to read the full article text

Working on a manuscript?

Avoid the common mistakes

References

  1. Aldous, D.: Asymptotics in the random assignment problem. Pr. Th. Related Fields 93, 507–534 (1992)

    MathSciNet  MATH  Google Scholar 

  2. Aldous, D.: The ζ(2) limit in the random assignment problem. Random Structures Algorithms 18 (4), 381–418 (2001)

    Article  MATH  Google Scholar 

  3. Alm, S.E., Sorkin, G.B.: Exact expectations and distributions in the random assignment problem. Combin. Probab. Comput. 11 (3), 217–248 (2002)

    Article  MATH  Google Scholar 

  4. Beveridge, A., Frieze, A.M., McDarmid Colin J.H.: Random minimum length spanning trees in regular graphs. Combinatorica 18, 311–333 (1998)

    MathSciNet  MATH  Google Scholar 

  5. Buck, M.W., Chan, C.S., Robbins, D.P.: On the expected value of the minimum assignment. Random Structures Algorithms. 21 (1), 33–58 (2002)

    Article  MATH  Google Scholar 

  6. Coppersmith, D., Sorkin, G.B.: Constructive Bounds and Exact Expectations For the Random Assignment Problem. Random Structures Algorithms 15, 133–144 (1999)

    Google Scholar 

  7. Coppersmith, D., Sorkin, G.B.: On the expected incremental cost of a minimum assignment. In: Contemporary Mathematics, B. Bollobás, (ed.), Vol. 10 of Bolyai Society Mathematical Studies, Springer

  8. Eriksson, H., Eriksson, K., Sjöstrand, J.: Exact expectation for random graphs and assignments. Proceedings of FPSAC 2001, Arizona

  9. Frieze, A.M., McDarmid Colin, J.H.: On random minimum spanning trees, Combinatorica 9, 1989

  10. Frieze, A.M.: On the value of a random minimum spanning tree problem. Disc Appl. Math. 10, 47–56 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  11. Goemans, M.X., Kodialam, M.S.: A lower bound on the expected cost of an optimal assignment. Math. Oper. Res. 18, 267–274 (1993)

    MathSciNet  MATH  Google Scholar 

  12. Karp, R.M.: An upper bound on the expected cost of an optimal assignment. In Discrete Algorithms and Complexity: Proceedings of the Japan-U.S. Joint Seminar, Academic Press, 1987, pp. 1–4

  13. Lazarus, A.: Certain expected values in the random assignment problem. Oper. Res. Lett. 14, 207–214 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  14. Linusson, S., Wästlund, J.: A generalization of the random assignment problem. Unpublished manuscript. arXiv:math.CO/0006146

  15. Lovász, L., Plummer, M.D.: Matching Theory, North-Holland 1986

  16. Mézard, M., Parisi, G.: Replicas and optimization. J. Phys. Lett. 46, 771–778 (1985)

    Google Scholar 

  17. Mézard, M., Parisi, G.: On the solution of the random link matching problems. J. Phys. Lett. 48, 1451–1459 (1987)

    Google Scholar 

  18. Nair, C.: Towards the resolution of Coppersmith-Sorkin conjectures. Proceedings of the 40th annual Allerton conference on communication, control and computing, 2002

  19. Nair, C., Prabhakar, B., Sharma, M.: A proof of the conjecture due to Parisi for the finite random assignment problem, available at http://www.stanford.edu/∼balaji/ rap.html

  20. Chandra Nair, Balaji Prabhakar, Mayank Sharma, Proofs of the Parisi and Coppersmith-Sorkin Conjectures for the Fininte Random Assignment Problem, Proceedings of IEEE FOCS, 2003

  21. Olin, Birgitta, Asymptotic properties of the random assignment problem, Ph.D. thesis, Kungl Tekniska Högskolan, Stockholm, Sweden, 1992

  22. Pardalos, P.M., Ramakrishnan, K.G.: On the expected optimal value of random assignment problems: Experimental results and open questions. Comput. Optim. Appl. 2, 261–271 (1993)

    MATH  Google Scholar 

  23. Parisi, G.: A conjecture on random bipartite matching. Physics e-Print archive, http://xxx.lanl.gov/ps/cond-mat/9801176, January 1998

  24. Walkup, D.W.: On the expected value of a random assignment problem. SIAM J. Comput. 8, 440–442 (1979)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Linköpings universitet, 581 83, Linköping, Sweden

    Svante Linusson & Johan Wästlund

Authors
  1. Svante Linusson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Johan Wästlund
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Svante Linusson.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Linusson, S., Wästlund, J. A proof of Parisi’s conjecture on the random assignment problem. Probab. Theory Relat. Fields 128, 419–440 (2004). https://doi.org/10.1007/s00440-003-0308-9

Download citation

  • Received: 05 April 2003

  • Revised: 26 September 2003

  • Published: 26 November 2003

  • Issue Date: March 2004

  • DOI: https://doi.org/10.1007/s00440-003-0308-9

Share this article

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Keywords

  • Real Number
  • Assignment Problem
  • Random Assignment
  • Matrix Entry
  • Nonnegative Real Number
Download PDF

Working on a manuscript?

Avoid the common mistakes

Advertisement

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature