On waiting time in the Markov-Pólya scheme

DOI10.1007/BF02432862zbMath0912.60062MaRDI QIDQ1273362

G. I. Ivchenko, Alexander V. Ivanov

Publication date: 9 December 1998

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

zbMATH Keywords

limit theoremsurn schemes

Mathematics Subject Classification ID

Combinatorial probability (60C05) Stopping times; optimal stopping problems; gambling theory (60G40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Limit theorems in an allocation scheme with random levels
• Decomposable statistics in an inverse allocation problem
• On Interchanging Limits and Integrals
• Sequential urn schemes and birth processes
• The waiting time and related statistics in the multinomial scheme: a survey
• Decomposable statistics and stopping times in sampling without replacement
• Decomposable statistics in inverse urn problems

This page was built for publication: On waiting time in the Markov-Pólya scheme