The profile of unlabeled trees - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Discrete Mathematics and Theoretical Computer Science Année : 2005

The profile of unlabeled trees

Résumé

We consider the number of nodes in the levels of unlabeled rooted random trees and show that the joint distribution of several level sizes (where the level number is scaled by $\sqrt{n}$) weakly converges to the distribution of the local time of a Brownian excursion evaluated at the times corresponding to the level numbers. This extends existing results for simply generated trees and forests to the case of unlabeled rooted trees.
Fichier principal
Vignette du fichier
dmAD0116.pdf (98.9 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01184024 , version 1 (12-08-2015)

Identifiants

Citer

Bernhard Gittenberger. The profile of unlabeled trees. 2005 International Conference on Analysis of Algorithms, 2005, Barcelona, Spain. pp.167-172, ⟨10.46298/dmtcs.3352⟩. ⟨hal-01184024⟩

Collections

TDS-MACS
49 Consultations
480 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More