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

Olivier Bodini, Antoine Genitrini, Cecile Mailler, Mehdi Naima

Research output: Contribution to journalArticlepeer-review

2 Citations (SciVal)
71 Downloads (Pure)


In this paper we study two 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 allowing repetitions in the second model.

For each of the two 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 two 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).

It turns out that even though our models are labelled, they can be specified simply in the world of ordinary generating functions. However, the resulting generating functions will be formal. Then, by applying Borel transforms the models will be amenable to techniques of analytic combinatorics.
Original languageEnglish
Article number102284
JournalAdvances in Applied Mathematics
Early online date20 Oct 2021
Publication statusPublished - 28 Feb 2022

Bibliographical note

Funding Information:
This research is partially supported by the ANR project MetACOnc, ANR-15-CE40-0014.C. Mailler acknowledges EPSRC for support through the fellowship EP/R022186/1.

Publisher Copyright:
© 2021 Elsevier Inc.


  • Analytic Combinatorics
  • Evolution process
  • Increasing trees
  • Monotonic trees
  • Uniform sampling

ASJC Scopus subject areas

  • Applied Mathematics


Dive into the research topics of 'Strict monotonic trees arising from evolutionary processes: combinatorial and probabilistic study'. Together they form a unique fingerprint.

Cite this