×

Analysis of some statistics for increasing tree families. (English) Zbl 1066.68099

This paper deals with statistics concerning distances between randomly chosen nodes in varieties of increasing trees. Increasing trees are labelled rooted trees where labels along any branch from the root go in increasing order. Many important tree families that have applications in computer science or are used as probabilistic models in various applications, like recursive trees, heap-ordered trees or binary increasing trees (isomorphic to binary search trees) are members of this variety of trees. We consider the parameter depth of a randomly chosen node, distance between two randomly chosen nodes, and the generalisations where \(p\) nodes are randomly chosen: the size of the ancestor-tree of these selected nodes and the size of the smallest subtree generated by these nodes, also called Steiner distance. Under the restriction that the node-degrees are bounded, we can prove that all these parameters converge in law to the Normal distribution. This extends results obtained earlier for binary search trees and heap-ordered trees to a much larger class of structures.

MSC:

68R10 Graph theory (including graph drawing) in computer science
PDFBibTeX XMLCite
Full Text: EuDML EMIS