On the degree distribution of the nodes in increasing trees

Simple families of increasing trees can be constructed from simply generated tree families, if one considers for every tree of size n all its increasing labellings, i.e., labellings of the nodes by distinct integers of the set {1,...,n} in such a way that each sequence of labels along any branch starting at the root is increasing. Three such tree families are of particular interest: recursive trees, plane-oriented recursive trees and binary increasing trees. We study the quantity degree of node j in a random tree of size n and give closed formulae for the probability distribution and all factorial moments for those subclass of tree families, which can be constructed via a tree evolution process. Furthermore limiting distribution results of this parameter are given, which completely characterize the phase change behavior depending on the growth of j compared to n.

[1]  Mohammad Q. Vahidi-Asl,et al.  Note on the outdegree of a node in random recursive trees , 2003 .

[2]  Robert Donaghey,et al.  Alternating Permutations and Binary Increasing Trees , 1975, J. Comb. Theory, Ser. A.

[3]  Helmut Prodinger,et al.  Level of nodes in increasing trees revisited , 2007, Random Struct. Algorithms.

[4]  Alois Panholzer,et al.  The distribution of the size of the ancestor‐tree and of the induced spanning subtree for random trees , 2004, Random Struct. Algorithms.

[5]  Mireille Bousquet-Mélou.  Limit laws for embedded trees: Applications to the integrated superBrownian excursion , 2006 .

[6]  Philippe Flajolet,et al.  Average-Case Analysis of Algorithms and Data Structures , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[7]  Helmut Prodinger,et al.  On monotone functions of tree structures , 1983, Discret. Appl. Math..

[8]  A. Kuznetsov,et al.  Increasing trees and alternating permutations , 1994 .

[9]  Jerzy Szymanski,et al.  On the Structure of Random Plane-oriented Recursive Trees and Their Branches , 1993, Random Struct. Algorithms.

[10]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[11]  H. Prodinger,et al.  Level of nodes in increasing trees revisited , 2007 .

[12]  Alois Panholzer,et al.  Isolating a Leaf in Rooted Trees via Random Cuttings , 2008 .

[13]  Svante Janson,et al.  Asymptotic degree distribution in random recursive trees , 2005, Random Struct. Algorithms.

[14]  Hosam M. Mahmoud,et al.  Asymptitic Hoint Normality of Outdegrees of Nodes in Random Recursive Trees , 1992, Random Struct. Algorithms.

[15]  John Riordan.  Forests of label-increasing trees , 1979, J. Graph Theory.

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

[17]  Hosam M. Mahmoud,et al.  On the Distribution of Leaves in Rooted Subtrees of Recursive Trees , 1991 .

[18]  Mireille Bousquet-Mélou,et al.  Concentration for self-bounding functions and an inequality of Talagrand , 2006 .

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

[20]  Alois Panholzer,et al.  Descendants in Increasing Trees , 2006, Electron. J. Comb..

[21]  Jiang-Hua Lu,et al.  STRONG CONSISTENCY OF THE NUMBER OF VERTICES OF GIVEN DEGREES IN NONUNIFORM RANDOM RECURSIVE TREES , 1998 .

[22]  Béla Bollobás,et al.  Mathematical results on scale‐free random graphs , 2005 .

[23]  J. Szymanski.  On a Nonuniform Random Recursive Tree , 1987 .

[24]  Michel Loève,et al.  Probability Theory I , 1977 .