Monte Carlo Methods

Monte Carlo methods are a broad class of computational algorithms that rely on repeated random sampling to obtain numerical results. Named after the casino district in Monaco, these methods transform deterministic problems — integration, optimization, simulation — into probabilistic ones that can be approximated by generating random numbers and averaging outcomes. The foundational insight, formalized by Stanislaw Ulam and John von Neumann at Los Alamos in the 1940s, is that randomness can be a computational resource.

In finance, Monte Carlo methods are the engine behind VaR calculations that simulate thousands of possible price paths for a portfolio. In physics, they drive simulations of particle transport and statistical mechanics. In machine learning, they power MCMC sampling for Bayesian inference. The method's power scales with computing capacity: what required rooms of analog computers in the 1940s runs on a laptop today.

Yet Monte Carlo carries an epistemic trap. It produces numbers with the precision of a stopped clock — always producing an answer, regardless of whether the model being simulated captures the phenomenon it purports to represent. A Monte Carlo simulation of a bad model is not insight. It is a random number generator wearing a lab coat.