Related papers: Hereditary tree growth and Levy forests
We consider linear preferential attachment random trees with additive fitness, where fitness is defined as the random initial vertex attractiveness. We show that when the fitness distribution has positive bounded support, the weak local…
The Horton-Strahler number -- also called the register function -- is a combinatorial tool that quantifies the branching complexity of a rooted tree. We study the law of the Horton-Strahler number of stable Galton-Watson trees conditioned…
We consider a branching model in discrete time where each individual has a trait in some general state space. Both the reproduction law and the trait inherited by the offsprings may depend on the trait of the mother and the environment. We…
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.…
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 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…
Continuous-time branching processes describe the evolution of a population whose individuals generate a random number of children according to a birth process. Such branching processes can be used to understand preferential attachment…
We consider a generalized Derrida-Retaux model on a Galton-Watson tree with a geometric offspring distribution. For a class of recursive systems, including the Derrida-Retaux model with either a geometric or exponential initial…
We consider critical percolation on a supercritical Galton-Watson tree. We show that, when the offspring distribution is in the domain of attraction of an $\alpha$-stable law for some $\alpha \in (1,2)$, or has finite variance, several…
We show that an infinite Galton-Watson tree, conditioned on its martingale limit being smaller than $\eps$, converges as $\eps\downarrow 0$ in law to the regular $\mu$-ary tree, where $\mu$ is the essential minimum of the offspring…
A branching process in random environment $(Z_n, n \in \N)$ is a generalization of Galton Watson processes where at each generation the reproduction law is picked randomly. In this paper we give several results which belong to the class of…
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…
Reinforced Galton--Watson processes describe the dynamics of a population where reproduction events are reinforced, in the sense that offspring numbers of forebears can be repeated randomly by descendants. More specifically, the evolution…
Fix $n\in\mathbb{N}$. Let $\mathbf{T}_n$ be the set of rooted trees $(T,o)$ whose vertices are labeled by elements of $\{1,...,n\}$. Let $\nu$ be a strongly connected multi-type Galton-Watson measure. We give necessary and sufficient…
We study the limiting behavior of a Bienayme-Galton-Watson tree conditioned to have a large number of vertices and either a fixed number of leaves or a fixed number of internal nodes. The first biconditioning gives a universal result with…
Tree-structured data naturally appear in various fields, particularly in biology where plants and blood vessels may be described by trees, but also in computer science because XML documents form a tree structure. This paper is devoted to…
We are interested in the genealogical structure of alleles for a Bienaym\'e-Galton-Watson branching process with neutral mutations (infinite alleles model), in the situation where the initial population is large and the mutation rate small.…
We consider branching random walks and contact processes on infinite, connected, locally finite graphs whose reproduction and infectivity rates across edges are inversely proportional to vertex degree. We show that when the ambient graph is…
We show a central limit theorem for random walk on a Galton-Watson tree, when the edges of the tree are assigned randomly uniformly elliptic conductances. When a positive fraction of edges is assigned a small conductance $\varepsilon$, we…
We show that an algorithmic construction of sequences of recursive trees leads to a direct proof of the convergence of random recursive trees in an associated Doob-Martin compactification; it also gives a representation of the limit in…