English
Related papers

Related papers: The fixation line in the ${\Lambda}$-coalescent

200 papers

We examine the total number of collisions $C_n$ in the $\Lambda$-coalescent process which starts with $n$ particles. A linear growth and a stable limit law for $C_n$ are shown under the assumption of a power-like behaviour of the measure…

Probability · Mathematics 2007-05-23 Alexander Gnedin , Yuri Yakubovich

Let $\Lambda$ be a finite measure on the unit interval. A $\Lambda$-Fleming-Viot process is a probability measure valued Markov process which is dual to a coalescent with multiple collisions ($\Lambda$-coalescent) in analogy to the duality…

Probability · Mathematics 2008-10-27 Matthias Birkner , Jochen Blath , Martin Moehle , Matthias Steinruecken , Johanna Tams

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…

Probability · Mathematics 2007-05-23 Jean Bertoin , Jean-François Le Gall

We study the masses of blocks of the $\Lambda$-coalescent with dust and some aspects of their large and small time behaviors. To do so, we start by associating the $\Lambda$-coalescent to a nested interval-partition constructed from the…

Probability · Mathematics 2025-03-04 Grégoire Véchambre

Studies of fixation dynamics in Markov processes predominantly focus on the mean time to absorption. This may be inadequate if the distribution is broad and skewed. We compute the distribution of fixation times in one-step birth-death…

Statistical Mechanics · Physics 2015-10-30 Peter Ashcroft , Arne Traulsen , Tobias Galla

We describe a representation of the Bolthausen-Sznitman coalescent in terms of the cutting of random recursive trees. Using this representation, we prove results concerning the final collision of the coalescent restricted to [n]: we show…

Probability · Mathematics 2007-05-23 Christina Goldschmidt , James B. Martin

Consider an N-dimensional Markov chain obtained from N one-dimensional random walks by Doob h-transform with the q-Vandermonde determinant. We prove that as N becomes large, these Markov chains converge to an infinite-dimensional Feller…

Probability · Mathematics 2014-10-03 Alexei Borodin , Vadim Gorin

Lumping a Markov process introduces a coarser level of description that is useful in many contexts and applications. The dynamics on the coarse grained states is often approximated by its Markovian component. In this letter we derive…

Statistical Mechanics · Physics 2012-07-31 David Andrieux

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…

Probability · Mathematics 2017-09-25 Nicolas Grosjean , Thierry Huillet

$\Lambda$-coalescents model the evolution of a coalescing system in which any number of blocks randomly sampled from the whole may merge into a larger block. For the coalescent restricted to initially $n$ singletons we study the collision…

Probability · Mathematics 2017-08-15 Alexander Gnedin , Alexander Iksanov , Alexander Marynych , Martin Möhle

We investigate a new model for populations evolving in a spatial continuum. This model can be thought of as a spatial version of the Lambda-Fleming-Viot process. It explicitly incorporates both small scale reproduction events and large…

Probability · Mathematics 2010-03-22 N. H. Barton , A. M. Etheridge , A. Veber

We study a density-dependent Markov jump process describing a population where each individual is characterized by a type, and reproduces at rates depending both on its type and on the population type distribution. We are interested in the…

Probability · Mathematics 2026-02-26 Madeleine Kubasch

The multiplicative coalescent is a Markov process taking values in ordered $l^2$. It is a mean-field process in which any pair of blocks coalesces at rate proportional to the product of their masses. In Aldous and Limic (1998) each extreme…

Probability · Mathematics 2016-10-18 Vlada Limic

We study the continuous-time evolution of the recombination equation of population genetics. This evolution is given by a differential equation that acts on a product probability space, and its solution can be described by a Markov chain on…

Probability · Mathematics 2020-04-20 Ian Letter , Servet Martínez

We study infinite systems of particles which undergo coalescence and fragmentation, in a manner determined solely by their masses. A pair of particles having masses $x$ and $y$ coalesces at a given rate $K(x,y)$. A particle of mass $x$…

Probability · Mathematics 2015-08-07 Eduardo Cepeda

This paper aims to provide a simple modelling of speculative bubbles and derive some quantitative properties of its dynamical evolution. Starting from a description of individual speculative behaviours, we build and study a second order…

Probability · Mathematics 2013-09-25 Sébastien Gadat , Laurent Miclo , Fabien Panloup

In mathematical population genetics, it is well known that one can represent the genealogy of a population by a tree, which indicates how the ancestral lines of individuals in the population coalesce as they are traced back in time. As the…

Probability · Mathematics 2014-02-20 Götz Kersting , Jason Schweinsberg , Anton Wakolbinger

Density dependent Markov population processes in large populations of size $N$ were shown by Kurtz (1970, 1971) to be well approximated over finite time intervals by the solution of the differential equations that describe their average…

Probability · Mathematics 2014-10-15 A. D. Barbour , Kais Hamza , Haya Kaspi , Fima Klebaner

We define a doubly infinite, monotone labeling of Bienayme-Galton-Watson (BGW) genealogies. The genealogy of the current generation backwards in time is uniquely determined by the coalescent point process $(A_i; i\ge 1)$, where $A_i$ is the…

Probability · Mathematics 2015-03-17 Amaury Lambert , Lea Popovic

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…

Probability · Mathematics 2013-04-17 Yves Le Jan , Sophie Lemaire