Smoothing Equations for Large Pólya Urns

Consider a balanced nontriangular two-color Pólya–Eggenberger urn process, assumed to be large, which means that the ratio $$\sigma $$σ of the replacement matrix eigenvalues satisfies $$1/2<\sigma <1$$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^\mathrm{DT}$$WDT in discrete time and $$W^\mathrm{CT}$$WCT in continuous time. The paper deals with the distributions of both $$W$$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^\mathrm{DT}$$WDT and $$W^\mathrm{CT}$$WCT 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 upper bounds for the moments of $$W^\mathrm{DT}$$WDT and $$W^\mathrm{CT}$$WCT and we show that the laws of $$W^\mathrm{DT}$$WDT and $$W^\mathrm{CT}$$WCT are moment determined. We also prove that $$W^\mathrm{DT}$$WDT is supported by the whole real line, its exponential moment generating series has an infinite radius of convergence and $$W^\mathrm{DT}$$WDT admits a continuous density ($$W^\mathrm{CT}$$WCT was already known to have a density, infinitely differentiable on $$\mathbb R{\setminus }\{ 0\}$$R\{0} and not bounded at the origin).

[1]  Quansheng Liu Fixed points of a generalized smoothing transformation and applications to the branching random walk , 1998, Advances in Applied Probability.

[2]  Svante Janson,et al.  Functional limit theorems for multitype branching processes and generalized Pólya urns , 2004 .

[3]  Hosam M. Mahmoud,et al.  Polya Urn Models , 2008 .

[4]  Quansheng Liu,et al.  Support and density of the limit $m$-ary search trees distribution , 2012 .

[5]  D. Aldous,et al.  A survey of max-type recursive distributional equations , 2004, math/0401388.

[6]  Ralph Neininger,et al.  Pólya Urns Via the Contraction Method , 2013, Combinatorics, Probability and Computing.

[7]  Gerold Alsmeyer,et al.  The functional equation of the smoothing transform , 2009, 0906.3133.

[8]  Nicolas Pouyanne,et al.  An algebraic approach of Polya processes , 2006, ArXiv.

[9]  J. Kahane,et al.  Sur certaines martingales de Benoit Mandelbrot , 1976 .

[10]  Quansheng Liu,et al.  Asymptotic properties and absolute continuity of laws stable by random weighted mean , 2001 .

[11]  Quansheng Liu,et al.  Asymptotic properties of supercritical age-dependent branching processes and homogeneous branching random walks , 1999 .

[12]  David Blackwell,et al.  The Martin boundary for Polya's urn scheme, and an application to stochastic population growth , 1964, Journal of Applied Probability.

[13]  James Allen Fill,et al.  The space requirement of m-ary search trees: distributional asymptotics for m >= 27 , 2004 .

[14]  K. Athreya,et al.  Embedding of Urn Schemes into Continuous Time Markov Branching Processes and Related Limit Theorems , 1968 .

[15]  L. Rüschendorf,et al.  A general limit theorem for recursive algorithms and combinatorial structures , 2004 .

[16]  Andreas E. Kyprianou,et al.  Fixed Points of the Smoothing Transform: the Boundary Case , 2005 .

[17]  Philippe Flajolet,et al.  Some exactly solvable models of urn process theory , 2006 .

[18]  U. Rösler A fixed point theorem for distributions , 1992 .

[19]  Julien Barral Moments, continuité, et analyse multifractale des martingales de Mandelbrot , 1999 .

[20]  R. Durrett,et al.  Fixed points of the smoothing transformation , 1983 .

[21]  L. Rüschendorf,et al.  Analysis of Algorithms by the Contraction Method: Additive and Max-recursive Sequences , 2005 .

[22]  Mikko Alava,et al.  Branching Processes , 2009, Encyclopedia of Complexity and Systems Science.

[23]  Quansheng Liu,et al.  Limit distributions for multitype branching processes of $m$-ary search trees , 2011, 1112.0256.

[24]  Nicolas Pouyanne,et al.  Limit distributions for large P\'{o}lya urns , 2009, 0907.1477.

[25]  Uwe Rr Osler The Contraction Method for Recursive Algorithms , 1999 .

[26]  Dudley,et al.  Real Analysis and Probability: Measurability: Borel Isomorphism and Analytic Sets , 2002 .

[27]  Norman L. Johnson,et al.  Urn models and their application , 1977 .

[28]  J. Gabarró,et al.  Analytic urns , 2004, math/0407098.

[29]  G. Pólya,et al.  Sur quelques points de la théorie des probabilités , 1930 .

[30]  Ludger Rüschendorf,et al.  Survey of Multivariate Aspects of the Contraction Method , 2006, Discret. Math. Theor. Comput. Sci..