Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics
- 88 Downloads
There exists a wealth of literature concerning families of increasing trees, particularly suitable for representing the evolution of either data structures in computer science, or probabilistic urns in mathematics, but are also adapted to model evolutionary trees in biology. The classical notion of increasing trees corresponds to labeled trees such that, along paths from the root to any leaf, node labels are strictly increasing; in addition nodes have distinct labels. In this paper we introduce new families of increasingly labeled trees relaxing the constraint of unicity of each label. Such models are especially useful to characterize processes evolving in discrete time whose nodes evolve simultaneously. In particular, we obtain growth processes for biology much more adequate than the previous increasing models. The families of monotonic trees we introduce are much more delicate to deal with, since they are not decomposable in the sense of Analytic Combinatorics. New tools are required to study the quantitative statistics of such families. In this paper, we first present a way to combinatorially specify such families through evolution processes, then, we study the tree enumerations.
KeywordsAnalytic Combinatorics Asymptotic enumeration Increasing trees Monotonic trees Borel transform Evolution process
We thank Stephan Wagner for a fruitful discussion about the relationship of an involved proof of this paper and the article . Furthermore we are grateful for the anonymous reviewers whose comments and suggestions helped improving and clarifying this manuscript.
- 4.Bodini, O., Genitrini, A., Gittenberger, B., Wagner, S.: On the number of increasing trees with label repetitions. Discrete Math. (2019, in press). https://doi.org/10.1016/j.disc.2019.111722
- 5.Bodini, O., Genitrini, A., Naima, M.: Ranked Schröder trees. In: 2019 Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO), pp. 13–26. SIAM (2019)Google Scholar
- 8.Genitrini, A., Gittenberger, B., Kauers, M., Wallner, M.: Asymptotic enumeration of compacted binary trees of bounded right height. J. Comb. Theory Ser. A 172 (2020). https://doi.org/10.1016/j.jcta.2019.105177
- 11.Mendez, M.A.: Combinatorial differential operators in: Faa di Bruno formula, enumeration of ballot paths, enriched rooted trees and increasing rooted trees. Technical report. arXiv:1610.03602 [math.CO], Cornell University (2016)
- 12.Morris, K.: On parameters in monotonically labelled trees. In: Drmota, M., Flajolet, P., Gardy, D., Gittenberger, B. (eds.) Mathematics and Computer Science III, pp. 261–263. Birkhäuser Basel (2004)Google Scholar
- 13.Morris, K.: Contributions to the analysis of increasing trees and other families of trees. Ph.D. thesis, University of the Witwatersrand, Johannesburg, South Africa (2005)Google Scholar
- 16.Wasow, W.: Asymptotic Expansions for Ordinary Differential Equations. Pure and Applied Mathematics, Vol. XIV, Interscience Publishers Wiley, New York (1965)Google Scholar