Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 4 Feb 2018 in math.PR | (1802.01132v1)

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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.