Generalized waiting time problems associated with pattern in Polya's urn scheme
type: Item
instance of: scholarly article
title: Generalized waiting time problems associated with pattern in Polya's urn scheme
zbMATH Open document ID: 1036.60007
DOI: 10.1023/A:1022431631697
author: Kiyoshi Inoue
author: Sigeo Aki
published in: Annals of the Institute of Statistical Mathematics
publication date: 2003-04-27T00:00:00Z
review text: 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.
reviewed by: Wolfgang Stadje
Mathematics Subject Classification ID: 60C05
Mathematics Subject Classification ID: 60G40
zbMATH DE Number: 1901361
zbMATH Keywords: Polya's urn scheme
zbMATH Keywords: pattern
zbMATH Keywords: waiting time: probability generating function
zbMATH Keywords: truncation
MaRDI profile type: Publication
full work available at URL: a:1022431631697
OpenAlex ID: W1486585985
Recommended article: Generalizations of Polya's urn problem
Recommended article: Q4864528
Recommended article: A generalization of a waiting time problem
Recommended article: A generalized URN problem and its applications
Recommended article: On waiting time in the Markov-Pólya scheme
Recommended article: Exact and asymptotic results for pattern waiting times
Recommended article: On generating functions of waiting time problems for sequence patterns of discrete random variables
description: scientific article; zbMATH DE number 1901361