1 citations · 2 across the 12 of their papers we have counts for
4 papers · 1 filter
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…
Optimal root recovery for uniform attachment trees and -regular growing trees
Louigi Addario-Berry, Catherine Fontaine, Robin Khanfir +2
We consider root-finding algorithms for random rooted trees grown by uniform attachment. Given an unlabeled copy of the tree and a target accuracy , such an algori…
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…
Fluctuations of the Horton-Strahler number of stable Galton-Watson trees
Robin Khanfir
The Horton-Strahler number -- also called the register function -- is a combinatorial tool that quantifies the branching complexity of a rooted tree. We study the law of the Horton…