Skip to Main content Skip to Navigation
Journal articles

Analysis of some statistics for increasing tree families

Abstract : 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 mportant tree families that have applications in computer science or are used as probabilistic models in various applications, like \emphrecursive trees, heap-ordered trees or \emphbinary increasing trees (isomorphic to binary search trees) are members of this variety of trees. We consider the parameters \textitdepth of a randomly chosen node, \textitdistance between two randomly chosen nodes, and the generalisations where \textitp nodes are randomly chosen 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Thursday, March 13, 2014 - 5:06:31 PM
Last modification on : Wednesday, February 20, 2019 - 4:32:10 PM
Long-term archiving on: : Friday, June 13, 2014 - 12:18:05 PM


Files produced by the author(s)


  • HAL Id : hal-00959019, version 1



Alois Panholzer, Helmut Prodinger. Analysis of some statistics for increasing tree families. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2004, 6 (2), pp.437-460. ⟨hal-00959019⟩



Record views


Files downloads