Generalized waiting time problems associated with pattern in Polya's urn scheme (Q1868284)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Generalized waiting time problems associated with pattern in Polya's urn scheme |
scientific article; zbMATH DE number 1901361
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generalized waiting time problems associated with pattern in Polya's urn scheme |
scientific article; zbMATH DE number 1901361 |
Statements
Generalized waiting time problems associated with pattern in Polya's urn scheme (English)
0 references
27 April 2003
0 references
For the random sequence of ball labels obtained from Polya's urn scheme the authors consider the sum of `scores' until a certain pattern occurs. (Every label has a certain score.) They present an infinite system of equations for the conditional probability generating functions of this sum and a truncated version that can be handled by computer algebra systems.
0 references
Polya's urn scheme
0 references
pattern
0 references
waiting time: probability generating function
0 references
truncation
0 references
0 references
0.89922106
0 references
0.89151347
0 references
0.87742275
0 references
0.87313324
0 references
