Skip to main content
eScholarship
Open Access Publications from the University of California

UC San Diego

UC San Diego Previously Published Works bannerUC San Diego

Solving the Fisher-Wright and coalescence problems with a discrete Markov chain analysis

  • Author(s): Buss, Samuel R;
  • Clote, Peter
  • et al.
Abstract

We develop a new, self-contained proof that the expected number of generations required for gene allele fixation or extinction in a population of size n is O(n) under general assumptions. The proof relies on a discrete Markov chain analysis. We further develop an algorithm to compute expected fixation or extinction time to any desired precision. Our proofs establish O(n H(p)) as the expected time for gene allele fixation or extinction for the Fisher-Wright problem, where the gene occurs with initial frequency p and H(p) is the entropy function. Under a weaker hypothesis on the variance, the expected time is O(n (p (1 - p))(1/2)) for fixation or extinction. Thus, the expected-time bound of O(n) for fixation or extinction holds in a wide range of situations. In the multi-allele case, the expected time for allele fixation or extinction in a population of size n with n distinct alleles is shown to be O(n). From this, a new proof is given of a coalescence theorem about the mean time to the most recent common ancestor (MRCA), which applies to a broad range of reproduction models satisfying our mean and weak variation conditions.

Many UC-authored scholarly publications are freely available on this site because of the UC's open access policies. Let us know how this access is important for you.

Main Content
For improved accessibility of PDF content, download the file to your device.
Current View