# 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$.
Keywords :
Type de document :
Communication dans un congrès
Conrado Martínez. 2005 International Conference on Analysis of Algorithms, 2005, Barcelona, Spain. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms, pp.173-180, 2005, DMTCS Proceedings
Domaine :
Liste complète des métadonnées

Littérature citée [11 références]

https://hal.inria.fr/hal-01184028
Contributeur : Coordination Episciences Iam <>
Soumis le : mercredi 12 août 2015 - 15:51:35
Dernière modification le : mercredi 10 mai 2017 - 17:39:16
Document(s) archivé(s) le : vendredi 13 novembre 2015 - 11:40:06

### Fichier

Fichiers éditeurs autorisés sur une archive ouverte

### Identifiants

• HAL Id : hal-01184028, version 1

### Citation

Bernhard Gittenberger, Alois Panholzer. Some results for monotonically labelled simply generated trees. Conrado Martínez. 2005 International Conference on Analysis of Algorithms, 2005, Barcelona, Spain. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms, pp.173-180, 2005, DMTCS Proceedings. 〈hal-01184028〉

### Métriques

Consultations de la notice

## 79

Téléchargements de fichiers