|
This article is cited in 2 scientific papers (total in 2 papers)
On the Time of Supplanting All Particles by Particles of One Type in a Fixed Size Population
S. A. Klokov, V. A. Topchii Omsk Branch of Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Science
Abstract:
We consider a population of $N$ particles of each of which some type is ascribed to. At the integer time moments each particle splits into two particles of the same type as their parent, and then $N$ particles are instantly equiprobably excluded from the population of $2N$ particles. Let $\tau$ be a random variable denoting the number of generation when all particles become of the same type for the first time. We obtain upper bounds for the expectation of $\tau$. In particular, if all particles have different types originally then $\tau$ coincides, in terminology of branching processes, with the distance (in time) to the nearest common ancestor of the population with infinite long history. In simple cases, simulation results and approximate numerical solutions of systems of equations show that the resultant bound is about half as much again.
Key words:
Markov chain, hypergeometric distribution, evolution of populations, nearest common ancestor, simulation.
Received: 04.08.2004
Citation:
S. A. Klokov, V. A. Topchii, “On the Time of Supplanting All Particles by Particles of One Type in a Fixed Size Population”, Mat. Tr., 8:2 (2005), 168–183; Siberian Adv. Math., 16:2 (2006), 93–107
Linking options:
https://www.mathnet.ru/eng/mt65 https://www.mathnet.ru/eng/mt/v8/i2/p168
|
Statistics & downloads: |
Abstract page: | 406 | Full-text PDF : | 90 | References: | 76 | First page: | 1 |
|