arXiv Analytics

Sign in

arXiv:1301.3404 [math.PR]AbstractReferencesReviewsResources

Polya urns via the contraction method

Margarete Knape, Ralph Neininger

Published 2013-01-15, updated 2013-11-19Version 3

We propose an approach to analyze the asymptotic behavior of P\'olya urns based on the contraction method. For this, a new combinatorial discrete time embedding of the evolution of the urn into random rooted trees is developed. A decomposition of these trees leads to a system of recursive distributional equations which capture the distributions of the numbers of balls of each color. Ideas from the contraction method are used to study such systems of recursive distributional equations asymptotically. We apply our approach to a couple of concrete P\'olya urns that lead to limit laws with normal limit distributions, with non-normal limit distributions and with asymptotic periodic distributional behavior.

Comments: minor revision; accepted for publication in Combinatorics, Probability & Computing (Special issue dedicated to the memory of Philippe Flajolet)
Categories: math.PR
Subjects: 60C05, 60F05, 60J05, 68Q25
Related articles: Most relevant | Search more
arXiv:math/0410177 [math.PR] (Published 2004-10-06)
On the contraction method with degenerate limit equation
arXiv:1505.07321 [math.PR] (Published 2015-05-27)
A Limit Theorem for Radix Sort and Tries with Markovian Input
arXiv:math/0405144 [math.PR] (Published 2004-05-08)
The space requirement of m-ary search trees: distributional asymptotics for m >= 27