Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Strict monotonic trees arising from evolutionary processes: combinatorial and probabilistic study

Abstract : In this paper we introduce three new models of labelled random trees that generalise the original unlabelled Schröder tree. Our new models can be seen as models for phylogenetic trees in which nodes represent species and labels encode the order of appearance of these species, and thus the chronology of evolution. One important feature of our trees is that they can be generated efficiently thanks to a dynamical, recursive construction. Our first model is an increasing tree in the classical sense (labels increase along each branch of the tree and each label appears only once). To better model phylogenetic trees, we relax the rules of labelling by, e.g., allowing repetitions in the two other models. For each of the three models, we provide asymptotic theorems for different characteristics of the tree (e.g. degree of the root, degree distribution, height, etc), thus giving extensive information about the typical shapes of these trees. We also provide efficient algorithms to generate large trees efficiently in the three models. The proofs are based on a combination of analytic combinatorics, probabilistic methods, and bijective methods (we exhibit bijections between our models and well-known models of the literature such as permutations and Stirling numbers of both kinds).
Complete list of metadatas

Cited literature [38 references]  Display  Hide  Download
Contributor : Antoine Genitrini <>
Submitted on : Thursday, June 11, 2020 - 3:31:31 PM
Last modification on : Sunday, June 14, 2020 - 3:23:38 AM


Files produced by the author(s)


  • HAL Id : hal-02865198, version 1


Olivier Bodini, Antoine Genitrini, Cécile Mailler, Mehdi Naima. Strict monotonic trees arising from evolutionary processes: combinatorial and probabilistic study. 2020. ⟨hal-02865198⟩



Record views


Files downloads