Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees

We prove convergence in distribution for the profile (the number of nodes at each level), normalized by its mean, of random recursive trees when the limit ratio α of the level and the logarithm of tree size lies in [0,e). Convergence of all moments is shown to hold only for α ∈ [0,1] (with only convergence of finite moments when α ∈ (1,e)). When the limit ratio is 0 or 1 for which the limit laws are both constant, we prove asymptotic normality for α = 0 and a "quicksort type" limit law for α = 1, the latter case having additionally a small range where there is no fixed limit law. Our tools are based on the contraction method and method of moments. Similar phenomena also hold for other classes of trees; we apply our tools to binary search trees and give a complete characterization of the profile. The profiles of these random trees represent concrete examples for which the range of convergence in distribution differs from that of convergence of all moments.

[1]  J. Moon,et al.  On the Altitude of Nodes in Random Trees , 1978, Canadian Journal of Mathematics.

[2]  J. Pitman.  The SDE solved by local times of a brownian excursion or bridge derived from the height profile of a random tree or forest , 1999 .

[3]  HwangHsien-Kuei.  Profiles of random trees: Plane-oriented recursive trees , 2007 .

[4]  Uwe Rösler,et al.  The contraction method for recursive algorithms , 2001, Algorithmica.

[5]  James Allen Fill,et al.  Total Path Length for Random Recursive Trees , 1999, Combinatorics, Probability and Computing.

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

[7]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[8]  P. Erdos,et al.  On some problems of a statistical group-theory. II , 1967 .

[9]  Hsien-Kuei Hwang,et al.  Profiles of random trees: Plane‐oriented recursive trees , 2007, Random Struct. Algorithms.

[10]  V. Zolotarev.  Approximation of Distributions of Sums of Independent Random Variables with Values in Infinite-Dimensional Spaces , 1977 .

[11]  Luc Devroye.  Universal Limit Laws for Depths in Random Trees , 1998, SIAM J. Comput..

[12]  P. Erdos,et al.  On some problems of a statistical group-theory. III , 1967 .

[13]  Barry D Hughes,et al.  Stochastically evolving networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  Bernhard Gittenberger,et al.  On the profile of random trees , 1997 .

[15]  Anatol Rapoport,et al.  Distribution of nodes of a tree by degree , 1970 .

[16]  V. Zolotarev.  Ideal Metrics in the Problem of Approximating Distributions of Sums of Independent Random Variables , 1978 .

[17]  Hsien-Kuei Hwang,et al.  Profiles of random trees: correlation and width of random recursive trees and binary search trees , 2005, Advances in Applied Probability.

[18]  Piet Van Mieghem,et al.  Implications for QoS Provisioning Based on Traceroute Measurements , 2002, QofIS.

[19]  Donald E. Knuth,et al.  The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition , 1997 .

[20]  V. V. Petrov.  Sums of Independent Random Variables , 1975 .

[21]  C. C. Heyde,et al.  On the number of terminal vertices in certain random trees with an application to stemma construction in philology , 1982, Journal of Applied Probability.

[22]  Boris G. Pittel,et al.  Note on the Heights of Random Recursive Trees and Random m-ary Search Trees , 1994, Random Struct. Algorithms.

[23]  G. Tetzlaff.  Breakage and restoration in recursive trees , 2002, Journal of Applied Probability.

[24]  T. Klein,et al.  Martingales and Profile of Binary Search Trees , 2004, math/0410211.

[25]  Hosam M. Mahmoud,et al.  Evolution of random search trees , 1991, Wiley-Interscience series in discrete mathematics and optimization.

[26]  Luc Devroye,et al.  On the Generation of Random Binary Search Trees , 1995, SIAM J. Comput..

[27]  J. Moon,et al.  Combinatorics: The distance between nodes in recursive trees , 1974 .

[28]  Hsien-Kuei Hwang,et al.  Transitional behaviors of the average cost of quicksort with median-of-(2t + 1) , 2001, Algorithmica.

[29]  Joseph L. Gastwirth,et al.  Two Probability Models of Pyramid or Chain Letter Schemes Demonstrating that Their Promotional Claims are Unreliable , 1984, Oper. Res..

[30]  Philippe Jacquet,et al.  Average Profile of the Lempel-Ziv Parsing Scheme for a Markovian Source , 2001, Algorithmica.

[31]  Richard G. Larson,et al.  Hopf-algebraic structure of families of trees , 1989 .

[32]  D. Aldous.  Stochastic Analysis: The Continuum random tree II: an overview , 1991 .

[33]  Hosam M. Mahmoud.  Limiting Distributions for Path Lengths in Recursive Trees , 1991 .

[34]  Philippe Flajolet,et al.  Singularity Analysis of Generating Functions , 1990, SIAM J. Discret. Math..

[35]  David J. Evans,et al.  The parallel quicksort algorithm part i–run time analysis , 1982 .

[36]  Michael Drmota,et al.  Bimodality and Phase Transitions in the Profile Variance of Random Binary Search Trees , 2005, SIAM J. Discret. Math..

[37]  Hsien-Kuei Hwang,et al.  Phase changes in random m‐ary search trees and generalized quicksort , 2001, Random Struct. Algorithms.

[38]  Colin McDiarmid,et al.  Giant Components for Two Expanding Graph Processes , 2002 .

[39]  A. Meir,et al.  Cutting down recursive trees , 1974 .

[40]  Piet Van Mieghem,et al.  On the covariance of the level sizes in random recursive trees , 2002, Random Struct. Algorithms.

[41]  Piet Van Mieghem,et al.  On the efficiency of multicast , 2001, TNET.

[42]  D. Aldous,et al.  A diffusion limit for a class of randomly-growing binary trees , 1988 .

[43]  Hsien-Kuei Hwang,et al.  Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions , 2002, SIAM J. Comput..

[44]  Luc Devroye,et al.  Branching processes in the analysis of the heights of trees , 1987, Acta Informatica.

[45]  Hsien-Kuei Hwang,et al.  Asymptotic expansions for the Stirling numbers of the first kind , 1995 .

[46]  Hosam M. Mahmoud,et al.  Probabilistic Analysis of Bucket Recursive Trees , 1995, Theor. Comput. Sci..

[47]  A. Rouault,et al.  Connecting Yule Process, Bisection and Binary Search Tree via Martingales , 2004, math/0410318.

[48]  Hsien-Kuei Hwang,et al.  An asymptotic theory for Cauchy-Euler differential equations with applications to the analysis of algorithms , 2002, J. Algorithms.

[49]  M. Drmota,et al.  The Profile of Binary Search Trees , 2001 .

[50]  Philippe Flajolet,et al.  Varieties of Increasing Trees , 1992, CAAP.

[51]  Jim Freeman.  Probability Metrics and the Stability of Stochastic Models , 1991 .