Related papers: Quenched critical percolation on Galton-Watson tre…

We provide sufficient conditions for a regular graph $G$ of growing degree $d$, guaranteeing a phase transition in its random subgraph $G_p$ similar to that of $G(n,p)$ when $p\cdot d\approx 1$. These conditions capture several well-studied…

For a complex number $\alpha$, we consider the sum of the $\alpha$th powers of subtree sizes in Galton--Watson trees conditioned to be of size $n$. Limiting distributions of this functional $X_n(\alpha)$ have been determined for $\Re\alpha…

We study the local limit in distribution of Bienaym{\'e}-Galton-Watson trees conditioned on having large sub-populations. Assuming a generic and aperiodic condition on the offspring distribution, we prove the existence of a limit given by a…

We consider a multi-type Galton-Watson branching processes, where the largest in magnitude positive eigenvalue $\rho$ of the first moments matrix is close to unity. Specifically, we examine the random vector representing the number of…

We consider Galton--Watson trees conditioned on both the total number of vertices $n$ and the number of leaves $k$. The focus is on the case in which both $k$ and $n$ grow to infinity and $k = \alpha n + O(1)$, with $\alpha \in (0, 1)$.…

Critical branching processes in a varying environment behave much the same as critical Galton-Watson processes. In this note we like to confirm this finding with regard to the underlying genealogical structures. In particular, we consider…

We consider a branching random walk on a multi($Q$)-type, supercritical Galton-Watson tree which satisfies Kesten-Stigum condition. We assume that the displacements associated with the particles of type $Q$ have regularly varying tails of…

We consider a branching random walk (BRW) taking its values in the $\mathtt{b}$-ary rooted tree $\mathbb W_{ \mathtt{b}}$ (i.e. the set of finite words written in the alphabet $\{ 1, \ldots, \mathtt{b} \}$, with $\mathtt{b}\! \geq \! 2$).…

The key to our investigation is an improved (and in a sense sharp) understanding of the survival time of the contact process on star graphs. Using these results, we show that for the contact process on Galton-Watson trees, when the…

We study the supercritical contact process on Galton-Watson trees and periodic trees. We prove that if the contact process survives weakly then it dominates a supercritical Crump-Mode-Jagers branching process. Hence the number of infected…

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…

A new ``Percolation with Clustering'' (PWC) model is introduced, where (the probabilities of) site percolation configurations on the leaf set of a binary tree are rewarded exponentially according to a generic function, which measures the…

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…

We are interested in the local limits of families of random trees that satisfy the Markov branching property, which is fulfilled by a wide range of models. Loosely, this property entails that given the sizes of the sub-trees above the root,…

Begin continuous time random walks from every vertex of a graph and have particles coalesce when they collide. We use a duality relation with the voter model to prove the process is site recurrent on bounded degree graphs, and for…

Let $\mathcal{T}$ be a supercritical Galton-Watson tree with a bounded offspring distribution that has mean $\mu >1$, conditioned to survive. Let $\varphi_{\mathcal{T}}$ be a random embedding of $\mathcal{T}$ into $\mathbb{Z}^d$ according…

Consider a family of random ordered graph trees $(T_n)_{n\geq 1}$, where $T_n$ has $n$ vertices. It has previously been established that if the associated search-depth processes converge to the normalised Brownian excursion when rescaled…

In the regime of Galton-Watson trees, first order logic statements are roughly equivalent to examining the presence of specific finite subtrees. We consider the space of all trees with Poisson offspring distribution and show that such…

We consider Bienaym\'e-Galton-Watson trees in random environment, where each generation $k$ is attributed a random offspring distribution $\mu_k$, and $(\mu_k)_{k\geq 0}$ is a sequence of independent and identically distributed random…

We consider branching random walks built on Galton--Watson trees with offspring distribution having a bounded support, conditioned to have $n$ nodes, and their rescaled convergences to the Brownian snake. We exhibit a notion of ``globally…