Asymptotic probabilities in a sequential urn scheme related to the matchbox problem

DOI10.1239/aap/1035228131zbMath0922.60064OpenAlexW1972571010MaRDI QIDQ4221256

Wolfgang Stadje

Publication date: 3 October 1999

Published in: Unnamed Author (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/79c5ffa08c9e2302571a549af536334297f4dcb9

zbMATH Keywords

asymptotic behaviorextinction probabilityinteracting speciesmatchbox problemresidual population sizevariable removal probability

Mathematics Subject Classification ID

Combinatorial probability (60C05) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Limit theorems in probability theory (60F99)

Related Items (3)

Gambler's ruin and winning a series by \(m\) games ⋮ Order statistics and the length of the best-n-of-(2n − 1) competition ⋮ Limiting Distributions for a Class Of Diminishing Urn Models

This page was built for publication: Asymptotic probabilities in a sequential urn scheme related to the matchbox problem