The height of increasing trees
From MaRDI portal
Publication:5900175
DOI10.1002/rsa.20202zbMath1148.05024OpenAlexW4233522140MaRDI QIDQ5900175
Nicolas Broutin, Luc P. Devroye, Erin McLeish, Mikael de la Salle
Publication date: 21 July 2008
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20202
Related Items (16)
Bivariate Markov chains converging to Lamperti transform Markov additive processes ⋮ Tree limits and limits of random trees ⋮ On Tail Bounds for Random Recursive Trees ⋮ Compaction for two models of logarithmic‐depth trees: Analysis and experiments ⋮ The height of record‐biased trees ⋮ Scaling Limits of Markov-Branching Trees and Applications ⋮ Models of random subtrees of a graph ⋮ A bijection of plane increasing trees with relaxed binary trees of right height at most one ⋮ Weighted height of random trees ⋮ The height of increasing trees ⋮ The total path length of split trees ⋮ Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees ⋮ Scaling limits of multi-type Markov branching trees ⋮ Random Recursive Trees and Preferential Attachment Trees are Random Split Trees ⋮ The height of Mallows trees ⋮ Analysis of Statistics for Generalized Stirling Permutations
Cites Work
This page was built for publication: The height of increasing trees