1 citations · 2 across the 12 of their papers we have counts for
13 papers
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…
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 …
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…
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…
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…
The Horton-Strahler number of Galton-Watson trees with possibly infinite variance
Robin Khanfir
The Horton-Strahler number, also known as the register function, provides a tool for quantifying the branching complexity of a rooted tree. We consider the Horton-Strahler number o…
Study of a division-like property
Robin Khanfir, Béranger Seguin
We introduce a weak division-like property for noncommutative rings: a nontrivial ring is fadelian if for all nonzero there exist such that . We prove properti…
Convergences of looptrees coded by excursions
Robin Khanfir
In order to study convergences of looptrees, we construct continuum trees and looptrees from real-valued càdlàg functions without negative jumps called excursions. We then provide…
Scaling limits of tree-valued branching random walks
Thomas Duquesne, Robin Khanfir, Shen Lin +1
We consider a branching random walk (BRW) taking its values in the -ary rooted tree (i.e. the set of finite words written in the alphabet $\{…
Time and place of the maximum for one-dimensional diffusion bridges and meanders
Robin Khanfir
For three constrained Brownian motions, the excursion, the meander, and the reflected bridge, the densities of the maximum and of the time to reach it were expressed as double seri…