Descendants in increasing trees
The electronic journal of combinatorics, Tome 13 (2006)
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, \dots, 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 number of descendants of node $j$ in a random tree of size $n$ and give closed formulæ for the probability distribution and all factorial moments for those subclass of tree families, which can be constructed via an insertion process. Furthermore limiting distribution results of this parameter are given.
@article{10_37236_1034,
author = {Markus Kuba and Alois Panholzer},
title = {Descendants in increasing trees},
journal = {The electronic journal of combinatorics},
year = {2006},
volume = {13},
doi = {10.37236/1034},
zbl = {1080.05019},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1034/}
}
Markus Kuba; Alois Panholzer. Descendants in increasing trees. The electronic journal of combinatorics, Tome 13 (2006). doi: 10.37236/1034
Cité par Sources :