Generalized Poisson Random Variate Generation

From MaRDI portal





This paper deals with several possibilities of pseudorandom number generation of generalized Poisson random variables whose distribution class with parameters \(\theta, \lambda\) was introduced by \textit{P. C. Consul} and \textit{G. C. Jain} [Technometrics 15, 791-799 (1973; Zbl 0271.60020)]. Several sampling methods (e.g. inversion, rejection, branching methods and normal approximation) are presented and compared with respect to elapsed CPU times on IBM machines. The authors also provide source codes of the presented algorithms in Fortran. Distinguishing between several parameter ranges, it turns out that the inversion and branching methods seem to be faster than the other presented ones. Comments concerning some methods of quasirandom number generation for those distributions can not be found there.











This page was built for publication: Generalized Poisson Random Variate Generation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4375847)