Skip to Main content Skip to Navigation
Conference papers

Some results for monotonically labelled simply generated trees

Abstract : We consider simply generated trees, where the nodes are equipped with weakly monotone labellings with elements of $\{1, 2, \ldots, r\}$, for $r$ fixed. These tree families were introduced in Prodinger and Urbanek (1983) and studied further in Kirschenhofer (1984), Blieberger (1987), and Morris and Prodinger (2005). Here we give distributional results for several tree statistics (the depth of a random node, the ancestor-tree size and the Steiner-distance of $p$ randomly chosen nodes, the height of the $j$-st leaf, and the number of nodes with label $l$), which extend the existing results and also contain the corresponding results for unlabelled simply generated trees as the special case $r=1$.
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Wednesday, August 12, 2015 - 3:51:35 PM
Last modification on : Wednesday, October 13, 2021 - 7:58:04 PM
Long-term archiving on: : Friday, November 13, 2015 - 11:40:06 AM


Publisher files allowed on an open archive




Bernhard Gittenberger, Alois Panholzer. Some results for monotonically labelled simply generated trees. 2005 International Conference on Analysis of Algorithms, 2005, Barcelona, Spain. pp.173-180, ⟨10.46298/dmtcs.3356⟩. ⟨hal-01184028⟩



Record views


Files downloads