Generalized Poisson Random Variate Generation (Q4375847)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1114136
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generalized Poisson Random Variate Generation |
scientific article; zbMATH DE number 1114136 |
Statements
Generalized Poisson Random Variate Generation (English)
0 references
30 June 1998
0 references
generalized Poisson distribution
0 references
pseudorandom number generation
0 references
inversion, rejection and branching methods
0 references
normal approximation
0 references
comparison studies
0 references
algorithms
0 references
0.8569502830505371
0 references
0.8529947400093079
0 references
0.8460572361946106
0 references
0.8165191411972046
0 references
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.
0 references