Related papers: Convergence of the pruning processes of stable Gal…
In [Aldous,Pitman,1998] a tree-valued Markov chain is derived by pruning off more and more subtrees along the edges of a Galton-Watson tree. More recently, in [Abraham,Delmas,2012], a continuous analogue of the tree-valued pruning dynamics…
Pruning processes $(\mathcal{F}(\theta),\theta\geq 0)$ have been studied separately for Galton-Watson trees and for L\'evy trees/forests. We establish here a limit theory that strongly connects the two studies. This solves an open problem…
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 represents the genealogy of the nested connected components…
In this work, we study asymptotics of multitype Galton-Watson trees with finitely many types. We consider critical and irreducible offspring distributions such that they belong to the domain of attraction of a stable law, where the…
We present a new pruning procedure on discrete trees by adding marks on the nodes of trees. This procedure allows us to construct and study a tree-valued Markov process $\{{\cal G}(u)\}$ by pruning Galton-Watson trees and an analogous…
We study the pruning process developed by Abraham and Delmas (2012) on the discrete Galton-Watson sub-trees of the L\'{e}vy tree which are obtained by considering the minimal sub-tree connecting the root and leaves chosen uniformly at rate…
We introduce the notion of a hereditary property for rooted real trees and we also consider reduction of trees by a given hereditary property. Leaf-length erasure, also called trimming, is included as a special case of hereditary reduction.…
We give a realization of the stable L\'evy forest of a given size conditioned by its mass from the path of the unconditioned forest. Then, we prove an invariance principle for this conditioned forest by considering $k$ independent…
We study fine properties of L\'evy trees that are random compact metric spaces introduced by Le Gall and Le Jan in 1998 as the genealogy of continuous state branching processes. L\'evy trees are the scaling limits of Galton-Watson trees and…
In Athreya, L\"ohr, Winter (2016), an invariance principle is stated for a class of strong Markov processes on tree-like metric measure spaces. It is shown that if the underlying spaces converge Gromov vaguely, then the processes converge…
We consider a random walk on a Galton-Watson tree whose offspring distribution has a regular varying tail of order $\kappa\in (1,2)$. We prove the convergence of the renormalised height function of the walk towards the continuous-time…
Aldous, Evans and Pitman (1998) studied the behavior of the fragmentation process derived from deleting the edges of a uniform random tree on $n$ labelled vertices. In particular, they showed that, after proper rescaling, the above…
We investigate the random continuous trees called L\'evy trees, which are obtained as scaling limits of discrete Galton-Watson trees. We give a mathematically precise definition of these random trees as random variables taking values in the…
We investigate the genealogical structure of general critical or subcritical continuous-state branching processes. Analogously to the coding of a discrete tree by its contour function, this genealogical structure is coded by a real-valued…
We establish sufficient mild conditions for a sequence of multitype Bienaym\'e-Galton-Watson trees, conditioned in some sense to be large, to converge to a limiting compact metric space which we call a \emph{multitype L\'{e}vy tree}. More…
We study self-similarity in random binary rooted trees. In a well-understood case of Galton-Watson trees, a distribution on a space of trees is said to be self-similar if it is invariant with respect to the operation of pruning, which cuts…
We construct random locally compact real trees called Levy trees that are the genealogical trees associated with continuous-state branching processes. More precisely, we define a growing family of discrete Galton-Watson trees with i.i.d.…
We consider a random walk on a Galton-Watson tree in random environment, in the subdiffusive case. We prove the convergence of the renormalised height function of the walk towards the continuous-time height process of a spectrally positive…
Consider the edge-deletion process in which the edges of some finite tree T are removed one after the other in the uniform random order. Roughly speaking, the cut-tree then describes the genealogy of connected components appearing in this…
We study the long-term behavior of weighted multi-type branching processes, focusing on extending classical laws of large numbers and martingale convergence to settings with infinitely many weighted particles, arbitrary type spaces and…