Related papers: The replicator coalescent
We study coming down from infinity for coordinated particle systems. In a coordinated particle system, particles live on a set of sites $V$ and are able to coalesce, migrate, reproduce, and die. The dynamics of these events are coordinated…
A well-established model for the genealogy of a large population in equilibrium is Kingman's coalescent. For the population together with its genealogy evolving in time, this gives rise to a time-stationary tree-valued process. We study the…
Smoluchowski's coagulation equations can be used as elementary mathematical models for the formation of polymers. We review here some recent contributions on a variation of this model in which the number of aggregations for each atom is a…
Existing theoretical models of evolution focus on the relative fitness advantages of different mutants in a population while the dynamic behavior of the population size is mostly left unconsidered. We here present a generic stochastic model…
The goal of these lectures is to review some mathematical aspects of random tree models used in evolutionary biology to model gene trees or species trees. We start with stochastic models of tree shapes (finite trees without edge lengths),…
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…
We investigate a system of interacting clusters evolving through mass exchange and supplemented by input of small clusters. Three possibilities depending on the rate of exchange generically occur when input is homogeneous: continuous…
We consider a class of stochastic dynamical systems, called piecewise deterministic Markov processes, with states $(x, \s)\in \O\times \G$, $\O$ being a region in $\bbR^d$ or the $d$--dimensional torus, $\G$ being a finite set. The…
Every exchangeable Feller process taking values in a suitably nice combinatorial state space can be constructed by a system of iterated random Lipschitz functions. In discrete time, the construction proceeds by iterated application of…
We derive the general form of a master equation describing the interaction of an arbitrary multipartite quantum system, consisting of a set of subsystems, with an environment, consisting of a large number of sub-envirobments. Each subsystem…
The presence of energy barriers in the state space of a physical system can lead to exponentially slow convergence for sampling algorithms like Markov chain Monte Carlo (MCMC). In the classical setting, replica exchange (or parallel…
Many biological systems can be described by finite Markov models. A general method for simplifying master equations is presented that is based on merging adjacent states. The approach preserves the steady-state probability distribution and…
Cyclic (rock-paper-scissors-type) population models serve to mimic complex species interactions. Focusing on a paradigmatic three-species model with mutations in one dimension, we observe an interplay between equilibrium and non-equilibrium…
Stochastic reaction networks, which are usually modeled as continuous-time Markov chains on $\mathbb Z^d_{\ge 0}$, and simulated via a version of the "Gillespie algorithm," have proven to be a useful tool for the understanding of processes,…
A stochastic model, the product of a circulant matrix and a random normal vector, is shown to produce an evolutive long memory time series with a power law spectral density. The distribution of the time series, a beta location scale family…
Pairs of numerically computed trajectories of a chaotic system may coalesce because of finite arithmetic precision. We analyse an example of this phenomenon, showing that it occurs surprisingly frequently. We argue that our model belongs to…
Multispecies reaction-diffusion systems, for which the time evolution equation of correlation functions become a closed set, are considered. A formal solution for the average densities is found. Some special interactions and the exact time…
We prove several limit theorems that relate coalescent processes to continuous-state branching processes. Some of these theorems are stated in terms of the so-called generalized Fleming-Viot processes, which describe the evolution of a…
The Boltzmann model for the random generation of "decomposable" combinatorial structures is a set of techniques that allows for efficient random sampling algorithms for a large class of families of discrete objects. The usual requirement of…
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…