Related papers: Invariance principles for pruning processes of Gal…
We study a genealogical model for continuous-state branching processes with immigration with a (sub)critical branching mechanism. This model allows the immigrants to be on the same line of descent. The corresponding family tree is an…
We consider the asymptotics of various estimators based on a large sample of branching trees from a critical multi-type Galton-Watson process, as the sample size increases to infinity. The asymptotics of additive functions of trees, such as…
Motivated by limits of critical inhomogeneous random graphs, we construct a family of sequences of measured metric spaces that we call continuous multiplicative graphs, that are expected to be the universal limit of graphs related to the…
We study a particular type of subcritical Galton--Watson trees, which are called non-generic trees in the physics community. In contrast with the critical or supercritical case, it is known that condensation appears in certain large…
We are interested in the biased random walk on a supercritical Galton--Watson tree in the sense of Lyons, Pemantle and Peres, and study a phenomenon of slow movement. In order to observe such a slow movement, the bias needs to be random;…
Panagiotou and Stufler recently proved an important fact on their way to establish the scaling limits of random P\'olya trees: a uniform random P\'olya tree of size $n$ consists of a conditioned critical Galton-Watson tree $C_n$ and many…
We study the convergence to equilibrium in high dimensions, focusing on explicit bounds on mixing times and the emergence of the cutoff phenomenon for Dyson-Laguerre processes. These are interacting particle systems with non-constant…
We study a random walk on a point process given by an ordered array of points $(\omega_k, \, k \in \mathbb{Z})$ on the real line. The distances $\omega_{k+1} - \omega_k$ are i.i.d. random variables in the domain of attraction of a…
We work on a Galton--Watson tree with random weights, in the so-called "subdiffusive" regime. We study the rate of decay of the conductance between the root and the $n$-th level of the tree, as $n$ goes to infinity, by a mostly analytic…
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 consider sequences of tree-valued Markov chains that describe evolving genealogies in Cannings models, and we show their convergence in distribution to tree-valued Fleming-Viot processes. Under the conditions of M\"ohle and Sagitov, this…
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 investigate Galton--Watson processes in varying environment, for which $\bar f_n \uparrow 1$ and $\sum_{n=1}^\infty (1-\bar f_n) = \infty$, where $\bar f_n$ stands for the offspring mean in generation $n$. Since the process dies out…
We consider a model of random loops on Galton-Watson trees with an offspring distribution with high expectation. We give the configurations a weighting of $\theta^{\#\text{loops}}$. For many $\theta>1$ these models are equivalent to certain…
We consider the Ising model on a supercritical Galton-Watson tree $\mathbf{T}_n$ of depth $n$ with a sparse random external field, given by a collection of i.i.d. Bernouilli random variables with vanishing parameter $p_n$. This may me…
In this paper, we study the cut-off phenomenon under the total variation distance of $d$-dimensional Ornstein-Uhlenbeck processes which are driven by L\'evy processes. That is to say, under the total variation distance, there is an abrupt…
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…
We introduce a simple technique for proving the transience of certain processes defined on the random tree $\mathcal{G}$ generated by a supercritical branching process. We prove the transience for once-reinforced random walks on…
The Horton-Strahler number, also known as the register function, provides a tool for quantifying the branching complexity of a rooted tree. We consider the Horton-Strahler number of critical Galton-Watson trees conditioned to have size $n$…
The basis of this paper is the elementary observation that the $n$-step descendant distribution of any Galton-Watson process satisfies a discrete Smoluchowski coagulation equation with multiple coalescence. Using this we obtain necessary…