Related papers: Pruning a L\'evy continuum random tree
A continuous-time particle system on the real line satisfying the branching property and an exponential integrability condition is called a branching L\'evy process, and its law is characterized by a triplet $(\sigma^2,a,\Lambda)$. We…
We consider linear preferential attachment trees, and show that they can be regarded as random split trees in the sense of Devroye (1999), although with infinite potential branching. In particular, this applies to the random recursive tree…
We consider the height process of a Levy process with no negative jumps, and its associated continuous tree representation. Using Levy snake tools developed by Duquesne and Le Gall, with an underlying Poisson process, we construct a…
The recurrence features of persistent random walks built from variable length Markov chains are investigated. We observe that these stochastic processes can be seen as L{\'e}vy walks for which the persistence times depend on some internal…
The natural analogue for a Levy process of Cramer's estimate for a reflected random walk is a statement about the exponential rate of decay of the tail of the characteristic measure of the height of an excursion above the minimum. We…
In many random search processes of interest in chemistry, biology or during rescue operations, an entity must find a specific target site before the latter becomes inactive, no longer available for reaction or lost. We present exact results…
We study the local convergence of critical Galton-Watson trees and Levy trees under various conditionings. Assuming a very general monotonicity property on the functional of random trees, we show that random trees conditioned to have large…
A branching L\'evy process can be seen as the continuous-time version of a branching random walk. It describes a particle system on the real line in which particles move and reproduce independently in a Poissonian manner. Just as for L\'evy…
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…
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…
Given a solution to a recursive distributional equation, a natural (and non-trivial) question is whether the corresponding recursive tree process is endogenous. That is, whether the random environment almost surely defines the tree process.…
We investigate the branching structure coded by the excursion above zero of a spectrally positive Levy process. The main idea is to identify the level of the Levy excursion as the time and count the number of jumps upcrossing the level. By…
The first part of this paper ( arXiv:1607.02114 ) introduced splitting trees, those chronological trees admitting the self-similarity property where individuals give birth, at constant rate, to iid copies of themselves. It also established…
Self-similar Markov trees constitute a remarkable family of random compact real trees carrying a decoration function that is positive on the skeleton. As the terminology suggests, they are self-similar objects that further satisfy a Markov…
We consider a generalization of a one-dimensional stochastic process known in the physical literature as L\'evy-Lorentz gas. The process describes the motion of a particle on the real line in the presence of a random array of marked points,…
We consider the problem of uniformly generating a spanning tree, of a connected undirected graph. This process is useful to compute statistics, namely for phylogenetic trees. We describe a Markov chain for producing these trees. For cycle…
A general continuous-state branching processes in random environment (CBRE-process) is defined as the strong solution of a stochastic integral equation. The environment is determined by a L\'evy process with no jump less than $-1$. We give…
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…
It has been claimed in Aldous, Miermont and Pitman [PTRF, 2004] that all L\'evy trees are mixings of inhomogeneous continuum random trees. We give a rigorous proof of this claim in the case of a stable branching mechanism, relying on a new…
We destroy a finite tree of size $n$ by cutting its edges one after the other and in uniform random order. Informally, the associated cut-tree describes the genealogy of the connected components created by this destruction process. We…