D. Aldous, Probability distributions on cladograms, Random Discrete Structures, pp.1-18, 1996.

A. Bacher, O. Bodini, H. Hwang, and T. Tsai, Generating random permutations by coin tossing: Classical algorithms, new analysis, and modern implementation, ACM Trans. Algorithms, vol.13, issue.2, 2017.

]. O. +-16, M. Bodini, X. Dien, A. Fontaine, H. Genitrini et al., Increasing Diamonds, LATIN 2016: Theoretical Informatics -12th Latin American Symposium, pp.207-219, 2016.

O. Bodini, M. Dien, A. Genitrini, and A. Viola, Beyond series-parallel concurrent systems: the case of arch processes, 29th International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, 2018.
URL : https://hal.archives-ouvertes.fr/hal-02073611

E. A. Bender, Central and local limit theorems applied to asymptotic enumeration, Journal of Combinatorial Theory, Series A, vol.15, issue.1, pp.91-111, 1973.

F. Bergeron, P. Flajolet, and B. Salvy, Varieties of increasing trees, CAAP, pp.24-48, 1992.
URL : https://hal.archives-ouvertes.fr/inria-00074977

O. Bodini, A. Genitrini, B. Gittenberger, and S. Wagner, On the number of increasing trees with label repetitions, Discrete Mathematics, vol.343, issue.8, p.111722, 2020.
URL : https://hal.archives-ouvertes.fr/hal-02554861

O. Bodini, A. Genitrini, and M. Naima, Ranked schröder trees, Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2019, pp.13-26, 2019.

O. Bodini, A. Genitrini, M. Naima, and A. Singh, Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics, 15th International Computer Science Symposium in Russia (CSR), 2020.

B. P. Buckles and M. Lybanon, Algorithm 515: Generation of a vector from the lexicographical index

, ACM Trans. Math. Softw, vol.3, issue.2, pp.180-182, 1977.

C. Bender and S. Orszag, Advanced Mathematical Methods for Scientists and Engineers: Asymptotic Methods and Perturbation Theory, vol.1, 1999.

B. Bollobás, Random Graphs. Cambridge Studies in Advanced Mathematics. Cambridge University Press, 2001.

O. Bodini, O. Roussel, and M. Soria, Boltzmann samplers for first-order differential specifications, Discrete Applied Mathematics, vol.160, issue.18, pp.2563-2572, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00641072

H. Chern, H. Hwang, and Y. Yeh, Distribution of the number of consecutive records, Random Structures & Algorithms, vol.17, issue.3-4, pp.169-196, 2000.

L. Devroye, On the height of random m-ary search trees, Random Struct. Algorithms, vol.1, issue.2, pp.191-204, 1990.

C. Donnot, A. Genitrini, and Y. Herida, Unranking combinations lexicographically: an efficient new strategy compared with others, 2020.
URL : https://hal.archives-ouvertes.fr/hal-02462764

M. Drmota, Random trees, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00001281

R. Durrett, Random Graph Dynamics. Cambridge Series in Statistical and Probabilistic Mathematics, 2006.

P. Erdös and A. Rényi, On random graphs, Publicationes mathematicae, vol.6, issue.26, pp.290-297, 1959.

P. Flajolet and R. Sedgewick, Analytic combinatorics, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00072739

P. Flajolet, P. Zimmermann, and B. Van-cutsem, A calculus for the random generation of labelled combinatorial structures, Theoretical Computer Science, vol.132, issue.1-2, pp.1-35, 1994.
URL : https://hal.archives-ouvertes.fr/hal-00917729

A. Genitrini, B. Gittenberger, M. Kauers, and M. Wallner, Asymptotic enumeration of compacted binary trees of bounded right height, Journal of Combinatorial Theory, Series A, vol.172, p.105177, 2020.
URL : https://hal.archives-ouvertes.fr/hal-02554860

E. Ñ. Gilbert, Random graphs, The Annals of Mathematical Statistics, vol.30, issue.4, pp.1141-1144, 1959.

H. Hwang, On Convergence Rates in the Central Limit Theorems for Combinatorial Structures, Eur. J. Comb, vol.19, issue.3, pp.329-343, 1998.

S. Janson, A divertent generating function that can be summed and analysed analytically, Discret. Math. Theor. Comput. Sci, vol.12, issue.2, pp.1-22, 2010.

C. Martínez and X. Molinero, Generic algorithms for the generation of combinatorial objects, 28th International Symposium on Mathematical Foundations of Computer Science (MFCS), pp.572-581, 2003.

X. Molinero, Ordered Generation of Classes of Combinatorial Structures, 2005.

J. W. Moon, The distance between nodes in recursive trees, pp.125-132, 1974.

A. Nijenhuis and H. S. Wilf, Computer science and applied mathematics, 1975.

N. Pippenger, The hypercube of resistors, asymptotic expansions, and preferential arrangements, Mathematics Magazine, vol.83, issue.5, pp.331-346, 2010.

B. Pittel, Note on the heights of random recursive trees and random m-ary search trees, Random Structures & Algorithms, vol.5, issue.2, pp.337-347, 1994.

F. Ruskey, Combinatorial generation, 2003.

E. Schröder, Vier Combinatorische Probleme, Z. Math. Phys, vol.15, pp.361-376, 1870.

M. Steel and A. Mckenzie, Properties of phylogenetic trees generated by yule-type specification models, Mathematical Biosciences, vol.170, issue.1, pp.91-112, 2001.

G. U. Yule, A mathematical theory of evolution, based on the conclusions of, Philosophical Transactions of the Royal Society of London. Series B, Containing Papers of a Biological Character, vol.213, pp.21-87, 1925.

O. Bodini and M. Naima, CNRS, UMR, vol.7030

A. Genitrini, C. Sorbonne-université, and L. D. , Informatique de Paris 6 -LIP6-UMR, vol.7606