The Computer Generation of Poisson Random Variables

A. C. Atkinson

Journal of the Royal Statistical Society Series C, 1979, vol. 28, issue 1, 29-35

Abstract: A comparison is made of methods of generating samples on a computer from the Poisson distribution. The well‐known methods of counting the number of occurrences in a Poisson process and of sequentially searching through a table of cumulative probabilities have the disadvantage that the time required increases with the Poisson parameter μ. For fixed μ two modified search procedures are described which remain fast as μ increases. If μ. varies from sample to sample the modified search procedures are not directly applicable. But fast methods can be found which use combinations of either modified search method and are appreciably faster than rejection methods.

Date: 1979
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
https://doi.org/10.2307/2346807

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:jorssc:v:28:y:1979:i:1:p:29-35

Ordering information: This journal article can be ordered from
http://ordering.onli ... 1111/(ISSN)1467-9876

Access Statistics for this article

Journal of the Royal Statistical Society Series C is currently edited by R. Chandler and P. W. F. Smith

More articles in Journal of the Royal Statistical Society Series C from Royal Statistical Society Contact information at EDIRC.
Bibliographic data for series maintained by Wiley Content Delivery ().