# Computer Generation of Poisson Deviates from Modified Normal Distributions

```@article{Ahrens1982ComputerGO,
title={Computer Generation of Poisson Deviates from Modified Normal Distributions},
author={J. H. Ahrens and Ulrich Dieter},
journal={ACM Trans. Math. Softw.},
year={1982},
volume={8},
pages={163-179}
}```
• Published 1982
• Mathematics, Computer Science
• ACM Trans. Math. Softw.
of Poisson Deviates Distributions Samples from Poisson distributions of mean # _> 10 are generated by truncating suitable normal deviates and applying a correction with low probabdity. For p < 10, inversion is substituted. The method is accurate and it can cope with changing parameters p. Using efficient subprograms for generating uniform, exponential, alid normal deviates, the new algorithm is much faster than all competing methods.
104 Citations
The Transformed Rejection Method for Generating Poisson Random Variables
The transformed rejection method, a combination of the inversion and the rejection method, which is used to generate non-uniform random numbers from a variety of continuous distributions can beExpand
The transformed rejection method for generating Poisson random variables
The transformed rejection method, a combination of the inversion and the rejection method, which is used to generate non-uniform random numbers from a variety of continuous distributions can beExpand
New Generators of Normal and Poisson Deviates Based on the Transformed Rejection Method
The transformed rejection method uses inversion to sample from the dominating density of a rejection algorithm. But in contrast to the usual method it is enough to know the inverse distributionExpand
The ratio of uniforms approach for generating discrete random variates
Abstract The most efficient algorithms for sampling from classical discrete distributions are based upon the acceptance/rejection principle. They are complicated and not easy to understand. ByExpand
Efficient table-free sampling methods for the exponential, Cauchy, and normal distributions
• Mathematics, Computer Science
• CACM
• 1988
Three algorithms for sampling from exponential, Cauchy and normal distributions are developed. They are based on the "exact approximation" method, and their expected numbers of consumed uniformExpand
Ratio of uniforms as a convenient method for sampling from classical discrete distributions
Many computer methods for generating variates from classical discrete distributions are available; some of them are simple and others are very fast. However, simple or convenient procedures are slowExpand
Random variate generators for the Poisson-Poisson and related distributions
Abstract Random variate generators are developed for the Poisson–Poisson (or generalized Poisson) distribution. The expected time per generated random variate is uniformly bounded over the parameterExpand
Sampling from Discrete and Continuous Distributions with C-Rand
• Mathematics
• 1992
C-RAND is a system of Turbo-C routines and functions intended for use on microcomputers. It contains up-to-date random number generators for more than thirty univariate distributions. For someExpand
Fast Generation of Discrete Random Variables
• Mathematics
• 2004
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 fiveExpand
An Elegant Method for Generating Multivariate Poisson Random Variables
• Mathematics
• 2007
Summary. Generating multivariate Poisson data is essential in many applications. Current simulation methods suffer from limitations ranging from computational complexity to restrictions on theExpand