Smoothing equations for large Pólya urns 1 May 29 th 2013
نویسندگان
چکیده
Consider a balanced non triangular two-color Pólya-Eggenberger urn process, assumed to be large which means that the ratio σ of the replacement matrix eigenvalues satisfies 1/2 < σ < 1. The composition vector of both discrete time and continuous time models admits a drift which is carried by the principal direction of the replacement matrix. In the second principal direction, this random vector admits also an almost sure asymptotics and a real-valued limit random variable arises, named W in discrete time and W in continous time. The paper deals with the distributions of both W . Appearing as martingale limits, known to be nonnormal, these laws remain up to now rather mysterious. Exploiting the underlying tree structure of the urn process, we show that W and W are the unique solutions of two distributional systems in some suitable spaces of integrable probability measures. These systems are natural extensions of distributional equations that already appeared in famous algorithmical problems like Quicksort analysis. Existence and unicity of the solutions of the systems are obtained by means of contracting smoothing transforms. Via the equation systems, we find upperbounds for the moments of W and W and we show that the laws of W and W are moment-determined. We also prove that W is supported by the whole real line and admits a continuous density (W was already known to have a density, infinitely differentiable on R \ {0} and not bounded at the origin).
منابع مشابه
Smoothing equations for large Pólya urns 1 February 6 th 2013
Consider a balanced non triangular two-color Pólya-Eggenberger urn process, assumed to be large which means that the ratio σ of the replacement matrix eigenvalues satisfies 1/2 < σ < 1. The composition vector of both discrete time and continuous time models admits a drift which is carried by the principal direction of the replacement matrix. In the second principal direction, this random vector...
متن کاملPólya Urns Via the Contraction Method
We propose an approach to analyze the asymptotic behavior of Pólya urns based on the contraction method. For this a combinatorial discrete time embedding of the evolution of the composition of the urn into random rooted trees is used. A decomposition of the trees leads to a system of recursive distributional equations which capture the distributions of the numbers of balls of each color. Ideas ...
متن کاملB - urns 1
The fringe of a B-tree with parameter m is considered as a particular Pólya urn with m colors. More precisely, the asymptotic behaviour of this fringe, when the number of stored keys tends to infinity, is studied through the composition vector of the fringe nodes. We establish its typical behaviour together with the fluctuations around it. The well known phase transition in Pólya urns has the f...
متن کاملFully Analyzing an Algebraic Pólya Urn Model
This paper introduces and analyzes a particular class of Pólya urns: balls are of two colors, can only be added (the urns are said to be additive) and at every step the same constant number of balls is added, thus only the color compositions varies (the urns are said to be balanced). These properties make this class of urns ideally suited for analysis from an “analytic combinatorics” point-of-v...
متن کاملClassification of large Pólya-Eggenberger urns with regard to their asymptotics
This article deals with Pólya generalized urn models with constant balance in any dimension. It is based on the algebraic approach of Pouyanne (2005) and classifies urns having “large” eigenvalues in five classes, depending on their almost sure asymptotics. These classes are described in terms of the spectrum of the urn’s replacement matrix and examples of each case are treated. We study the ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013