Jump to content

Non-uniform random variate generation

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Marie Poise (talk | contribs) at 12:36, 6 May 2011 ('''Pseudo-random number sampling''' is the numerical practice of generating pseudo-random numbers that are distributed according to a given probability distribution.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Pseudo-random number sampling is the numerical practice of generating pseudo-random numbers that are distributed according to a given probability distribution.

In the following, it is taken for granted that there is a pseudo-random number generator producing numbers X that are uniformly distributed. Different algorithms are then used to transform X into a random variable U(X) that is distributed according to a given distribution f(C).

Historically, basic methods of pseudo-random number sampling were developed for Monte-Carlo simulations in the Manhattan project; they were first published by John von Neumann in the early 1950s.

Literature

  • Fishman,GS: Monte Carlo. Concepts, Algorithms, and Applications. New York: Springer (1996).
  • Knuth,DE: The Art of Computer Programming, Vol. 2 Seminumerical Algorithms, Chapter 3.4.1 (3rd edition, 1997).