Generating random variates from a Log(p) distribution with probability mass function
p_k = p^k/(-log(1-p)k), k in IN,
where p in (0,1). The implemented algorithm is the one named “LK” in Kemp (1981).
rlog(n, p, Ip = 1 - p)
sample size, that is, length of the resulting vector of random variates.
parameter in (0,1).
= 1 - p, possibly more accurate, e.g, when p ~= 1.
For documentation and didactical purposes,
rlogR is a pure-R
rlogR is not as fast as
rlog (the latter being implemented in C).
A vector of positive
integers of length
n containing the
generated random variates.
Kemp, A. W. (1981), Efficient Generation of Logarithmically Distributed Pseudo-Random Variables, Journal of the Royal Statistical Society: Series C (Applied Statistics) 30, 3, 249–253.
1 2 3 4 5 6