Efficient Generation of Logarithmically Distributed Pseudo‐Random Variables

A. W. Kemp

Journal of the Royal Statistical Society Series C, 1981, vol. 30, issue 3, 249-253

Abstract: A one‐line algorithm LB is given for generating samples from the logarithmic series distribution. Two independent uniform random variables are converted into a single logarithmic variable by use of a structural property of the distribution. Faster versions of the method, algorithms LBM and LK, employ simple initial tests which identify those pairs of uniform random variables which yield the most frequently occurring values of the logarithmic variable. Comparison with a search method, algorithm LS, shows that the search method is faster when the parameter a of the logarithmic distribution is less than about 0‐95. However, values of a greater than 095 are often encountered. In ecological contexts a ranges from 0‐9 to 0‐9999; here the search method becomes prohibitively slow, and the algorithms based on the structural method are preferable. Both methods lead to very short, portable, procedures which require a trivial amount of storage.

Date: 1981
References: Add references at CitEc
Citations: View citations in EconPapers (1)

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

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:30:y:1981:i:3:p:249-253

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 ().