The distribution of the size of the ancestor‐tree and of the induced spanning subtree for random trees

We consider two tree statistics that extend in a natural way the parameters depth of a node resp. distance between two nodes. The ancestor-tree of p given nodes in a rooted tree T is the subtree of T, spanned by the root and these p nodes and generalizes the depth (ancestor-tree of a single node), whereas the spanning subtree induced by p given nodes in a tree T generalizes the distance (induced spanning subtree of two nodes). We study the random variables size of the ancestor-tree resp. spanning subtree size for two tree families, the simply generated trees and the recursive trees. We will assume here the random tree model and also that all () possibilities of selecting p nodes in a tree of size n are equally likely. For random simply generated trees we can then characterize for a fixed number p of chosen nodes the limiting distribution of both parameters as generalized Gamma distributions, where we prove the convergence of the moments too. For some specific simply generated tree families we can give exact formulae for the first moments. In the instance of random recursive trees, we will show that the considered parameters are asymptotically normally distributed, where we can give also exact formulae for the expectation and the variance. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004

[1]  Hosam M. Mahmoud,et al.  Distribution of distances in random binary search trees , 2003 .

[2]  Robert P. Dobrow On the distribution of distances in recursive trees , 1996 .

[3]  Hsien-Kuei Hwang,et al.  On Convergence Rates in the Central Limit Theorems for Combinatorial Structures , 1998, Eur. J. Comb..

[4]  Ralph Neininger The Wiener Index Of Random Trees , 2002, Comb. Probab. Comput..

[5]  A. Meir,et al.  The distance between points in random trees , 1970 .

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

[7]  Philippe Flajolet,et al.  Search Trees and Bubble Memories , 1985, RAIRO Theor. Informatics Appl..

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

[9]  Rainer Kemp The expected additive weight of trees , 2004, Acta Informatica.

[10]  Svante Janson,et al.  The Wiener Index of simply generated random trees , 2003, Random Struct. Algorithms.

[11]  Philippe Flajolet,et al.  The Average Height of Binary Trees and Other Simple Trees , 1982, J. Comput. Syst. Sci..

[12]  Helmut Prodinger,et al.  Spanning tree size in random binary search trees , 2004, math/0405292.

[13]  W. H. Williams,et al.  Probability Theory and Mathematical Statistics , 1964 .

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

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

[16]  M. DRMOTA The height distribution of leaves in rooted trees , 1994 .

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

[18]  Philippe Flajolet,et al.  An introduction to the analysis of algorithms , 1995 .