Curiosities regarding waiting times in P\'{o}lya's urn model
From MaRDI portal
Publication:5146333
zbMath1454.60016arXiv1911.01052MaRDI QIDQ5146333
No author found.
Publication date: 25 January 2021
Full work available at URL: https://arxiv.org/abs/1911.01052
Combinatorial probability (60C05) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)
Cites Work
- Unnamed Item
- Unnamed Item
- A \(q\)-Pólya urn model and the \(q\)-Pólya and inverse \(q\)-Pólya distributions
- A survey of random processes with reinforcement
- Generalized waiting time problems associated with pattern in Polya's urn scheme
- Polya, Inverse Polya, and Circular Polya Distributions of Orderkforl-Overlapping Success Runs
This page was built for publication: Curiosities regarding waiting times in P\'{o}lya's urn model