Skip to main content

Monte Carlo Methods

  • Chapter
  • First Online:
  • 1807 Accesses

Part of the book series: UNITEXT for Physics ((UNITEXTPH))

Abstract

The Monte Carlo Method is a very useful and versatile numerical technique that allows to solve a large variety of problems difficult to tackle by other procedures. Even though the central idea is to simulate experiments on a computer and make inferences from the “observed” sample, it is applicable to problems that do not have an explicit random nature; it is enough if they have an adequate probabilistic approach. In fact, a frequent use of Monte Carlo techniques is the evaluation of definite integrals that at first sight have no statistical nature but can be interpreted as expected values under some distribution. In this lecture we shall present and justify essentially all the procedures that are commonly used in particle physics and statistics leaving aside subjects like Markov Chains that deserve a whole lecture by themselves and for which only the relevant properties will be stated without demonstration.

Anyone who considers arithmetical methods of producing random digits is, of course, in a state of sin

J. Von Neumann

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   89.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

Learn about institutional subscriptions

Notes

  1. 1.

    See [3, 4] for a detailed review on random and quasi-random number generators.

  2. 2.

    For the examples in this lecture I have used RANMAR [5] that can be found, for instance, at the CERN Computing Library.

  3. 3.

    Remember that if \(\mathrm{supp}(X)=\Omega {\subseteq }\mathcal{R}\), it is assumed that the density is \(p(x){{\varvec{1}}_{\Omega }(x)}\).

References

  1. F. James, Monte Carlo theory and practice. Rep. Prog. Phys. 43, 1145–1189 (1980)

    Article  ADS  Google Scholar 

  2. D.E. Knuth, The Art of Computer Programming, vol. 2 (Addison-Wesley, Menlo Park, 1981)

    MATH  Google Scholar 

  3. F. James, J. Hoogland, R. Kleiss, Comput. Phys. Commun. 2–3, 180–220 (1999)

    Google Scholar 

  4. P. L’Ecuyer, Handbook of Simulations, Chap. 4 (Wiley, New York, 1998)

    Google Scholar 

  5. G. Marsaglia, A. Zaman, Toward a Universal Random Number Generator, Florida State University Report FSU-SCRI-87-50 (1987)

    Google Scholar 

  6. D.B. Rubin, Ann. Stat. 9, 130–134 (1981)

    Article  ADS  Google Scholar 

  7. G.E.P. Box, M.E. Müller, A note on the generation of random normal deviates. Ann. Math. Stat. 29(2), 610–611 (1958)

    Article  MATH  Google Scholar 

  8. W.K. Hastings, Biometrika 57, 97–109 (1970)

    Article  MathSciNet  Google Scholar 

  9. N. Metropolis, A.W. Rosenbluth, M.W. Rosenbluth, A.H. Teller, E. Teller, J. Chem. Phys. 21, 1087–1092 (1953)

    Article  ADS  Google Scholar 

  10. A.B. Gelman, J.S. Carlin, H.S. Stern, D.B. Rubin, Bayesian Data Analysis (Chapman & Hall, London, 1995)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Carlos Maña .

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this chapter

Cite this chapter

Maña, C. (2017). Monte Carlo Methods. In: Probability and Statistics for Particle Physics. UNITEXT for Physics. Springer, Cham. https://doi.org/10.1007/978-3-319-55738-0_3

Download citation

Publish with us

Policies and ethics