Reducing Simply Generated Trees by Iterative Leaf Cutting
Combinatorics
2019-11-11 v1
Abstract
We consider a procedure to reduce simply generated trees by iteratively removing all leaves. In the context of this reduction, we study the number of vertices that are deleted after applying this procedure a fixed number of times by using an additive tree parameter model combined with a recursive characterization. Our results include asymptotic formulas for mean and variance of this quantity as well as a central limit theorem.
Keywords
Cite
@article{arxiv.1808.00363,
title = {Reducing Simply Generated Trees by Iterative Leaf Cutting},
author = {Benjamin Hackl and Clemens Heuberger and Stephan Wagner},
journal= {arXiv preprint arXiv:1808.00363},
year = {2019}
}
Comments
extended abstract