We provide simplified proofs for the asymptotic distribution of the number of cuts required to
cut down a Galton–Watson tree with critical, finite-variance offspring distribution, conditioned …

We consider a fragmentation of discrete trees where the internal vertices are deleted
independently at a rate proportional to their degree. Informally, the associated cut-tree …

Representation of coalescent process using pruning of trees has been used by Goldschmidt
and Martin for the Bolthausen-Sznitman coalescent and by Abraham and Delmas for the …

We study a fragmentation of the p-trees of Camarri and Pitman. We give exact
correspondences between the p-trees and trees which encode the fragmentation. We then …

We consider a pruning of the inhomogeneous continuum random trees, as well as the cut
trees that encode the genealogies of the fragmentations that come with the pruning. We …

We consider fragmentations of an R-tree T driven by cuts arriving according to a Poisson
process on T*0,∞), where the first co-ordinate specifies the location of the cut and the …

By considering a continuous pruning procedure on Aldous's Brownian tree, we construct a
random variable $\Theta $ which is distributed, conditionally given the tree, according to the …

We introduce the problem of isolating several nodes in random recursive trees by
successively removing random edges, and study the number of random cuts that are …

Additive tree functionals allow to represent the cost of many divide-and-conquer algorithms.
We give an invariance principle for such tree functionals for the Catalan model (random tree …

We give an invariance principle for very general additive functionals of conditioned
Bienaymé-Galton-Watson trees in the global regime when the offspring distribution lies in …