A modal method for generating binomial variables (Q3750020)
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 3986512
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A modal method for generating binomial variables |
scientific article; zbMATH DE number 3986512 |
Statements
A modal method for generating binomial variables (English)
0 references
1986
0 references
modal down-up generator
0 references
generating binomial random variables
0 references
algorithm
0 references
sequentially searching
0 references
modal probability
0 references
FORTRAN 77
0 references
0 references
0 references
0 references
0.8506457805633545
0 references
0.8506457805633545
0 references
0.8288231492042542
0 references
0.8194838166236877
0 references
The paper considers the problem of generating binomial random variables when the parameters n and p may vary from call to call (as in the generation of multinomial random variables). A new algorithm, based on sequentially searching alternately down and up from the modal probability, is introduced. This is easy to program and requires no special library facilities. It is suitable for microcomputers as well as mainframes. Some sample timings are given for a FORTRAN 77 implementation.
0 references