Related papers: A continuum-tree-valued Markov process
Given a general critical or sub-critical branching mechanism, we define a pruning procedure of the associated L\'evy continuum random tree. This pruning procedure is defined by adding some marks on the tree, using L\'evy snake techniques.…
By studying an admissible family of branching mechanisms introduced in Li (2014), we obtain a pruning procedure on L\'evy trees. Then we could construct a decreasing L\'evy-CRT-valued process $\{{\mathcal T}_t\}$ by pruning L\'evy trees and…
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 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 consider the exploration process associated to the continuous random tree (CRT) built using a Levy process with no negative jumps. This process has been studied by Duquesne, Le Gall and Le Jan. This measure-valued Markov process is a…
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 prove an invariance principle for a general class of continuous time critical branching processes with finite variance (non-local) branching mechanism. We show that the genealogical trees, viewed as random compact metric measure spaces,…
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…
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 introduce a general recursive method to construct continuum random trees (CRTs) from independent copies of a random string of beads, that is, any random interval equipped with a random discrete probability measure, and from related…
Recently introduced and studied in arXiv:2407.07888, a self-similar Markov tree (ssMt) is a random decorated tree that vastly generalises the fragmentation tree. We study here the critical case that was left aside in arXiv:2407.07888.…
We introduce an algorithm for generating a random sequence of fragmentation trees, which we call the ancestral branching algorithm. This algorithm builds on the recursive partitioning structure of a tree and gives rise to an associated…
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…
Here, we study the long-term behaviour of the non-explosion probability for continuous-state branching processes in a L\'evy environment when the branching mechanism is given by the negative of the Laplace exponent of a subordinator. In…
Splitting trees are those random trees where individuals give birth at constant rate during a lifetime with general distribution, to i.i.d. copies of themselves. The width process of a splitting tree is then a binary, homogeneous…
In this manuscript, we continue with the systematic study of the speed of extinction of continuous state branching processes in L\'evy environments under more general branching mechanisms. Here, we deal with the weakly subcritical regime…
Can we obtain a Brownian CRT of mass $1/2$ from a CRT of mass $1$ by cutting certain branches? In this paper, we will answer that question in the much more general setting of self-similar Markov trees. Self-similar Markov trees (ssMt) are…
In this paper, we consider a class of generalized continuous-state branching processes obtained by Lamperti type time changes of spectrally positive L\'evy processes using different rate functions. When explosion occurs to such a process,…
We survey recent developments about random real trees, whose prototype is the Continuum Random Tree (CRT) introduced by Aldous in 1991. We briefly explain the formalism of real trees, which yields a neat presentation of the theory and in…