Is Monte Carlo simulation always accurate?

No. Its results are probabilistic approximations whose error depends on sample size, random-number quality and model assumptions, which is why they are usually reported with confidence intervals or standard errors.

How does the Monte Carlo method differ from MCMC?

Plain Monte Carlo draws independent samples directly, while MCMC uses a Markov chain to generate a sequence of dependent samples from distributions that are hard to sample directly.

Monte Carlo Method

➗ Mathematics & Statistics By CampusDown Wiki Editorial Team Last updated October 26, 2026

The Monte Carlo method is a family of computational techniques that use random numbers to generate many random samples and approximate quantities such as integrals, probabilities and expected values from their averages or proportions.

Contents

1. Origins and basic principle
2. Accuracy and variance reduction
3. Applications
4. FAQ
5. References

Origins and basic principle

The Monte Carlo method began in 1946 when Stanisław Ulam, a mathematician at Los Alamos recovering from illness, tried to work out the odds of winning a game of solitaire. If the calculation was intractable, he reasoned, one could simply play many times and count the successes. John von Neumann applied the idea to neutron diffusion, and Nicholas Metropolis named it after the casino Ulam's uncle frequented. Metropolis and Ulam (1949) published the first paper. The classic illustration estimates π: scatter points at random in a unit square, and four times the fraction landing inside the quarter circle approaches π. The average converges to the true value as samples grow, thanks to the law of large numbers.

Accuracy and variance reduction

By the central limit theorem, Monte Carlo error shrinks roughly in proportion to one over the square root of the number of samples. Ten times more accuracy requires a hundred times more samples, but this rate is nearly independent of dimension, so Monte Carlo beats grid-based numerical methods for high-dimensional integrals. Variance-reduction techniques such as importance sampling, control variates, stratified sampling (the same principle as stratified probability sampling in surveys) and quasi-Monte Carlo improve efficiency. Quality also depends on the pseudo-random number generator; Matsumoto and Nishimura's (1998) Mersenne Twister is widely used. Hammersley and Handscomb (1964), Robert and Casella (2004) and Owen (2013) are standard texts.

Applications

The algorithm of Metropolis et al. (1953) and Hastings's (1970) generalization grew into MCMC, which uses Markov chains to sample from complex distributions, and after Gelfand and Smith (1990) it became the standard computational tool of Bayesian statistics. Efron's (1979) bootstrap, which resamples data to assess the uncertainty of estimates, is also a Monte Carlo approach. In finance, Boyle (1977) introduced Monte Carlo to option pricing, and it is used in scenario analysis for risk management. Physics uses it for particle transport and statistical mechanics, and computer graphics for path-traced rendering. In AI, Monte Carlo tree search, rooted in Kocsis and Szepesvári's (2006) UCT algorithm, was central to the AlphaGo system of Silver et al. (2016), an important branch of AI search algorithms.

FAQ

Is Monte Carlo simulation always accurate?: No. Its results are probabilistic approximations whose error depends on sample size, random-number quality and model assumptions, which is why they are usually reported with confidence intervals or standard errors.
How does the Monte Carlo method differ from MCMC?: Plain Monte Carlo draws independent samples directly, while MCMC uses a Markov chain to generate a sequence of dependent samples from distributions that are hard to sample directly.

Sources reviewed: 2026-10-26

References

Metropolis, N., & Ulam, S. (1949). The Monte Carlo method. Journal of the American Statistical Association, 44(247), 335–341.
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953). Equation of state calculations by fast computing machines. Journal of Chemical Physics, 21(6), 1087–1092.
Hastings, W. K. (1970). Monte Carlo sampling methods using Markov chains and their applications. Biometrika, 57(1), 97–109.
Eckhardt, R. (1987). Stan Ulam, John von Neumann, and the Monte Carlo method. Los Alamos Science, 15, 131–137.
Hammersley, J. M., & Handscomb, D. C. (1964). Monte Carlo Methods. London: Methuen.
Boyle, P. P. (1977). Options: A Monte Carlo approach. Journal of Financial Economics, 4(3), 323–338.
Efron, B. (1979). Bootstrap methods: Another look at the jackknife. Annals of Statistics, 7(1), 1–26.
Gelfand, A. E., & Smith, A. F. M. (1990). Sampling-based approaches to calculating marginal densities. Journal of the American Statistical Association, 85(410), 398–409.
Kocsis, L., & Szepesvári, C. (2006). Bandit based Monte-Carlo planning. In Machine Learning: ECML 2006 (pp. 282–293). Berlin: Springer.
Silver, D., et al. (2016). Mastering the game of Go with deep neural networks and tree search. Nature, 529(7587), 484–489.
Robert, C. P., & Casella, G. (2004). Monte Carlo Statistical Methods (2nd ed.). New York: Springer.
Owen, A. B. (2013). Monte Carlo Theory, Methods and Examples. Stanford, CA: Stanford University.
Matsumoto, M., & Nishimura, T. (1998). Mersenne twister: A 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Transactions on Modeling and Computer Simulation, 8(1), 3–30.

Reports and materials that use this theory (Korean)

There are no materials dedicated to this theory yet, but you can search related reports in the CampusDown library (Korean).

Find more reports · Search '몬테카를로 방법' on CampusDown →

Markov ChainWhat a Markov chain is, the Markov property, transition probabilities and matrices, stationary distributions and convergence, Markov's analysis of Eugene Onegin, and applications in hidden Markov models, PageRank, MCMC and Markov decision processes.➗ Mathematics & Statistics Central limit theoremThe central limit theorem says sample means approach a normal distribution as samples grow, whatever the original distribution. A dice example, the standard error σ/√n, the n ≥ 30 rule of thumb and its limits, and uses in polling and quality control.➗ Mathematics & Statistics Bayes' TheoremWhat Bayes' theorem says, the formula P(A|B)=P(B|A)P(A)/P(B), priors, likelihoods, and posteriors, the classic medical-test example showing why a positive result may still mean you're probably healthy, and uses in spam filters and ML.➗ Mathematics & Statistics Normal DistributionWhat the normal distribution is, the shape of the bell curve, the roles of mean and standard deviation, the 68-95-99.7 rule, converting to z-scores and reading cumulative probabilities, the central limit theorem, and real-world examples.➗ Mathematics & Statistics AI Search Algorithms: A* and MinimaxAI search algorithms explained: state-space search, breadth-first and depth-first search, Dijkstra, heuristics and A* (admissibility, consistency), game trees, minimax and alpha-beta pruning, based on the original papers.⚙️ Engineering & Technology P-valueWhat a p-value actually measures, where the 0.05 cutoff came from, why it isn't the probability a hypothesis is true, the 2016 American Statistical Association statement, and the problem of p-hacking.➗ Mathematics & Statistics

Latest ArticlesView all ›

New guides for college study and assignments (Korean)

This article was last updated on October 26, 2026. It is based on widely recognized original works and textbooks; when citing it in a paper, please check the original sources listed in the references.