Monte Carlo Method
The history of the Monte Carlo method begins in the unique context of the Manhattan Project during World War II. Researchers at Los Alamos were grappling with nuclear physics calculations of unprecedented complexity. The lack of suitable tools stimulated their mathematical imagination.
As early as the 1930s, Enrico Fermi, an Italian physicist who became a naturalized American citizen in 1945, experimented with statistical sampling techniques to solve his neutronics equations. These early attempts remained confidential, lacking computers capable of processing large volumes of calculations.
The true birth of Monte Carlo occurred in 1946. Stanislaw Ulam, a Polish mathematician, was recovering from an illness while playing solitaire. A question nagged at him: how to precisely calculate the odds of winning a game? He hit upon the idea of simulating a vast number of games to obtain a reliable statistical estimate. This brilliant insight met with the enthusiasm of John von Neumann, who programmed the first simulations on ENIAC in 1947. For these calculations, he created a powerful mathematical technique for generating pseudo-random numbers, called middle-square digits, to estimate numerical values and solve complex problems. The name “Monte Carlo” arose from a joke by Nicholas Metropolis, a playful reference to Ulam’s uncle, a compulsive gambler at the Monaco casino.
Between 1946 and 1947, during an extended ENIAC outage, Enrico Fermi designed FERMIAC, a remarkable mechanical device capable of simulating neutron diffusion according to the Monte Carlo principle. This invention testifies to the immediate enthusiasm of physicists for this radically new approach.
A conceptual leap occurred in 1953 with the algorithm devised by Metropolis and his team, including physicists Marshall and Augusta Mici Rosenbluth, as well as Edward Teller. Their method exploited Markov chains to generate samples following a given distribution and explore complex spaces. In 1970, Wilfred Keith Hastings enriched this approach, resulting in the Metropolis-Hastings algorithm, a current pillar of modern computational statistics.
The 1980s saw inspired variants flourish. The simulated annealing algorithm, designed by Kirkpatrick, Gelatt, and Vecchi in 1983, adapted Monte Carlo to combinatorial optimization by drawing inspiration from the controlled cooling of metals. A year later, the Geman brothers applied Gibbs sampling to image processing, opening new horizons in computer vision.
The early 1990s marked the triumph of Markov chain Monte Carlo methods thanks to the foundational work of Gelfand and Smith. These advances revolutionized Bayesian inference and transformed everyday statistical practice. This prolific decade also saw the emergence of Peter Green’s reversible jump algorithm in 1995, which enabled exploration of variable-dimension spaces, as well as the perfect sampling of Propp and Wilson in 1996, guaranteeing exactly distributed samples.
The evolution of Monte Carlo illustrates the fruitful dialogue between theory and technology. From the first calculators to today’s supercomputers, each leap in power has exponentially increased the potential of these methods. Their fields of application have diversified: statistical physics, molecular chemistry, quantitative finance, machine learning, and 3D graphics with Eric Veach’s Metropolis light transport in 1997.
Historical irony: this technique initially developed for nuclear weapons now serves modern medicine. Monte Carlo is used in radiotherapy to simulate with unparalleled precision the interactions between radiation and biological tissues. Its tremendous scientific impact earned it designation as one of the ten most influential algorithms of the 20th century by the Society for Industrial and Applied Mathematics.