Related papers: Beta-coalescents and continuous stable random tree…
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…
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…
Topological Data Analysis (TDA), a relatively new field of data analysis, has proved very useful in a variety of applications. The main persistence tool from TDA is persistent homology in which data structure is examined at many scales.…
Identifiability of evolutionary tree models has been a recent topic of discussion and some models have been shown to be non-identifiable. A coalescent-based rooted population tree model, originally proposed by Nielsen et al. 1998 [2], has…
We provide scaling limits for the block counting process and the fixation line of $\Lambda$-coalescents as the initial state $n$ tends to infinity under the assumption that the measure $\Lambda$ on $[0,1]$ satisfies…
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…
Topologically constrained genome-like polymers often double-fold into tree-like configurations, which can be modelled on the level of folded (ring) polymers or on the level of the underlying random trees. For both descriptions, we have…
We construct an extension of the Lambda-coalescent to a spatial continuum and analyse its behaviour. Like the Lambda-coalescent, the individuals in our model can be separated into (i) a dust component and (ii) large blocks of coalesced…
Coalescent histories are combinatorial structures that describe for a given gene tree and species tree the possible lists of branches of the species tree on which the gene tree coalescences take place. Properties of the number of coalescent…
We consider a continuous population whose dynamics is described by the standard stationary Fleming-Viot process, so that the genealogy of $n$ uniformly sampled individuals is distributed as the Kingman $n$-coalescent. In this note, we study…
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…
Recruitment dynamics, or the distribution of the number of offspring among individuals, is central for understanding ecology and evolution. Sweepstakes reproduction (heavy right-tailed offspring number distribution) is central for…
We define a Markov process on the partitions of $[n]=\{1,\ldots,n\}$ by drawing a sample in $[n]$ at each time of a Poisson process, by merging blocks that contain one of these points and by leaving all other blocks unchanged. This…
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…
We introduce a Poissonization method to study the coalescent structure of uniform samples from branching processes. This method relies on the simple observation that a uniform sample of size $k$ taken from a random set with positive…
We define the beta diffusion tree, a random tree structure with a set of leaves that defines a collection of overlapping subsets of objects, known as a feature allocation. A generative process for the tree structure is defined in terms of…
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coalesce into one cluster via a decentralized stochastic process,…
Fixed point combinators (and their generalization: looping combinators) are classic notions belonging to the heart of lambda-calculus and logic. We start with an exploration of the structure of fixed point combinators (fpc's), vastly…
We introduce a new Bayesian model for hierarchical clustering based on a prior over trees called Kingman's coalescent. We develop novel greedy and sequential Monte Carlo inferences which operate in a bottom-up agglomerative fashion. We show…
We revisit the discrete additive and multiplicative coalescents, starting with $n$ particles with unit mass. These cases are known to be related to some "combinatorial coalescent processes": a time reversal of a fragmentation of Cayley…