Fast Generation of Discrete Random Variables
We describe two methods and provide C programs for generating discrete random variables with functions that are simple and fast, averaging ten times as fast as published methods and more than five times as fast as the fastest of those. We provide general procedures for implementing the two methods, as well as specific procedures for three of the most important discrete distributions: Poisson, binomial and hypergeometric.
Year of publication: |
2004-07-12
|
---|---|
Authors: | Marsaglia, George ; Tsang, Wai Wan ; Wang, Jingbo |
Published in: |
Journal of Statistical Software. - American Statistical Association. - Vol. 11.2004, i03
|
Publisher: |
American Statistical Association |
Saved in:
Saved in favorites
Similar items by person
-
Evaluating Kolmogorov's Distribution
Marsaglia, George, (2003)
-
Some Difficult-to-pass Tests of Randomness
Marsaglia, George, (2002)
-
The Monty Python Method for Generating Gamma Variables
Marsaglia, George, (1999)
- More ...