Related papers: Growing conditioned BGW trees with log-concave off…
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…
In a Bienaym\'{e}-Galton-Watson process for which there is a positiveprobability for individuals of having no offspring, there is a subtlebalance and dependence between the sterile nodes (the dead nodes or leaves)and the prolific ones (the…
It is known from the work of Baik, Deift, and Johansson [1999] that we have Tracy-Widom fluctuations for the longest increasing subsequence of uniform permutations. In this paper, we prove that this result holds also in the case of the…
We continue our study of the distribution of the maximal number $X^{\ast}_k$ of offsprings amongst all individuals in a critical Galton-Watson process started with $k$ ancestors, treating the case when the reproduction law has a regularly…
Take a continuous-time Galton-Watson tree. If the system survives until a large time $T$, then choose $k$ particles uniformly from those alive. What does the ancestral tree drawn out by these $k$ particles look like? Some special cases are…
We study certain consistent families $(F_\lambda)_{\lambda\ge 0}$ of Galton-Watson forests with lifetimes as edge lengths and/or immigrants as progenitors of the trees in $F_\lambda$. Specifically, consistency here refers to the property…
We characterize the sets of offspring laws on which the Lotka--Nagaev estimator for the mean of a supercritical Galton--Watson process is qualitatively robust. These are exactly the locally uniformly integrating sets of offspring laws,…
This work introduces a construction of conformal processes that combines the theory of branching processes with chordal Loewner evolution. The main novelty lies in the choice of driving measure for the Loewner evolution: given a finite…
Crump-Mode-Jagers (CMJ) trees generalize Galton-Watson trees by allowing individuals to live for an arbitrary duration and give birth at arbitrary times during their life-time. In this paper, we exhibit a simple condition under which the…
We consider large uniform random trees where we fix for each vertex its degree and height. We prove, under natural conditions of convergence for the profile, that those trees properly renormalized converge. To this end, we study the paths…
We study $\lambda$-biased branching random walks on Bienaym\'e--Galton--Watson trees in discrete time. We consider the maximal displacement at time $n$, $\max_{\vert u \vert =n} \vert X(u) \vert$, and show that it almost surely grows at a…
We study the size of the automorphism group of two different types of random trees: Galton--Watson trees and rooted P\'olya trees. In both cases, we prove that it asymptotically follows a log-normal distribution and provide asymptotic…
We prove that critical multitype Galton-Watson trees converge after rescaling to the Brownian continuum random tree, under the hypothesis that the offspring distribution has finite covariance matrices. Our study relies on an ancestral…
Consider an arbitrary large population at the present time, originated at an unspecified arbitrary large time in the past, where individuals in the same generation reproduce independently, forward in time, with the same offspring…
We consider the problem of inferring an ancestral state from observations at the leaves of a tree, assuming the state evolves along the tree according to a two-state symmetric Markov process. We establish a general branching rate condition…
Skeletons of branching processes are defined as trees of lineages characterized by an appropriate signature of future reproduction success. In the supercritical case a natural choice is to look for the lineages that survive forever. In the…
We investigate the random continuous trees called L\'evy trees, which are obtained as scaling limits of discrete Galton-Watson trees. We give a mathematically precise definition of these random trees as random variables taking values in the…
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…
As a model of trapping by biased motion in random structure, we study the time taken for a biased random walk to return to the root of a subcritical Galton-Watson tree. We do so for trees in which these biases are randomly chosen,…
We obtain new non-asymptotic tail bounds for the height of uniformly random trees with a given degree sequence, simply generated trees and conditioned Bienaym\'e trees (the family trees of branching processes), in the process settling three…