Additive tree functionals with small toll functions and subtrees of random trees - Archive ouverte HAL Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2012

Additive tree functionals with small toll functions and subtrees of random trees

Abstract

Many parameters of trees are additive in the sense that they can be computed recursively from the sum of the branches plus a certain toll function. For instance, such parameters occur very frequently in the analysis of divide-and-conquer algorithms. Here we are interested in the situation that the toll function is small (the average over all trees of a given size $n$ decreases exponentially with $n$). We prove a general central limit theorem for random labelled trees and apply it to a number of examples. The main motivation is the study of the number of subtrees in a random labelled tree, but it also applies to classical instances such as the number of leaves.
Fichier principal
Vignette du fichier
dmAQ0106.pdf (296.25 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01197234 , version 1 (11-09-2015)

Identifiers

Cite

Stephan Wagner. Additive tree functionals with small toll functions and subtrees of random trees. 23rd International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'12), 2012, Montreal, Canada. pp.67-80, ⟨10.46298/dmtcs.2984⟩. ⟨hal-01197234⟩

Collections

TDS-MACS
99 View
685 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More