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

DOI10.1214/21-AAP1671MaRDI QIDQ2117435zbMATH OpenFDO

Authors Antar Bandyopadhyay, Debleena Thacker

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

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

Cites work

• scientific article; zbMATH DE number 3784047 (Why is no real title available?)
• scientific article; zbMATH DE number 3465322 (Why is no real title available?)
• scientific article; zbMATH DE number 3539473 (Why is no real title available?)
• scientific article; zbMATH DE number 3604123 (Why is no real title available?)
• scientific article; zbMATH DE number 473379 (Why is no real title available?)
• scientific article; zbMATH DE number 2070282 (Why is no real title available?)
• scientific article; zbMATH DE number 765034 (Why is no real title available?)
• scientific article; zbMATH DE number 1409903 (Why is no real title available?)
• scientific article; zbMATH DE number 3349081 (Why is no real title available?)
• scientific article; zbMATH DE number 3395017 (Why is no real title available?)
• A new two-urn model
• A simple urn model
• A survey of random processes with reinforcement
• A time-dependent version of Pólya's urn
• A.s. convergence for infinite colour Pólya urns associated with random walks
• Applications of the theory of records in the study of random trees
• Asymptotic Normality in the Generalized Polya–Eggenberger Urn Model, with an Application to Computer Data Structures
• Asymptotics in randomized urn models
• Bernard Friedman's Urn
• Depth properties of scaled attachment random recursive trees
• Embedding of Urn Schemes into Continuous Time Markov Branching Processes and Related Limit Theorems
• Ferguson distributions via Polya urn schemes
• Functional limit theorems for multitype branching processes and generalized Pólya urns.
• Limit theorems for triangular urn schemes
• Markov Chains and Stochastic Stability
• Measure-valued Pólya urn processes
• Multicolor urn models with reducible replacement matrices
• Non-negative matrices and Markov chains.
• On a preferential attachment and generalized Pólya's urn model
• On generalized Pólya urn models
• On the distribution of depths in increasing trees
• Polya Urn Models
• Probability. Theory and examples.
• Pólya urn schemes with infinitely many colors
• Randomized urn models revisited using stochastic approximation
• Rate of convergence and large deviation for the infinite color Pólya urn schemes
• Regularly Varying Sequences
• Some exactly solvable models of urn process theory
• Strong Laws for Balanced Triangular Urns
• Strong convergence of infinite color balanced urns under uniform ergodicity
• Strong convergence of proportions in a multicolor Pólya urn
• Strong laws for urn models with balanced replacement matrices
• The simple harmonic urn

Cited in

(7)

• Limits of Pólya urns with innovations
• Asymptotics of generalized Pólya urns with non-linear feedback
• MATRIX-MFO tandem workshop: Stochastic reinforcement processes and graphs. Abstracts from the MATRIX-MFO tandem workshop held March 5--10, 2023
• Dynamical models for random simplicial complexes
• Sufficientness postulates for measure-valued Pólya urn sequences
• A New Approach to P\'olya Urn Schemes and Its Infinite Color Generalization
• Linear de-preferential urn models

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117435)