The profile of unlabeled trees - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2005

The profile of unlabeled trees

Abstract

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
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

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

Identifiers

Cite

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

INSMI TDS-MACS
47 View
400 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More