Abstract. A Lévy forest of size s> 0 is a Poisson point process in the set of Lévy trees which is defined on the time interval [0, s]. The total mass of this forest is defined by the sum of the masses of all its trees. We give a realization of the stable Lévy forest of a given size conditioned on its total mass using the path of the uncon-ditioned forest. Then, we prove an invariance principle for this conditioned forest by considering k independent Galton-Watson trees whose offspring distribution is in the domain of attraction of any stable law conditioned on their total progeny to be equal to n. We prove that when n and k tend towards +∞, under suitable rescaling, the associated coding random walk, the contour and height processes a...
We define decorated $\alpha$-stable trees which are informally obtained from an $\alpha$-stable tree...
ESAIM: Probability and Statistics, 2014International audienceWe consider branching processes with in...
Abstract. By extending the breadth first search algorithm to any d-type critical or subcritical irre...
A Lévy forest of size s > 0 is a Poisson point process in the set of Lévytrees which is defined o...
The purpose of this thesis is to study random walks on “decorated” Galton-Watson trees with critical...
In this work, we are interested in Growth of Galton-Watson trees under two different models: (1) Gal...
We construct random locally compact real trees called Levy trees that are the genealogical trees ass...
Trees in Brownian excursions have been studied since the late 1980s. Forests in excursions of Browni...
Scaling limits of large random trees play an important role in this thesis. We are more precisely in...
International audienceCrump-Mode-Jagers (CMJ) trees generalize Galton-Watson trees by allowing indiv...
We introduce the notion of a hereditary property for rooted real trees and we also consider reductio...
We establish a variety of properties of the discrete time simple random walk on a Galton-Watson tree...
We show that an infinite Galton-Watson tree, conditioned on its martingale limit being smaller than ...
We study exchangeable coalescent trees and the evolving genealogical trees in models for neutral hap...
Lecture given in Hammamet, December 2014.The main object of this course given in Hammamet (December ...
We define decorated $\alpha$-stable trees which are informally obtained from an $\alpha$-stable tree...
ESAIM: Probability and Statistics, 2014International audienceWe consider branching processes with in...
Abstract. By extending the breadth first search algorithm to any d-type critical or subcritical irre...
A Lévy forest of size s > 0 is a Poisson point process in the set of Lévytrees which is defined o...
The purpose of this thesis is to study random walks on “decorated” Galton-Watson trees with critical...
In this work, we are interested in Growth of Galton-Watson trees under two different models: (1) Gal...
We construct random locally compact real trees called Levy trees that are the genealogical trees ass...
Trees in Brownian excursions have been studied since the late 1980s. Forests in excursions of Browni...
Scaling limits of large random trees play an important role in this thesis. We are more precisely in...
International audienceCrump-Mode-Jagers (CMJ) trees generalize Galton-Watson trees by allowing indiv...
We introduce the notion of a hereditary property for rooted real trees and we also consider reductio...
We establish a variety of properties of the discrete time simple random walk on a Galton-Watson tree...
We show that an infinite Galton-Watson tree, conditioned on its martingale limit being smaller than ...
We study exchangeable coalescent trees and the evolving genealogical trees in models for neutral hap...
Lecture given in Hammamet, December 2014.The main object of this course given in Hammamet (December ...
We define decorated $\alpha$-stable trees which are informally obtained from an $\alpha$-stable tree...
ESAIM: Probability and Statistics, 2014International audienceWe consider branching processes with in...
Abstract. By extending the breadth first search algorithm to any d-type critical or subcritical irre...