Related papers: The longest branches in a non-Markovian phylogenet…
We consider a branching process with Poissonian immigration where individuals have inheritable types. At rate theta, new individuals singly enter the total population and start a new population which evolves like a supercritical,…
A population has two types of individuals, each occupying an island. One of those, where individuals of type 1 live, offers a variable environment. Type 2 individuals dwell on the other island, in a constant environment. Only one-way…
The mathematical analysis of random phylogenetic networks via analytic and algorithmic methods has received increasing attention in the past years. In the present work we introduce branching process methods to their study. This approach…
Under the assumption that the initial population size of a Galton-Watson branching process increases to infinity, the paper studies asymptotic behavior of the population size before extinction. More specifically, we establish asymptotic…
It is possible to represent each of a number of Markov chains as an evolving sequence of connected subsets of a directed acyclic graph that grow in the following way: initially, all vertices of the graph are unoccupied, particles are fed in…
We consider a class of density-dependent branching processes which generalises exponential, logistic and Gompertz growth. A population begins with a single individual, grows exponentially initially, and then growth may slow down as the…
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…
We study a continuous-time branching random walk on the lattice $\mathbb{Z}^{d}$, $d\in \mathbb{N}$, with a single source of branching, that is the lattice point where the birth and death of particles can occur. The random walk is assumed…
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…
Splitting trees are those random trees where individuals give birth at constant rate during a lifetime with general distribution, to i.i.d. copies of themselves. The width process of a splitting tree is then a binary, homogeneous…
There is a well established theory that links semi-Markov chains having Mittag-Leffler waiting times to time-fractional equations. We here go beyond the semi-Markov setting, by defining some non-Markovian chains whose waiting times,…
We consider a critical branching process in an i.i.d. random environment, in which one immigrant arrives at each generation. We are interested in the event $\mathcal{A}_i(n)$ that all individuals alive at time $n$ are offspring of the…
We consider a model of stationary population with random size given by a continuous state branching process with immigration with a quadratic branching mechanism. We give an exact elementary simulation procedure of the genealogical tree of…
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 consider a general class of branching processes in discrete time, where particles have types belonging to a Polish space and reproduce independently according to their type. If the process is critical and the mean distribution of types…
We define a family of continuous-time branching particle systems on the non-negative real line, called branching subordinators, where particles move as independent subordinators. Each particle can also split (at possibly infinite rate) into…
We study a continuous time Mutually Catalytic Branching model on the $\mathbb{Z}^{d}$. The model describes the behavior of two different populations of particles, performing random walk on the lattice in the presence of branching, that is,…
Motivated by a recently proposed design for a DNA coded randomised algorithm that enables inference of the average generation of a collection of cells descendent from a common progenitor, here we establish strong convergence properties for…
In this paper we study the iterated birth process of which we examine the first-passage time distributions and the hitting probabilities. Furthermore, linear birth processes, linear and sublinear death processes at Poisson times are…
We consider a branching Markov process in continuous time in which the particles evolve independently as spectrally negative L\'evy processes. When the branching mechanism is critical or subcritical, the process will eventually die and we…