Related papers: Growth of Levy trees
We present a construction of a L\'evy continuum random tree (CRT) associated with a super-critical continuous state branching process using the so-called exploration process and a Girsanov's theorem. We also extend the pruning procedure to…
In this paper we discuss Hausdorff and packing measures of random continuous trees called stable trees. Stable trees form a specific class of L\'evy trees (introduced by Le Gall and Le Jan in 1998) that contains Aldous's continuum random…
Combinatorial Levy processes evolve on general state spaces of countable combinatorial structures. In this setting, the usual Levy process properties of stationary, independent increments are defined in an unconventional way in terms of the…
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…
We study the growth of a time-ordered rooted tree by probabilistic attachment of new vertices to leaves. We construct a likelihood function of the leaves based on the connectivity of the tree. We take such connectivity to be induced by the…
The controlled branching process is a generalization of the classical Bienaym\'e-Galton-Watson branching process. It is a useful model for describing the evolution of populations in which the population size at each generation needs to be…
We study the genealogy of a sample of $k$ individuals taken uniformly without replacement from a continuous-time multitype Bienaym\'e--Galton--Watson process at fixed times. Our results are quite general, requiring only that the process be…
We introduce a new, relatively simple, line-breaking construction of the $\alpha$-stable tree which realises its random finite-dimensional distributions. This is a direct analogue of Aldous' line-breaking construction of the Brownian…
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…
We generalize recent results of Haas and Miermont to obtain scaling limits of Markov branching trees whose size is specified by the number of nodes whose out-degree lies in a given set. We then show that this implies that the scaling limit…
We show that the local limit of unicellular maps whose genus is proportional to the number of edges is a supercritical geometric Galton-Watson tree conditioned to survive. The proof relies on enumeration results obtained via the recent…
The aim of this paper is to develop a method for proving almost sure convergence in Gromov-Hausodorff-Prokhorov topology for a class of models of growing random graphs that generalises R\'emy's algorithm for binary trees. We describe the…
Rooted, weighted continuum random trees are used to describe limits of sequences of random discrete trees. Formally, they are random quadruples $(\mathcal{T},d,r,p)$, where $(\mathcal{T},d)$ is a tree-like metric space, $r\in\mathcal{T}$ is…
Consider a branching Markov process with values in some general type space. Conditional on survival up to generation $N$, the genealogy of the extant population defines a random marked metric measure space, where individuals are marked by…
Invariant Galton-Watson (IGW) tree measures is a one-parameter family of critical Galton-Watson measures invariant with respect to a large class of tree reduction operations. Such operations include the generalized dynamical pruning (also…
We call a random point measure infinitely ramified if for every $n\in \mathbb N$, it has the same distribution as the $n$-th generation of some branching random walk. On the other hand, branching L\'evy processes model the evolution of a…
Estimation methods for the L\'{e}vy density of a L\'{e}vy process are developed under mild qualitative assumptions. A classical model selection approach made up of two steps is studied. The first step consists in the selection of a good…
Given any regularly varying dislocation measure, we identify a natural self-similar fragmentation tree as scaling limit of discrete fragmentation trees with unit edge lengths. As an application, we obtain continuum random tree limits of…
Consider a population where individuals give birth at constant rate during their lifetimes to i.i.d. copies of themselves. Individuals bear clonally inherited types, but (neutral) mutations may happen at the birth events. The smallest…
In the critical beta-splitting model of a random $n$-leaf rooted tree, clades are recursively split into sub-clades, and a clade of $m$ leaves is split into sub-clades containing $i$ and $m-i$ leaves with probabilities $\propto 1/(i(m-i))$.…