Related papers: Growth of the Brownian forest
We revisit the problem of Brownian diffusion with drift in order to study finite-size effects in the geometric Galton-Watson branching process. This is possible because of an exact mapping between one-dimensional random walks and geometric…
This paper studies Brownian motion subject to the occurrence of a minimal length excursion below a given excursion level. The law of this process is determined. The characterization is explicit and shows by a layer construction how the law…
We consider the model of Brownian motion indexed by the Brownian tree. For every $r\geq 0$ and every connected component of the set of points where Brownian motion is greater than $r$, we define the boundary size of this component, and we…
We develop an excursion theory for Brownian motion indexed by the Brownian tree, which in many respects is analogous to the classical It\^o theory for linear Brownian motion. Each excursion is associated with a connected component of the…
In this article it is shown that the Brownian motion on the continuum random tree is the scaling limit of the simple random walks on any family of discrete $n$-vertex ordered graph trees whose search-depth functions converge to the Brownian…
The aim of this article is to present a growth-fragmentation process naturally embedded in a Brownian excursion from boundary to apex in a cone of angle $2\pi/3$. This growth-fragmentation process corresponds, via the so-called…
We introduce a certain class of 2-type Galton-Watson trees with edge lengths. We prove that, after an adequate rescaling, the weighted height function of a forest of such trees converges in law to the reflected Brownian motion. We then use…
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…
We provide simplified proofs for the asymptotic distribution of the number of cuts required to cut down a Galton-Watson tree with critical, finite-variance offspring distribution, conditioned to have total progeny $n$. Our proof is based on…
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 give a proof of a result on the growth of the number of particles along chosen paths in a branching Brownian motion. The work follows the approach of classical large deviations results, in which paths in $C[0,1]$ are rescaled onto…
We consider processes which have the distribution of standard Brownian motion (in the forward direction of time) starting from random points on the trajectory which accumulate at $-\infty$. We show that these processes do not have to have…
This paper introduces a new combinatorial framework for modeling the growth of binary trees through a discrete evolution process that incorporates a growing rule and an extinction rule. Building upon the theory of increasingly labeled…
The real trees form a class of metric spaces that extends the class of trees with edge lengths by allowing behavior such as infinite total edge length and vertices with infinite branching degree. We use Dirichlet form methods to construct…
Upon almost-every realisation of the Brownian continuum random tree (CRT), it is possible to define a canonical diffusion process or `Brownian motion'. The main result of this article establishes that the cover time of the Brownian motion…
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 study the evolution of a particle system whose genealogy is given by a supercritical continuous time Galton--Watson tree. The particles move independently according to a Markov process and when a branching event occurs, the offspring…
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 consider a family of random trees satisfying a Markov branching property. Roughly, this property says that the subtrees above some given height are independent with a law that depends only on their total size, the latter being either the…
We consider the motion of a particle on a Galton Watson tree, when the probabilities of jumping from a vertex to any one of its neighbours is determined by a random process. Given the tree, positive weights are assigned to the edges in such…