Skip to main content icon/video/no-internet

The probability of an obverse surfacing was estimated by George Louis Leclerc, Comte de Buffon (1707–1788), by flipping a coin 4,040 times. He obtained 2,048 heads, which produced an estimate of None. As part of a genetics experiment, Walter Frank Raphael Weldon (1860–1906) tossed 12 dice at the same time, recorded the results, and repeated the process 26,306 times. (Due to the tediousness and error-prone method of physically counting the results, Karl Pearson (1857–1936) supported the veracity of the outcome with the χ2 test.) William Sealy Gosset used repeated sampling with slips of stiff paper to find the distribution of the correlation coefficient and to support the development of the t distribution.

These experiments are examples of the Monte Carlo method. It is a resampling approximation technique. The name is derived from the casinos of the principality of Monte Carlo.

The utility and accuracy of the Monte Carlo method was greatly enhanced with the advent of the computer and software. Stanislaw Marcin Ulam (1909–1984) wrote a Monte Carlo computer simulation of the solitaire card game in 1946. In a more important application, along with his boss John (János) von Neumann (1903–1957) and Enrico Fermi (1901–1954), Ulam estimated the eigenvalues for the Schrödinger equation (Erwin Schrödinger, 1887–1961) using Monte Carlo methods. Subsequently, he developed a Monte Carlo computer simulation of random neutron diffusion in fissile material to construct dampers and shields for the atomic bomb as part of the Manhattan Project.

Pseudo Random Number Generators

Initially, the basis of the Monte Carlo method was the use of uniform pseudo random numbers on the interval [0,1]. Today, Monte Carlo methods (plural) apply to the use of any pseudo random number generator, such as variates obtained from the exponential distribution, or repeated sampling from large, real data sets.

Programming Environment

Since its commercial release by the IBM Corporation in 1957, FORTRAN (FORmula TRANslator) remains the fastest high-level programming language for Monte Carlo simulation work. This is because execution time is an essential component for realistic, applied problems. Higher level programming environments, such as SAS IML, S+, and Lucent Technology's R (which is available at no cost from http://www.rproject.org/), are serviceable for simple Monte Carlo simulations and classroom demonstrations.

Simulating Tossing a Die

A Monte Carlo computer solution easily simulates the tossing of a fair die with a variate drawn from a uniform [0,1] pseudo random number generator and a table of assigned outcomes, such as indicated in Table 1. For example, if the value obtained from the generator is .1770, it simulates the throwing of a fair die and obtaining two spots. Counting the results of repeating this simulation is tremendously faster and more accurate than physically tossing a die.

Table 1 Simulation of a Fair Die Using Uniform Variates on the Interval [0,1]
Outcome Assignment
.0000 − .16661 spot
.1667 − .33332 spots
.3334 − .50003 spots
.5001 − .66664 spots
.6667 − .83335 spots
.8334 − 1.0006 spots
Source: Sawilowsky (2003, p. 219).

Estimating the Area of a Regular Figure

Consider the area (A) of a well-defined geometric shape, such as that in the shaded area depicted in Figure 1. The area of interest is bounded by the two equations f(x) = x and g(x) = x2 over the interval (0, 1).

...

  • Loading...
locked icon

Sign in to access this content

Get a 30 day FREE TRIAL

  • Watch videos from a variety of sources bringing classroom topics to life
  • Read modern, diverse business cases
  • Explore hundreds of books and reference titles

Sage Recommends

We found other relevant content for you on other Sage platforms.

Loading