From the 1 of 9 linked papers with an AI index.
9 papers
Optimal root recovery for uniform attachment trees and -regular growing trees
Louigi Addario-Berry, Catherine Fontaine, Robin Khanfir +2
The paper studies algorithms that locate the root of random trees grown by uniform attachment, showing that an optimal method can identify a small set of candidate nodes whose size…
Scaling limit of the range of tree-valued branching random walks in random environmen
Thomas Duquesne, Robin Khanfir
We study a branching random walk (BRW) taking its values in a random tree $\bT$ (seen as a family tree) with an infinite line of ancestors that is a variant of a supercritical Galt…
Does freezing impede the growth of random recursive trees?
Anna Brandenberger, Simon Briend, Hannah Cairns +2
Uniform attachment with freezing is an extension of the classical model of random recursive trees, in which trees are recursively built by attaching new vertices to old ones. In th…
The largest common subtree of two random trees
Omer Angel, Caelan Atamanchuk, Anna Brandenberger +2
We study the size and structure of the largest common subtree (LCS) between two independent Bienaymé trees conditioned to have size . When the trees are critical with finite $2…
Flimsy Spaces
Robin Khanfir, Béranger Seguin
We study -flimsy spaces, which are the topological spaces that remain connected when removing fewer than points but become disconnected when removing exactly points. We…
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…