Introduction to Monte Carlo algorithms

  • Conference paper
  • First Online:
Advances in Computer Simulation

Part of the book series: Lecture Notes in Physics ((LNP,volume 501))

Abstract

These lectures that I gave in the summer of 1996 at the Beg-Rohu (France) and Budapest summer schools discuss the fundamental principles of thermodynamic and dynamic Monte Carlo methods in a simple and light-weight fashion. The key-words are Markov chains, sampling, detailed balance, a priori probabilities, rejections, ergodicity, “Faster than the clock algorithms”.

The emphasis is on orientation, which is difficult to obtain (all the mathematics being simple). A firm sense of orientation is essential, because it is easy to lose direction, especially when you venture to leave the well trodden paths established by common usage.

The discussion will remain quite basic (and I hope, readable), but I will make every effort to drive home the essential messages: the crystal-clearness of detailed balance, the main problem with Markov chains, the large extent of algorithmic freedom, both in thermodynamic and dynamic Monte Carlo, and the fundamental differences between the two problems.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Press, W. H., Teukolsky, S. A., Vetterling, W. T., Flannery, B. P., Numerical Recipes, 2nd edition, Cambridge University Press (1992).

    Google Scholar 

  2. Lee, J., Strandburg K. J., Phys. Rev. B 46 11190 (1992).

    ADS  Google Scholar 

  3. Pollock, E. L., Ceperley, D. M., Phys. Rev. B 30, 2555 (1984), B 36 8343 (1987)

    ADS  Google Scholar 

  4. Ceperley, D. M, Rev. Mod. Phys. 67, 1601 (1995).

    Article  Google Scholar 

  5. Caracciolo, S., Pelissetto, A., Sokal, A. D., Phys. Rev. Lett 72 179 (1994).

    Article  MATH  ADS  MathSciNet  Google Scholar 

  6. Swendsen, R. H., Wang, J.-S., Phys. Rev. Lett. 63, 86 (1987).

    Article  ADS  Google Scholar 

  7. Wolff, U., Phys. Rev. Lett. 62, 361 (1989).

    Article  ADS  Google Scholar 

  8. Ferdinand A. E., Fisher, M. E., Phys. Rev. 185 185 (1969).

    Article  Google Scholar 

  9. Shore, J. D., Holzer, M., Sethna, J. P., Phys Rev. B 46 11376 (1992).

    ADS  Google Scholar 

  10. Bortz, A. B., Kalos, M. H., Lebowitz, J. L., J. Comput. Phys. 17, 10 (1975)

    Article  ADS  Google Scholar 

  11. cf also: Binder, K., in Monte Carlo Methods in Statistical Physics, edited by K. Binder, 2nd ed. (Springer Verlag, Berlin, 1986, sect 1.3.1).

    Google Scholar 

  12. Novotny, A. M., Computers in Physics 9 46 (1995).

    Article  ADS  Google Scholar 

  13. Krauth, W., Pluchery, O., J. Phys. A: Math Gen 27, L715 (1994).

    Google Scholar 

  14. Krauth, W., Mézard, M., Z. Phys. B 97 127 (1995).

    Article  ADS  Google Scholar 

  15. Wang, J.-S., Int. J. Mod. Phys. C 5, 707 (1994).

    ADS  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

János Kertész Imre Kondor

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag

About this paper

Cite this paper

Krauth, W. (1998). Introduction to Monte Carlo algorithms. In: Kertész, J., Kondor, I. (eds) Advances in Computer Simulation. Lecture Notes in Physics, vol 501. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0105457

Download citation

  • DOI: https://doi.org/10.1007/BFb0105457

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63942-8

  • Online ISBN: 978-3-540-69675-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Navigation