Efficient Generation of Logarithmically Distributed Pseudo-Random Variables

Abstract

Summary 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.

On accurate and precise generation of generalized Poisson variates

“…Method is a general method in which the cdf is built up by the recursive computation of the mass probabilities (Kemp, 1981).…”

“…Chop-Down Method is a general method in which the generated uniform variate is decreased by an amount equal to the cdf (Kemp, 1981).…”

Enjoy the Joy of Copulas: With a Packagecopula

“…Gamma variable generator is available in the R base. Algorithms for generating positive stable and log series variables can be found in Chambers, Mallows, and Stuck (1976) and Kemp (1981), respectively. In particular, the copula package uses a Fortran implementation of Nolan (2006), which is a revised version of Chambers et al (1976), to generate positive stable variables.…”

Random Number Generation and Monte Carlo Methods

“…For this case, Kemp (1981) describes two approaches. One is a "build-up search" method in which the CDF is built up by the recursive computation of the mass probabilities.…”