Related papers: Eternal multiplicative coalescent is encoded by it…

Consider a multitype coalescent process in which each block has a colour in $\{1,\ldots,d\}$. Individual blocks may change colour, and some number of blocks of various colours may merge to form a new block of some colour. We show that if…

Coalescing random walks is a fundamental stochastic process, where a set of particles perform independent discrete-time random walks on an undirected graph. Whenever two or more particles meet at a given node, they merge and continue as a…

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 study the loop clusters induced by Poissonian ensembles of Markov loops on a finite or countable graph (Markov loops can be viewed as excursions of Markov chains with a random starting point, up to re-rooting). Poissonian ensembles are…

We present a coalescent process where three particles merge at each coagulation step. Using a random walk representation, we prove duality with a fragmentation process, whose fragmentation law we specify explicitly. Furthermore, we give a…

We introduce a class of Markov coalescent processes on the continuous $d$-dimensional torus, in the most general setting of simultaneous multiple mergers, called the Brownian spatial coalescent. It is axiomatically defined through a…

Consider a system of coalescing random walks where each individual performs random walk over a finite graph G, or (more generally) evolves according to some reversible Markov chain generator Q. Let C be the first time at which all walkers…

The planar symmetric Markov random flight $\bold X(t), \; t>0,$ is represented by the stochastic motion of a particle moving with constant finite speed $c>0$ in the Euclidean plane $\Bbb R^2$ and taking on its initial and each new…

We define a multi-type coalescent point process of a general branching process with finitely many types. This multi-type coalescent fully describes the genealogy of the (quasi-stationary) standing population, providing types along ancestral…

Two sequentially Markov coalescent models (SMC and SMC') are available as tractable approximations to the ancestral recombination graph (ARG). We present a Markov process describing coalescence at two fixed points along a pair of sequences…

The Mittag-Leffler process $X=(X_t)_{t\ge 0}$ is introduced. This Markov process has the property that its marginal random variables $X_t$ are Mittag-Leffler distributed with parameter $e^{-t}$, $t\in [0,\infty)$, and the semigroup…

The $\X$-coalescent processes were initially studied by M\"ohle and Sagitov (2001), and introduced by Schweinsberg (2000) in their full generality. They arise in the mathematical population genetics as the complete class of scaling limits…

We define a Markov process in a forward population model with backward genealogy given by the $\Lambda$-coalescent. This Markov process, called the fixation line, is related to the block counting process through its hitting times. Two…

For a broad class of planar Markov processes, viz. L\'evy processes satisfying certain conditions (valid \textit{eg} in the case of Brownian motion and L\'evy flights), we establish an exact, universal formula describing the shape of the…

In the paper we consider some piecewise deterministic Markov process whose continuous component evolves according to semiflows, which are switched at the jump times of a Poisson process. The associated Markov chain describes the states of…

Bertoin and Le Gall (2003) introduced a certain probability measure valued Markov process that describes the evolution of a population, such that a sample from this population would exhibit a genealogy given by the so-called…

An important property of Kingman's coalescent is that, starting from a state with an infinite number of blocks, over any positive time horizon, it transitions into an almost surely finite number of blocks. This is known as `coming down from…

This paper provides a new construction of \Lambda-coalescents called "measure division construction". This construction is pathwise and consists of dividing the characteristic measure \Lambda into several parts and adding them one by one to…

In this work, we study general Dirichlet coalescents, which are a family of Xi-coalecents constructed from i.i.d mass partitions, and are an extension of the symmetric coalescent. This class of models is motivated by population models with…

Birkner et al. obtained necessary and sufficient conditions for the frequency between two independent and identically distributed continuous-state branching processes time-changed by a functional of the total mass process to be a Markov…