Related papers: The backbone decomposition for spatially dependent…
We employ the framework of multitype Galton-Watson processes to model a population of dividing cells. The cellular type is represented by its biological age, defined as the count of harmful proteins hosted by the cell. The stochastic…
Consider a continuous-state branching population constructed as a flow of nested subordinators. Inverting the subordinators and reversing time give rise to a flow of coalescing Markov processes (with negative jumps) which correspond to the…
We study the evolution of a particle system whose genealogy is given by a supercritical continuous time Galton--Watson tree. The particles move independently according to a Markov process and when a branching event occurs, the offspring…
Bisexual Galton-Watson processes are discrete Markov chains where reproduction events are due to mating of males and females. Owing to this interaction, the standard branching property of Galton-Watson processes is lost. We prove tightness…
We define and analyze a coalescent process as a recursive box-filling process whose genealogy is given by an ancestral time-reversed, time-inhomogeneous Bienyam\'{e}-Galton-Watson process. Special interest is on the expected size of a…
We investigate the genealogical structure of general critical or subcritical continuous-state branching processes. Analogously to the coding of a discrete tree by its contour function, this genealogical structure is coded by a real-valued…
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 present a new algorithm for computing the quasi-stationary distribution of subcritical Galton--Watson branching processes. This algorithm is based on a particular discretization of a well-known functional equation that characterizes the…
In this work, we study asymptotics of multitype Galton-Watson trees with finitely many types. We consider critical and irreducible offspring distributions such that they belong to the domain of attraction of a stable law, where the…
The paper considers the well-known Galton-Watson stochastic branching process. We are dealing with a non-critical case. In the subcritical case, when the mean of the direct descendants of one particle per generation of the time step is less…
We construct a class of discontinuous superprocesses with dependent spatial motion and general branching mechanism. The process arises as the weak limit of critical interacting-branching particle systems where the spatial motions of the…
Let $\left\{ Z(n),n\geq 1\right\} $ be a critical Galton-Watson branching process with finite variance for the offspring size of particles. Assuming that $0<Z(n)\leq \varphi (n)$, where either $\varphi (n)=an$ for some $a>0$ or $\varphi…
We consider a supercritical Galton-Watson branching process with immigration. It is well known that under suitable conditions on the offspring and immigration distributions, there is a finite, strictly positive limit ${\mathcal{W}}$ for the…
We introduce a modified Galton-Watson process using the framework of an infinite system of particles labeled by $(x,t)$, where $x$ is the rank of the particle born at time $t$. The key assumption concerning the offspring numbers of…
We study the extremes of branching random walks under the assumption that the underlying Galton-Watson tree has infinite progeny mean. It is assumed that the displacements are either regularly varying or they have lighter tails. In the…
We study asymptotic properties of supercritical Galton-Watson (GW) branching processes in the asymptotic where the mean of the offspring distribution approaches 1 from above. We show that the population-size distribution of the GW branching…
Consider a continuous-time binary branching process conditioned to have population size n at some time t, and with a chance p for recording each extinct individual in the process. Within the family tree of this process, we consider the…
The family tree of a Galton-Watson branching process may contain N-ary subtrees, i.e. subtrees whose vertices have at least N>0 children. For family trees without infinite N-ary subtrees, we study how fast N-ary subtrees of height t…
We study the exploration (or height) process of a continuous time non-binary Galton-Watson random tree, in the subcritical, critical and supercritical cases. Thus we consider the branching process in continuous time (Z_{t})_{t\geq 0}, which…