Skip to main content
SpringerLink
Log in

Random Optimization Problems and Statistical Mechanics

  • Chapter
  • First Online:
The Euclidean Matching Problem

Part of the book series: Springer Theses ((Springer Theses))

  • 517 Accesses

Abstract

In the previous chapter we discussed optimization problems defined on graphs, and in particular matching problems. For each of these problems we supposed that the parameters of the problem (e.g., the weight matrix for the considered graph) were given once and for all. For a given instance of an optimization problem, the solution can be found running specific algorithms available in the literature.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    The tree is therefore an infinite N-Cayley tree.

References

  1. D.J. Aldous, The \(\zeta (2)\) limit in the random assignment problem. Random Struct. Algorithms 2, 381–418 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  2. J.R. de Almeida, D.J. Thouless, Stability of the Sherrington-Kirkpatrick solution of a spin glass model. J. Phys. A: Math. Gen. 11(5), 983 (1978)

    Google Scholar 

  3. V. Bapst et al., The quantum adiabatic algorithm applied to random optimization problems: The quantum spin glass perspective. Phys. Rep. 523(3), 127–205 (2013)

    Article  ADS  MathSciNet  Google Scholar 

  4. R.J. Baxter, Exactly solved models in statistical mechanics. Courier Corporation (2007)

    Google Scholar 

  5. T. Castellani, A. Cavagna, Spin-glass theory for pedestrians. J. Stat. Mech.: Theory Exp. P05012 (2005)

    Google Scholar 

  6. P. Cheeseman, B. Kanefsky, W.M. Taylor. Where the Really Hard Problems Are, in IJCAI, vol. 91, pp. 331–340 (1991)

    Google Scholar 

  7. D. Coppersmith, G.B. Sorkin, Constructive bounds and exact expectations for the random assignment problem. Random Struct. Algorithms 15(2), 113–144 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  8. D. Fichera. Cavity methods in optimization problems: exact and approximated algorithms. Ph.D. thesis. Università di Milano (2008)

    Google Scholar 

  9. C. Grosso, Cavity method analysis for random assignment problems. Master thesis. Universitá di Milano (2004)

    Google Scholar 

  10. H.A. Kramers, G.H. Wannier, Statistics of the two-dimensional ferromagnet. Part I. Phys. Rev. 60 (1941)

    Google Scholar 

  11. S. Linusson, J. Wästlund, A proof of Parisi’s conjecture on the random assignment problem. Probab. Theory Relat. Fields 128(3), 419–440 (2004)

    Article  MATH  Google Scholar 

  12. M. Mézard, G. Parisi, M. Virasoro, Spin Glass Theory and Beyond, Lecture Notes in Physics Series, World Scientific Publishing Company, Incorporated (1987)

    Google Scholar 

  13. M. Mézard, A. Montanari, Information, Physics, and Computation (Oxford Graduate Texts, OUP Oxford, 2009)

    Book  MATH  Google Scholar 

  14. M. Mézard, G. Parisi, On the solution of the random link matching problems. Journal de Physique 48(9), 1451–1459 (1987)

    Article  Google Scholar 

  15. M. Mézard, G. Parisi, Replicas and optimization. Journal de Physique Lettres 46(17), 771–778 (1985)

    Article  Google Scholar 

  16. M. Mézard, G. Parisi, The Bethe lattice spin glass revisited. Eur. Phys. J. B 20(2), 217–233 (2001)

    Article  ADS  MathSciNet  Google Scholar 

  17. M. Mézard, G. Parisi, The cavity method at zero temperature. J. Stat. Phys. 111(1/2), 1–24 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  18. D. Mitchell, B. Selman, H. Levesque, Hard and easy distributions of SAT problems, in AAAI, vol. 92, pp. 459–465 (1992)

    Google Scholar 

  19. G. Mussardo, Statistical Field Theory (Oxford University Press, Oxford, 2010)

    MATH  Google Scholar 

  20. C. Nair, B. Prabhakar, M. Sharma, Proofs of the Parisi and Coppersmith-Sorkin random assignment conjectures. Random Struct. Algorithms 27(4), 413–444 (2005). Dec

    Article  MathSciNet  MATH  Google Scholar 

  21. H. Nishimori, Statistical Physics of Spin Glasses and Information Processing. An Introduction (Clarendon Press, Oxford, 2001)

    Book  MATH  Google Scholar 

  22. G. Parisi, A conjecture on random bipartite matching (1998). arXiv:cond-mat.9801176

  23. G. Parisi, Order parameter for spin-glasses. Phys. Rev. Lett. 50(24), 1946–1948 (1983)

    Article  ADS  MathSciNet  Google Scholar 

  24. G. Parisi, M. Ratiéville, On the finite size corrections to some random matching problems. Eur. Phys. J. B 29(3), 457–468 (2002). Oct

    Article  ADS  Google Scholar 

  25. L. Zdeborová, Statistical Physics of Hard Optimization Problems, Published on Acta Physica Slovaca 59(3), p. 169-303, 2009. Ph.D. thesis. Université Paris-Sud 11 and Univerzita Karlova v Praze (2008)

    Google Scholar 

  26. J. Zinn-Justin, Quantum Field Theory and Critical Phenomena, The International Series of Monographs on Physics Series (Clarendon Press, Oxford, 2002)

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centro Brasileiro de Pesquisas Físicas, Rio de Janeiro, Brazil

    Gabriele Sicuro

Authors
  1. Gabriele Sicuro
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gabriele Sicuro .

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this chapter

Cite this chapter

Sicuro, G. (2017). Random Optimization Problems and Statistical Mechanics. In: The Euclidean Matching Problem. Springer Theses. Springer, Cham. https://doi.org/10.1007/978-3-319-46577-7_3

Download citation

Publish with us

Policies and ethics

Search

Navigation