Negatively reinforced balanced urn schemes

DOI10.1016/j.aam.2019.01.001zbMath1408.60020arXiv1808.00796OpenAlexW2963379335WikidataQ128535155 ScholiaQ128535155MaRDI QIDQ1738316

Gursharn Kaur

Publication date: 29 March 2019

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

stochastic approximationcentral limit theoremalmost sure convergenceurn modelsnegative reinforcement

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Random measures (60G57)

Cites Work

• Unnamed Item
• Unnamed Item
• Randomized urn models revisited using stochastic approximation
• Strong laws for urn models with balanced replacement matrices
• Central limit theorems of a recursive stochastic algorithm with applications to adaptive designs
• Multicolor urn models with reducible replacement matrices
• A time-dependent version of Pólya's urn
• Nonconvergence to unstable points in urn models and stochastic approximations
• Stochastic approximation methods for constrained and unconstrained systems
• Asymptotics in randomized urn models
• Rate of convergence and large deviation for the infinite color Pólya urn schemes
• Pólya urn schemes with infinitely many colors
• On the maximum queue length in the supermarket model
• On the power of two choices: balls and bins in continuous time
• Functional limit theorems for multitype branching processes and generalized Pólya urns.
• Urn models and differential algebraic equations
• Linear de-preferential urn models
• Strong Laws for Balanced Triangular Urns
• Central limit theorems for generalized Pólya urn models

This page was built for publication: Negatively reinforced balanced urn schemes