Pólya Urns Via the Contraction Method

DOI10.1017/S0963548314000364zbMath1301.60012arXiv1301.3404MaRDI QIDQ2929861

Ralph Neininger, Margarete Knape

Publication date: 14 November 2014

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Central limit and other weak theorems (60F05) Discrete-time Markov processes on general state spaces (60J05) Combinatorial probability (60C05)

Related Items (16)

Solutions to complex smoothing equations ⋮ Two-color balanced affine urn models with multiple drawings ⋮ The fixed points of the multivariate smoothing transform ⋮ Smoothing equations for large Pólya urns ⋮ Pólya urns with immigration at random times ⋮ On densities for solutions to stochastic fixed point equations ⋮ Refined asymptotics for the composition of cyclic urns ⋮ Absolute continuity of complex martingales and of solutions to complex smoothing equations ⋮ Dependence and phase changes in random m‐ary search trees ⋮ Nonlinear randomized urn models: a stochastic approximation viewpoint ⋮ On martingale tail sums in affine two-color urn models with multiple drawings ⋮ An asymptotic distribution theory for Eulerian recurrences with applications ⋮ Random additions in urns of integers ⋮ Models induced from critical birth–death process with random initial conditions ⋮ Unnamed Item ⋮ Broadcasting on random recursive trees

Cites Work

• Limit distributions for large Pólya urns
• An algebraic approach to Pólya processes
• Limit theorems for certain branching random walks on compact groups and homogeneous spaces
• The size of random fragmentation trees
• Moments of gamma type and the Brownian supremum process area
• Some asymptotic theory for the bootstrap
• Variance in randomized play-the-winner clinical trials
• Central limit theorems for urn models
• A general limit theorem for recursive algorithms and combinatorial structures
• On generalized Pólya urn models
• Asymptotic theorems for urn models with nonhomogeneous generating matrices
• Analytic urns
• Gaussian approximation theorems for urn models and their applications
• A functional limit theorem for the profile of search trees
• Functional limit theorems for multitype branching processes and generalized Pólya urns.
• On a multivariate contraction method for random recursive structures with applications to Quicksort
• Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions
• Asymptotic Normality in the Generalized Polya–Eggenberger Urn Model, with an Application to Computer Data Structures
• Probability metrics and recursive algorithms
• Embedding of Urn Schemes into Continuous Time Markov Branching Processes and Related Limit Theorems

This page was built for publication: Pólya Urns Via the Contraction Method