Monte Carlo pp 1-12

# Introduction

• George S. Fishman
Chapter
Part of the Springer Series in Operations Research book series (ORFE)

## Abstract

The Monte Carlo method provides approximate solutions to a variety of mathematical problems by performing statistical sampling experiments on a computer. Remarkably, the method applies to problems with absolutely no probabilistic content as well as to those with inherent probabilistic structure. This alone does not give the Monte Carlo method an advantage over other methods of approximation. However, among all numerical methods that rely on n-point evaluations in m-dimensional space to produce an approximate solution, the Monte Carlo method has absolute error of estimate that decreases as n −l/2 whereas, in the absence of exploitable special structure, all others have errors that decrease as n −l/m at best. This property gives the Monte Carlo method a considerable edge in computational efficiency as m, the size of the problem, increases. Combinatorial settings illustrate this property especially well. Whereas the exact solution to a combinatorial problem with m elements often has computational cost that increases exponentially or superexponentially with m, the Monte Carlo method. frequently provides an estimated solution with tolerable error at a cost that increases no faster than as a polynomial in m.

## Keywords

Monte Carlo Method Pseudorandom Number Generator File Transfer Protocol Infinitesimal Perturbation Analysis Markov Chain Sampling
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

## References

1. Broder, A.Z. (1986). How hard is it to marry at random? (on the approximation of the permanent), Proc. Eighteenth ACM Symposium on Theory of Computing, 50–58. Erratum in Proc. Twentieth ACM Symposium on Theory of Computing, 1988, p. 551.Google Scholar
2. Courant, R., K. Friedrichs, and H. Lewy (1928). Uber die Partiellen Differenzengleichungen der Matematischen Physik, Math. Annalen, 100, 32–74; translated into English by P. Fox (1956) NYO-7689, ABC Computing Facility, Institute of Mathematical Sciences, New York University.Google Scholar
3. Dyer, M., A. Frieze, and R. Kannan (1989). A random polynomial time algorithm for approximating the volume of convex bodies, Proc. Twenty-First ACM Symposium on Theory of Computing, 375–381; also in Research Report 88–40, Department of Mathematics, Carnegie-Mellon University, Pittsburgh, PA.Google Scholar
4. Feller, W. (1968). An Introduction to Probability Theory and Its Applications, vol. 1, third ed., John Wiley, New York.Google Scholar
5. Jerrum, M., and A. Sinclair (1988). Conductance and the rapid mixing property for Markov chains: The approximation of the permanent resolved, Proc. Twentieth ACM Symposium on Theory of Computing, 235–244.Google Scholar
6. Karp, R.M. (1985). Monte-Carlo algorithms for the planar multiterminal network reliability problem, J. Complexity, 1, 45–64.
7. Kolmogorov, A. (1931). Uber die Analytischen Methoden in der Wahrscheinlichkeitsrechnung, Math. Annalen, 104, 415–458.
8. National Bureau of Standards (1951). Monte Carlo Method, A.S. Housholder ed., Applied Mathematics Series 12.Google Scholar
9. Park, S.K., and K.W. Miller (1988). Random number generators: Good ones are hard to find, Comm. ACM, 31, 1192–1201.
10. Petrowsky, I. (1933). Über das Irrfahrtproblem, Math. Annalen, 109, 425–444.
11. Rayleigh, Lord J.W.S. (1899). On James Bernoulli’s theorem in probabilities, Phil. Mag., 47, 246–251.Google Scholar