Related papers: Pruning a L\'evy continuum random tree
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,…
We introduce a general algorithm for the computation of the scale functions of a spectrally negative L\'evy process $X$, based on a natural weak approximation of $X$ via upwards skip-free continuous-time Markov chains with stationary…
We discuss several connections between discrete and continuous random trees. In the discrete setting, we focus on Galton-Watson trees under various conditionings. In particular, we present a simple approach to Aldous' theorem giving the…
Random-cluster measures on infinite regular trees are studied in conjunction with a general type of `boundary condition', namely an equivalence relation on the set of infinite paths of the tree. The uniqueness and non-uniqueness of…
We provide a simple algorithm for construction of Brownian paths approximating those of a L\'evy process on a finite time interval. It requires knowledge of the L\'evy process trajectory on a chosen regular grid and the law of its endpoint,…
R\'emy's algorithm is a Markov chain that iteratively generates a sequence of random trees in such a way that the $n^{\mathrm{th}}$ tree is uniformly distributed over the set of rooted, planar, binary trees with $2n+1$ vertices. We obtain a…
We consider a supercritical branching process and define a contact tracing mechanism on its genealogical tree. We calculate the growth rate of the post tracing process, and give conditions under which the tracing is strong enough to drive…
The spectral theory of random walks on networks of arbitrary topology can be readily extended to study random walks and L\'evy flights subject to resetting on these structures. When a discrete-time process is stochastically brought back…
We give an explicit construction of the increasing tree-valued process introduced by Abraham and Delmas using a random point process of trees and a grafting procedure. This random point process will be used in companion papers to study…
In this work, we give a description of all sigma-finite measures on the space of rooted compact real trees which satisfy a certain regenerative property. We show that any infinite measure which satisfies the regenerative property is the…
We consider a class of L\'evy-type processes on which spectral analysis technics can be made to produce optimal results, in particular for the decay rate of their survival probability and for the spectral gap of their ground state…
Motivated by classical considerations from risk theory, we investigate boundary crossing problems for refracted L\'evy processes. The latter is a L\'evy process whose dynamics change by subtracting off a fixed linear drift (of suitable…
We consider the following Markovian dynamic on point processes: at constant rate and with equal probability, either the rightmost atom of the current configuration is removed, or a new atom is added at a random distance from the rightmost…
We study a linear-fractional Bienaym\'e-Galton-Watson process with a general type space. The corresponding tree contour process is described by an alternating random walk with the downward jumps having a geometric distribution. This leads…
By considering a continuous pruning procedure on Aldous's Brownian tree, we construct a random variable $\Theta$ which is distributed, conditionally given the tree, according to the probability law introduced by Janson as the limit…
This work employs some techniques in order to filter random noise from the information provided by minimum spanning trees obtained from the correlation matrices of international stock market indices prior to and during times of crisis. The…
This paper is a variation on the uniform spanning tree theme. We use random spanning forests to solve the following problem: for a Markov process on a finite set of size $n$, find a probability law on the subsets of any given size $m \leq…
We discuss subordination of random compact R-trees. We focus on the case of the Brownian tree, where the subordination function is given by the past maximum process of Brownian motion indexed by the tree. In that particular case, the…
We study branching random walks on Cayley graphs. A first result is that the trace of a transient branching random walk on a Cayley graph is a.s. transient for the simple random walk. In addition, it has a.s. critical percolation…
A continuous Markovian model for truncated Levy random walks is proposed. It generalizes the approach developed previously by Lubashevsky et al. Phys. Rev. E 79, 011110 (2009); 80, 031148 (2009), Eur. Phys. J. B 78, 207 (2010) allowing for…