Some Computational Problems Related to Multinomial Trials.
Abstract
Efficient numerical algorithms are developed to evaluate several probabilities related to multinomial trials. In the first part of the paper, the probability distribution of the number of trials until the alternatives j, j=1,...,m, have occurred at least (i sub j) times is computed. The multinomial trials involve the m alternatives 1,...,m, with positive probabilities (p sub 1),...,(p sub m), of occurrence. In the second part, several aspects of a multinomial subset selection problem, discussed by S. S. Gupta and K. Nagel, are numerically investigated. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Apr 01, 1974
- Accession Number
- AD0780591
Entities
People
- Charles C. Carson
- Marcel F. Neuts
Organizations
- Purdue University