Related papers: Kingman's coalescent with erosion
We give computable bounds on the rate of convergence of the transition probabilities to the stationary distribution for a certain class of geometrically ergodic Markov chains. Our results are different from earlier estimates of Meyn and…
A $k$-height on a graph $G=(V, E)$ is an assignment $V\to\{0, \ldots, k\}$ such that the value on ajacent vertices differs by at most $1$. We study the Markov chain on $k$-heights that in each step selects a vertex at random, and, if…
A Markov chain $X^i$ on a finite state space $S$ has transition matrix $P$ and initial state $i$. We may run the chains $(X^i: i\in S)$ in parallel, while insisting that any two such chains coalesce whenever they are simultaneously at the…
Processes of coalescence and fragmentation are used to understand the time-evolution of the mass distribution of various systems and may result in a steady state or in stable deterministic or stochastic cycles. Motivated by applications in…
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 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 coalescence of surfactant-laden water droplets by using several different surfactant types and a wide range of concentrations by means of a coarse-grained model obtained by the statistical associating fluid theory. Our…
We present an explicit construction of a Markovian random growth process on integer partitions such that given it visits some level $n$, it passes through any partition $\lambda$ of $n$ with equal probabilities. The construction has…
We consider a piecewise-deterministic Markov process governed by a jump intensity function, a rate function that determines the behaviour between jumps, and a stochastic kernel describing the conditional distribution of jump sizes. We study…
Let $X_1, X_2,\ldots$ be random elements of the Skorokhod space $D(\mathbb{R})$ and $\xi_1, \xi_2, \ldots$ positive random variables such that the pairs $(X_1,\xi_1), (X_2,\xi_2),\ldots$ are independent and identically distributed. The…
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 consider the behaviour of branching-selection particle systems in the large population limit. The dynamics of these systems is the combination of the following three components: (a) Motion: particles move on the real line according to a…
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…
We study coalescent processes conditional on the population pedigree under the exchangeable diploid bi-parental population model of \citet{BirknerEtAl2018}. While classical coalescent models average over all reproductive histories, thereby…
The notion of stability can be generalised to point processes by defining the scaling operation in a randomised way: scaling a configuration by $t$ corresponds to letting such a configuration evolve according to a Markov branching particle…
Let X and Y be time-homogeneous Markov processes with common state space E, and assume that the transition kernels of X and Y admit densities with respect to suitable reference measures. We show that if there is a time t>0 such that, for…
We explore the concept of a consistent exchangeable survival process - a joint distribution of survival times in which the risk set evolves as a continuous-time Markov process with homogeneous transition rates. We show a correspondence with…
We study the number of collisions $X_n$ of an exchangeable coalescent with multiple collisions ($\Lambda$-coalescent) which starts with $n$ particles and is driven by rates determined by a finite characteristic measure $\nu({\rm…
Consider a random permutation of $\{1, \ldots, \lfloor n^{t_2}\rfloor\}$ drawn according to the Ewens measure with parameter $t_1$ and let $K(n, t)$ denote the number of its cycles, where $t\equiv (t_1, t_2)\in\mathbb [0, 1]^2$. Next,…
In these expository notes, we describe some features of the multiplicative coalescent and its connection with random graphs and minimum spanning trees. We use Pitman's proof of Cayley's formula, which proceeds via a calculation of the…