Fringe analysis of plane trees related to cutting and pruning

Rooted plane trees are reduced by four different operations on the fringe. The number of surviving nodes after reducing the tree repeatedly for a fixed number of times is asymptotically analyzed. The four different operations include cutting all or only the leftmost leaves or maximal paths. This generalizes the concept of pruning a tree. The results include exact expressions and asymptotic expansions for the expected value and the variance as well as central limit theorems.

[1]  Philippe Flajolet,et al.  The Average Height of Binary Trees and Other Simple Trees , 1982, J. Comput. Syst. Sci..

[2]  Helmut Prodinger,et al.  Reductions of binary trees and lattice paths induced by the register function , 2016, Theor. Comput. Sci..

[3]  A. Meir,et al.  Cutting down random trees , 1970, Journal of the Australian Mathematical Society.

[4]  Edmund Taylor Whittaker,et al.  A Course of Modern Analysis , 2021 .

[5]  Philippe Flajolet,et al.  The Number of Registers Required for Evaluating Arithmetic Expressions , 1979, Theor. Comput. Sci..

[6]  Svante Janson,et al.  Asymptotic normality of fringe subtrees and additive functionals in conditioned Galton–Watson trees , 2013, Random Struct. Algorithms.

[7]  Helmut Prodinger,et al.  Iterative Cutting and Pruning of Planar Trees , 2017, ANALCO.

[8]  Philippe Flajolet,et al.  Analytic Combinatorics , 2009 .

[9]  Philippe Flajolet,et al.  Singularity Analysis of Generating Functions , 1990, SIAM J. Discret. Math..

[10]  STEPHAN WAGNER,et al.  Central Limit Theorems for Additive Tree Parameters with Small Toll Functions , 2014, Combinatorics, Probability and Computing.

[11]  Hsien-Kuei Hwang,et al.  On Convergence Rates in the Central Limit Theorems for Combinatorial Structures , 1998, Eur. J. Comb..

[12]  P. Flajolet,et al.  Analytic Combinatorics: RANDOM STRUCTURES , 2009 .

[13]  Xavier Gérard Viennot.  A Strahler bijection between Dyck paths and planar trees , 2002, Discret. Math..

[14]  Rainer Kemp,et al.  A note on the stack size of regularly distributed binary trees , 1980, BIT.

[15]  H. Prodinger.  THE HEIGHT OF PLANTED PLANE TREES REVISITED , 2022 .

[16]  Alois Panholzer,et al.  Cutting down very simple trees , 2006 .

[17]  Higher dimensional quasi-power theorem and Berry–Esseen inequality , 2016, Monatshefte für Mathematik.

[18]  Doron Zeilberger.  A bijection from ordered trees to binary trees that sends the pruning order to the strahler number , 1990, Discret. Math..

[19]  William Y. C. Chen,et al.  Old and young leaves on plane trees , 2006, Eur. J. Comb..

[20]  Svante Janson,et al.  Random cutting and records in deterministic and random trees , 2006, Random Struct. Algorithms.

[21]  de Ng Dick Bruijn,et al.  THE AVERAGE HEIGHT OF PLANTED PLANE TREES , 1972 .

[22]  Helmut Prodinger,et al.  Further Results on Digital Search Trees , 1988, Theor. Comput. Sci..