International audienceWe 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 to have total progeny n. Our proof is based on a coupling which yields a precise, non-asymptotic distributional result for the case of uniformly random rooted labeled trees (or, equivalently, Poisson Galton--Watson trees conditioned on their size). Our approach also provides a new, random reversible transformation between Brownian excursion and Brownian bridge
International audienceBy considering a continuous pruning procedure on Aldous's Brownian tree, we co...
Lecture given in Hammamet, December 2014.The main object of this course given in Hammamet (December ...
Trees are a fundamental notion in graph theory and combinatorics as well as a basic object for data ...
The k-cut number of rooted graphs was introduced by Cai et al. as a generalization of the classical ...
We consider a family of random trees satisfying a Markov branching property. Roughly, this property ...
The $k$-cut number of rooted graphs was introduced by Cai et al. as a generalization of the classica...
Here we consider two parameters for random non-crossing trees: $\textit{(i)}$ the number of random c...
We investigate scaling limits of several types of random trees. The study of scaling limits of rand...
Abstract. We study the asymptotic behavior of the number of cuts X(Tn) needed to isolate the root in...
This is an appendix to [3], and we use the notation there. In particular, if T is a rooted tree, X(T...
Abstract. We study here, by using a recursive approach, the number of random cuts that are necessary...
Description: A Galton-Watson tree with offspring distribution ξ on N = {0, 1, 2,...} is the family t...
International audienceConsider the logging process of the Brownian continuum random tree (CRT) $\cal...
The Brownian motion has played an important role in the development of probability theory and stocha...
International audienceWe present a new pruning procedure on discrete trees by adding marks on the no...
International audienceBy considering a continuous pruning procedure on Aldous's Brownian tree, we co...
Lecture given in Hammamet, December 2014.The main object of this course given in Hammamet (December ...
Trees are a fundamental notion in graph theory and combinatorics as well as a basic object for data ...
The k-cut number of rooted graphs was introduced by Cai et al. as a generalization of the classical ...
We consider a family of random trees satisfying a Markov branching property. Roughly, this property ...
The $k$-cut number of rooted graphs was introduced by Cai et al. as a generalization of the classica...
Here we consider two parameters for random non-crossing trees: $\textit{(i)}$ the number of random c...
We investigate scaling limits of several types of random trees. The study of scaling limits of rand...
Abstract. We study the asymptotic behavior of the number of cuts X(Tn) needed to isolate the root in...
This is an appendix to [3], and we use the notation there. In particular, if T is a rooted tree, X(T...
Abstract. We study here, by using a recursive approach, the number of random cuts that are necessary...
Description: A Galton-Watson tree with offspring distribution ξ on N = {0, 1, 2,...} is the family t...
International audienceConsider the logging process of the Brownian continuum random tree (CRT) $\cal...
The Brownian motion has played an important role in the development of probability theory and stocha...
International audienceWe present a new pruning procedure on discrete trees by adding marks on the no...
International audienceBy considering a continuous pruning procedure on Aldous's Brownian tree, we co...
Lecture given in Hammamet, December 2014.The main object of this course given in Hammamet (December ...
Trees are a fundamental notion in graph theory and combinatorics as well as a basic object for data ...