pith. sign in

arxiv: 1802.01132 · v1 · pith:PBTWQFQ2new · submitted 2018-02-04 · 🧮 math.PR

The genealogy of an exactly solvable Ornstein-Uhlenbeck type branching process with selection

classification 🧮 math.PR
keywords processbranchingornstein-uhlenbeckselectionaccordingchildrengenealogymodel
0
0 comments X
read the original abstract

We study the genealogy of a solvable population model with $N$ particles on the real line which evolves according to a discrete-time branching process with selection. At each time step, every particle gives birth to children around $a$ times its current position, where $a>0$ is a parameter of the model. Then, the $N$ rightmost new-born children are selected to form the next generation. We show that the genealogical trees of the process converge to those of a Beta coalescent as $N \to \infty$. The process we consider can be seen as a toy-model version of a continuous-time branching process with selection, in which particles move according to independent Ornstein-Uhlenbeck processes. The parameter $a$ is akin to the pulling strength of the Ornstein-Uhlenbeck motion.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.