Bernhard Gittenberger - The profile of unlabeled trees

dmtcs:3352 - Discrete Mathematics & Theoretical Computer Science, January 1, 2005, DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms -
The profile of unlabeled trees

Authors: Bernhard Gittenberger 1

  • 1 Institut für Diskrete Mathematik und Geometrie [Wien]

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.

Volume: DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms
Section: Proceedings
Published on: January 1, 2005
Imported on: May 10, 2017
Keywords: local time,unlabeled trees,profile,Brownian excursion,[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG],[INFO.INFO-HC] Computer Science [cs]/Human-Computer Interaction [cs.HC]
    Source : OpenAIRE Graph
  • Automatic Expansion of Generating Functions; Funder: Austrian Science Fund (FWF); Code: P 16053

Linked publications - datasets - softwares

Source : ScholeXplorer IsRelatedTo ARXIV 0807.2365
Source : ScholeXplorer IsRelatedTo DOI 10.46298/dmtcs.3559
Source : ScholeXplorer IsRelatedTo DOI 10.48550/arxiv.0807.2365
  • 10.48550/arxiv.0807.2365
  • 0807.2365
  • 10.46298/dmtcs.3559
  • 10.46298/dmtcs.3559
The height of random binary unlabelled trees

Consultation statistics

This page has been seen 174 times.
This article's PDF has been downloaded 144 times.