3 papers
math.PR2024
Tight universal bounds on the height times the width of random trees
Serte Donderwinkel, Robin Khanfir
We obtain assumption-free, non-asymptotic, uniform bounds on the product of the height and the width of uniformly random trees with a given degree sequence, conditioned Bienaymé tr…
math.CO2024
Refined Horton-Strahler numbers I: a discrete bijection
Louigi Addario-Berry, Marie Albenque, Serte Donderwinkel +1
The Horton-Strahler number of a rooted tree is the height of the tallest complete binary tree that can be homeomorphically embedded in . The number of full binary trees with…
math.PR2024
Random friend trees
Louigi Addario Berry, Simon Briend, Luc Devroye +3
We study a random recursive tree model featuring complete redirection called the random friend tree and introduced by Saramäki and Kaski. Vertices are attached in a sequential mann…