# 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} }

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

- 2007

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 be… Expand

The transformed rejection method for generating Poisson random variables

- Mathematics
- 1993

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 be… Expand

New Generators of Normal and Poisson Deviates Based on the Transformed Rejection Method

- Mathematics
- 1993

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 distribution… Expand

The ratio of uniforms approach for generating discrete random variates

- Mathematics
- 1990

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. By… Expand

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 uniform… Expand

Ratio of uniforms as a convenient method for sampling from classical discrete distributions

- Mathematics
- WSC '89
- 1989

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 slow… Expand

Random variate generators for the Poisson-Poisson and related distributions

- Mathematics
- 1989

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 parameter… Expand

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 some… Expand

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 five… Expand

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 the… Expand

#### References

SHOWING 1-10 OF 18 REFERENCES

Generating gamma variates by a modified rejection technique

- Mathematics, Computer Science
- CACM
- 1982

A modification of the rejection technique begins by sampling from the normal distribution, being able to accept and transform the initial normal observation quickly at least 85 percent of the time. Expand

Extensions of Forsythe’s method for random sampling from the normal distribution

- Mathematics
- 1973

This article is an expansion of G. E. Forsythe's paper "Von Neumann's com- parison method for random sampling from the normal and other distributions" (5). It is shown that Forsythe's method for the… Expand

Computer methods for sampling from the exponential and normal distributions

- Mathematics, Computer Science
- CACM
- 1972

The authors' primary conwiba~ion is the rise of polynomiaI sampling (as ex~ p/tiffed in Section 2) to eliminate any dependency on standard&ruction programs. Expand

The art of computer programming. Vol.2: Seminumerical algorithms

- Computer Science
- 1981

This professional art of computer programming volume 2 seminumerical algorithms 3rd edition that has actually been written by is one of the best seller books in the world and is never late to read. Expand

Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables

- Mathematics, Philosophy
- 1964

A handbook of mathematical functions that is designed to provide scientific investigations with a comprehensive and self-contained summary of the mathematical functions that arise in physical and… Expand

The Art of Computer Programming

- Computer Science
- 1968

The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid. Expand

ACM Transachons on Mathematical Software

- ACM Transachons on Mathematical Software
- 1981

Frtnctples of D~screte Event Simulation

- Frtnctples of D~screte Event Simulation
- 1978

Computer methods for samphng from gamma , beta , Poisson and binomial distributions

- Computing
- 1974