A new approach to Pólya urn schemes and its infinite color generalization

DOI10.1214/21-AAP1671MaRDI QIDQ2117435

Debleena Thacker, Antar Bandyopadhyay

Publication date: 21 March 2022

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1606.05317

zbMATH Keywords

representation theoremrandom recursive treesurn modelsbranching Markov chainsreinforcement processescolor count statisticsinfinite color urnrandom replacement matrices

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Sums of independent random variables; random walks (60G50) Large deviations (60F10) Sufficiency and information (62Bxx) Statistical distribution theory (62Exx)

Related Items (4)

MATRIX-MFO tandem workshop: Stochastic reinforcement processes and graphs. Abstracts from the MATRIX-MFO tandem workshop held March 5--10, 2023 ⋮ Limits of Pólya urns with innovations ⋮ Linear de-preferential urn models ⋮ Dynamical models for random simplicial complexes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Randomized urn models revisited using stochastic approximation
• Strong laws for urn models with balanced replacement matrices
• Measure-valued Pólya urn processes
• Multicolor urn models with reducible replacement matrices
• On the distribution of depths in increasing trees
• The simple harmonic urn
• Limit theorems for triangular urn schemes
• A time-dependent version of Pólya's urn
• A survey of random processes with reinforcement
• Applications of the theory of records in the study of random trees
• Ferguson distributions via Polya urn schemes
• Asymptotics in randomized urn models
• On a preferential attachment and generalized Pólya's urn model
• A.s. convergence for infinite colour Pólya urns associated with random walks
• Rate of convergence and large deviation for the infinite color Pólya urn schemes
• Pólya urn schemes with infinitely many colors
• Non-negative matrices and Markov chains.
• Functional limit theorems for multitype branching processes and generalized Pólya urns.
• Depth Properties of scaled attachment random recursive trees
• Polya Urn Models
• Markov Chains and Stochastic Stability
• Asymptotic Normality in the Generalized Polya–Eggenberger Urn Model, with an Application to Computer Data Structures
• Strong convergence of proportions in a multicolor Pólya urn
• Strong convergence of infinite color balanced urns under uniform ergodicity
• A New Two-Urn Model
• Strong Laws for Balanced Triangular Urns
• On Generalized Pólya Urn Models
• Bernard Friedman's Urn
• Embedding of Urn Schemes into Continuous Time Markov Branching Processes and Related Limit Theorems
• Regularly Varying Sequences
• A simple urn model
• Probability

This page was built for publication: A new approach to Pólya urn schemes and its infinite color generalization