Skip to main content
Springer logoLink to Springer
. 2012 Dec 14;132(2):73–82. doi: 10.1007/s12064-012-0170-3

An introduction to the mathematical structure of the Wright–Fisher model of population genetics

Tat Dat Tran 1, Julian Hofrichter 1, Jürgen Jost 1,2,3,
PMCID: PMC4269093  PMID: 23239077

Abstract

In this paper, we develop the mathematical structure of the Wright–Fisher model for evolution of the relative frequencies of two alleles at a diploid locus under random genetic drift in a population of fixed size in its simplest form, that is, without mutation or selection. We establish a new concept of a global solution for the diffusion approximation (Fokker–Planck equation), prove its existence and uniqueness and then show how one can easily derive all the essential properties of this random genetic drift process from our solution. Thus, our solution turns out to be superior to the local solution constructed by Kimura.

Keywords: Random genetic drift, Wright–Fisher model, Fokker–Planck equation

Introduction

In population genetics, one considers the effects of recombination, selection, mutation, and perhaps others like migration on the distribution of alleles in a population, see e.g. (Ewens 2004; Bürger 2000; Rice 2004) as mathematical textbook references. The most basic and at the same time important model is the Wright–Fisher model for random genetic drift [developed implicitly by Fisher (1922) and explicitly by Wright (1931)]. In its simplest version—the one to be treated in the present paper—it is concerned with the evolution of the relative frequencies of two alleles at a single diploid locus in a finite population of fixed size with non-overlapping generations under the sole force of random genetic drift, without any other influences like mutations or selection. The model can be generalised—and so can our approach—to multiple alleles, several loci, with mutations, selections, spatial population structures, etc, see the above references. To find an exact solution (for the approximating diffusion process for the probability densities of the allele frequencies described by a Fokker–Planck equation) from which the properties of the resulting stochastic process can be deduced, however, is difficult. For the basic two-allele case, this was first achieved in the important work of Kimura (1955), and he then went on to treat the case of several alleles (Kimura 1955, 1956). His solution, however, is local in the sense that it does not naturally incorporate the transitions resulting from the irreversible loss of one or several of the alleles initially present in the population. Consequently, the resulting probability distribution does not integrate to 1, and it is difficult to read off the quantitative properties of the process from his solution.

In the present paper, we introduce and describe a new global approach. This approach is mathematically more transparent than Kimura’s scheme. We prove the existence of a unique such global solution (see Theorem 3.7), and we can deduce all desired quantities of the underlying stochastic process from our solution. The purpose of the present paper thus is to display the method in the simplest case, that of two alleles at a single locus, so that the structure becomes clear. The case of multiple alleles is presented in our companion paper (Tran et al. 2000) on the basis of the first author’s thesis, and further generalisations will be systematically developed elsewhere within the mathematical framework of information geometry (Amari and Nagaoka 2000) and more specifically (Ay and Jost 2000; Jost 2000) on the basis of the second author’s thesis.

The Wright–Fisher model

We consider a diploid population of size N. At a given locus, there could be either one of the two alleles A 1,A 2. Thus, an individual can be a homozygote of type A 1 A 1 or A 2 A 2 or a heterozygote of type A 1 A 2 or A 2 A 1—but we consider the latter two as the same—at the locus in question. The population reproduces in discrete time steps, and each individual in generation n + 1 inherits one allele from each of its parents. When a parent is a heterozygote, each allele is chosen with probability 1/2. Here, for each individual in generation t + 1, randomly two parents in generation n are chosen. Thus, the alleles in generation n + 1 are chosen by random sampling with replacement from the ones in generation n. The quantity of interest is the number Y n of alleles A 1 in the population at time n. This number then varies between 0 and 2N. The transition probability then is

graphic file with name M1.gif 1

whenever Y n takes the value 0 or 2N, that is, if either the allele A 1 or A 2 will disappear, it will stay there for all future times. Eventually, this will happen almost surely.

This is the basic model. One can then derive expressions for the expected time for the allele A 1 to become either fixed, that is, Y n = 2N, or become extinct, Y n = 0, given its initial number Y 0.

An important idea, first applied in Wright (1945), then is to rescale time and population size via

graphic file with name M2.gif 2

and then consider the limit Inline graphic The rescaling of (2) yields a discrete Markov chain X t valued in Inline graphic with t = 1 now corresponding to 2N generations. One readily verifies that the expectation values for the variation across generations satisfy

graphic file with name M5.gif 3

A basic idea of our approach is to consider the kth moment m k(t) of the distribution about zero at the (2Nt)th generation, i.e.

graphic file with name M6.gif 4

We have

graphic file with name M7.gif 5

Expanding the right hand side and noting (3) we obtain the following recursion formula

graphic file with name M8.gif 6

when we assume that the population number N is so large that we can neglect all terms of order at least Inline graphic Under this assumption, the moments change very slowly per generation and we can replace the above system (6) by the system of differential equations

graphic file with name M10.gif 7

where the dot denotes a derivative w.r.t. the variable t.

These formulae now guide us in finding a continuous process that well approximates the above discrete process. We seek a continuous Markov process {X t}t ≥ 0 valued in [0,1] with the same conditions as (3) and (7). The conditions (3) imply (see for example Ewens 2004, p. 137, for a derivation) that the probability density function u(xt) of this continuous process is a solution of the Fokker–Planck (Kolmogorov forward) equation

graphic file with name M11.gif 8

where we now use the notation Inline graphic for the partial derivative w.r.t. the time variable t. The coefficient x(1 − x) in (8) comes from (3) and δp denotes the Dirac delta function at p. For the definition of this delta function, we use the product

graphic file with name M13.gif

for square integrable functions Inline graphic on the unit interval (this will be described in more detail in “Existence and uniqueness of solutions”), and we then put

graphic file with name M15.gif

whenever Inline graphic is a continuous function.1

Let us also explain the interpretation of (8) for those not sufficiently versed in this mathematical formalism. The initial condition u(x,0) = δp(x) then simply says that at time 0, the relative frequency of allele A 1 is precisely p, without any uncertainty (this assumption is not essential, however, and the scheme works also for more general initial condition involving uncertainty about the initial distribution of the alleles). Subsequently, this allele frequence evolves stochastically, according to the equation Inline graphic and therefore, for t > 0, we no longer know the precise value of this relative frequency, but only its probability density given by u(xt). That is, for every x, the probability density that the allele frequency at time t has the value x is given by u(xt).

In the continuum limit, the kth moment becomes Inline graphic and the condition (7) then implies

graphic file with name M19.gif

Since the polynomials are dense in the space of (square integrable) functions, this yields

graphic file with name M20.gif 9

for all square integrable functions Inline graphic that are twice differentiable in the open interval (0,1).

This leads to our concept of a solution of the Fokker–Planck equation in

Definition 2.1

We call Inline graphic a solution of the Fokker–Planck equation associated with the Wright–Fisher model if

graphic file with name M23.gif 10
graphic file with name M24.gif 11
graphic file with name M25.gif 12

for all square integrable functions Inline graphic that are twice differentiable in the open interval (0, 1), with the differential operator

graphic file with name M27.gif 13

and its formal adjoint

graphic file with name M28.gif 14

This solution concept will allow us to prove the existence of a unique solution from which we can then derive all features of interest of the Wright–Fisher process. We should point out that (12) is not just the integration by parts of (10), but also includes the boundary behaviour (of course, this may not be overt, but the mathematical trick here is to represent this boundary behaviour in an implicit form best suited for formal manipulation). It, thus, reflects transitions from the presence of both alleles to the irreversible loss of one of them. This is the crucial difference to Kimura’s (1955) solution concept and the key for the properties of our solution.

Existence and uniqueness of solutions

We shall now apply a familiar mathematical scheme for the construction of a solution of a differential equation, an expansion in terms of eigenfunctions of the differential operator involved. For our problem, as formalised in Definition 2.1, these eigenfunctions can be constructed from a classical family of polynomials, the Gegenbauer polynomials, which we shall now introduce.

Preliminaries

For the sequel, we shall need some more notation. We need the function spaces

graphic file with name M29.gif
graphic file with name M30.gif

with the scalar product

graphic file with name M31.gif

To construct solutions in terms of expansions, we shall need a special case of the Gegenbauer polynomials [named after Leopold Gegenbauer (1849–1903)].2 The polynomials Y m(z) we need are defined in terms of their generating function

graphic file with name M32.gif

Lemma 3.1

(Suetin 2001)

  • The Gegenbauer polynomials satisfy the recurrence relation
    graphic file with name M33.gif
  • The Gegenbauer polynomials solve the differential equation
    graphic file with name M34.gif 15

Lemma 3.2

[Abramowitz (1965), p. 774] The polynomials Y m are orthogonal polynomials on the interval [−1,1] with respect to the weight function (1 − z 2):

graphic file with name M35.gif 16

Auxiliaries

Lemma 3.3

For all m ≥ 0 we have

graphic file with name M36.gif

with

graphic file with name M37.gif

Proof

Putting z = 1 − 2x implies that

graphic file with name M38.gif

is a Gegenbauer polynomial and therefore solves (15),

graphic file with name M39.gif

This is equivalent to

graphic file with name M40.gif

This completes the proof.Inline graphic

In the sequel, we shall use the abbreviation

graphic file with name M42.gif

Lemma 3.4

If X is an eigenvector of L corresponding to the eigenvalue λ then wX is an eigenvector of L * corresponding to the eigenvalue λ.

Proof

Assume that X is an eigenvector of L for the eigenvalue λ, i.e.

graphic file with name M43.gif

Multiplying both sides by w yields

graphic file with name M44.gif

This completes the proof. Inline graphic

Lemma 3.5

The spectrum of the operator L is

graphic file with name M46.gif

and the eigenvector of L corresponding to λm is the Gegenbauer polynomial X m(x) (up to a constant).

Proof

From Lemma 3.3 we have L(X m) =  − λm X m in H 0. So, Inline graphic Conversely, we shall prove that Inline graphic is not an eigenvalue of L. In fact, assume that there is some Inline graphic with Inline graphic Because {X m}m ≥ 0 is a basis of H 0, we can represent X by Inline graphic Then

graphic file with name M52.gif

For any n ≥ 0, we can multiply this relation by wX n and then integrate on [0,1]. From the orthogonality (16) with respect to the weight function w, we obtain

graphic file with name M53.gif

Because (X n,wX n)≠ 0 and λ≠ λn, then d n = 0, ∀ n ≥ 0. Therefore, X = 0, i.e. λ is not an eigenvalue of L. Thus

graphic file with name M54.gif

Similarly, if X is an eigenvector of L for the eigenvalue λm, we will prove that X = c X m. In fact, representing Inline graphic it follows that

graphic file with name M56.gif

For any k ≥ 0, we multiply this relation by wX k and then integrate on [0,1] to obtain

graphic file with name M57.gif

Because (X k,wX k) ≠ 0 and λm ≠ λk for all km, then d k = 0, ∀k m. Hence X = d m X m. This completes the proof. Inline graphic

Construction of the solution

In this subsection, we construct the solution and prove its uniqueness. We shall firstly find the general solution of the Fokker–Planck equation (10) by the separation of variables method. Then we shall construct a solution depending on parameters. We shall use (11, 12) to determine the parameters. Finally, we shall verify the solution.

Step 1 Assume that u 0(x,t) = X(x)T(t) is a solution of the Fokker Planck equation (10). Then we have

graphic file with name M59.gif

which implies that λ is a constant which is independent of tx. From Lemma 3.5, we obtain the general solution of the equation (10) as

graphic file with name M60.gif

Remark 3.6

u 0 is the same as Kimura’s solution (see for example Kimura 1955a,b).

Step 2 The general solution Inline graphic of (10) then is

graphic file with name M62.gif 17

where δ0 and δ1 are the Dirac delta functionals at 0 and 1.

Step 3 Checking condition (12) with ϕ = 1, ϕ = x, ϕ = wX n yields

graphic file with name M63.gif

With condition (11), we then obtain

graphic file with name M64.gif

and

graphic file with name M65.gif 18

Therefore we have all parameters

graphic file with name M66.gif 19

It follows that the solution should be

graphic file with name M67.gif 20

where X m(x) is a Gegenbauer polynomial,

graphic file with name M68.gif 21

Step 4 We will prove the constructed solution u satisfies conditions (10, 11, 12). In fact, because in (0, 1),  u = u 0, it is clear that u satisfies the Fokker Planck equation (10). Moreover, from the representation (20), we have

graphic file with name M69.gif 22

Thus,

graphic file with name M70.gif 23

Because {1, x, {wX n}n ≥ 0} is also a basis of H 0, it follows that

graphic file with name M71.gif

i.e. Inline graphic i.e. u satisfies the condition (11).

Finally, from (22) we have

graphic file with name M73.gif 24

Because L * is linear and {1, x, {wX n}n ≥ 0} is also a basis of H 0, it follows that

graphic file with name M74.gif

i.e. u satisfies the condition (12).

Therefore, u is a solution of the Fokker–Planck equation associated with the Wright–Fisher model, indeed.

We can easily see that this solution is unique. In fact, assume that u 1,u 2 are two solutions of the Fokker–Planck equation associated with Wright–Fisher model. Then u = u 1 − u 2 satisfies

graphic file with name M75.gif

Therefore

graphic file with name M76.gif

Therefore

graphic file with name M77.gif

Because {1, x, {wX n}n ≥ 0} is also a basis of H 0, it follows that Inline graphic

Altogether, we obtain our main result.

Theorem 3.7.

The Fokker–Planck equation associated with Wright–Fisher model possesses a unique solution.

This new solution continuously deforms the initial state δp(x) (the allele A 1 has relative frequency p) to pδ1(x) + (1 − p0(x) (allele A 1 is fixed with probability p and A 2 is fixed with probability 1 − p) as time proceeds from 0 to Inline graphic In fact, the sequence {u m(x,t)}m ≥ 0 satisfying

graphic file with name M80.gif 25

tends to u for Inline graphic Therefore, we can visualise the asymptotic behaviour with the help of Mathematica (Fig. 1).Inline graphic

Fig. 1.

Fig. 1

Behaviour of the new solution from δp to pδ1 + (1 − p0 in time with p = 0.4

This behaviour coincides with the discrete one (Figs. 2, 3):Inline graphic Inline graphic

Fig. 2.

Fig. 2

Behaviour of the discrete solution in time Inline graphic and k = 32 with p = 0.5

Fig. 3.

Fig. 3

Behaviour of the discrete solution in time Inline graphic and k = 30 with p = 0.25

Applications

Our global solution readily yields the quantities of interest of the evolution of the process (X t)t ≥ 0 such as the expectation and the second moment of the absorption time, mth moments, fixation probabilities, the probability of coexistence, or the probability of heterogeneity.

Absorption time

Let V 0 : = {0,1} be the domain representing a population of 1 allele. Here, 0 corresponds to the loss of A 1, that is, the fixation of A 2, and 1 corresponds to the opposite situation. Either of these irreverible events is called an absorption.

We denote by Inline graphic the first time when the population has only 1 allele left, that is, when absorption occurs. T 12(p) is a continuous random variable valued in Inline graphic with probability density function denoted by ϕ(tp). V 0 is invariant (absorption set) under the process X t, i.e. if Inline graphic then Inline graphic for all t ≥ s. We have

graphic file with name M88.gif

It follows that

graphic file with name M89.gif

Therefore the expectation of the absorption time for having only one allele is

graphic file with name M90.gif

and its second moment is

graphic file with name M91.gif 26

Remark 4.1

Inline graphic is the unique solution of the one-dimensional boundary value problem

graphic file with name M93.gif

We easily check that this agrees with our formula above by using Mathematica (Fig. 4):Inline graphic

Fig. 4.

Fig. 4

Comparison results of expectation of the absorption time

nth moments

By induction, it is easy to prove that

graphic file with name M94.gif

Therefore, the nth moment is

graphic file with name M95.gif

This nth moment coincides with Kimura’s (1955) one.

Fixation probabilities and probability of coexistence of 2 alleles

The fixation probability for A 2 (loss of A 1) is

graphic file with name M96.gif

Analogously, the fixation probability of A 1 is

graphic file with name M97.gif

The probability of coexistence of the 2 alleles A 1, A 2 therefore is

graphic file with name M98.gif

These three probabilities sum to 1, as they should.

We consider their behaviour for p = 0.3 and p = 0.5 (Figs. 5, 6):

Fig. 5.

Fig. 5

p = 0.3

Fig. 6.

Fig. 6

p = 0.5

Remark 4.2

  • (i)

    Inline graphic

  • (ii)

    Inline graphic and Inline graphic increase quickly in Inline graphic(10N generations) from 0 and then tend slowly to 1 − p and p, respectively;

  • (iii)

    When p = 0.5, the situation is symmetric between the two alleles, that is, Inline graphic

Heterogeneity

The probability of heterogeneity is

graphic file with name M104.gif

Of course, this goes to 0 for Inline graphic as it should.

Conclusion

We have constructed a unique global solution of the Fokker–Planck equation associated with the Wright–Fisher model. This solution leads to explicit formulae for the absorption time, fixation probabilities, the probability of coexistence, nth moments, heterogeneity, and other quantities.

Footnotes

1

Here is a remark for readers not familiar with this mathematical construction: This is a formal definition, as δ p defined in this manner is not a function itself, but rather operates on continuous functions by assigning to them their value at the particular point p. Thus, while the product (fg) had been first defined for square integrable functions fg, we now apply it to the pair (δ pϕ) where δ p is a more general object and in turn ϕ is a more restricted function (continuous instead of simply square integrable).

2

The Gegenbauer polynomials generalise other important classes of polynomials, like the Legendre and the Chebyshev polynomials, and they constitute in turn special cases of the Jacobi polynomials.

The research leading to these results has received funding from the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007-2013)/ERC grant agreement no. 267087. The authors T. D. Tran and J. Hofrichter have been supported by the IMPRS “Mathematics in the Sciences”.

Contributor Information

Tat Dat Tran, Email: trandat@mis.mpg.de.

Julian Hofrichter, Email: julian.hofrichter@mis.mpg.de.

Jürgen Jost, Email: jost@mis.mpg.de.

References

  1. Abramowitz M, Stegun I (1965) Handbook of mathematical functions with formulas, graphs, and mathematical tables. Dover, New York
  2. Amari S, Nagaoka H (2000) Methods of information geometry. In: Translations of mathematical monographs, vol 191. American Mathematical Society, Providence
  3. Ay N, Jost J (2012) Information geometry (in preparation)
  4. Bürger R (2000) The mathematical theory of selection, recombination, and mutation. Wiley, New York
  5. Ewens WJ (2004) Mathematical population genetics I. Theoretical introduction. In: Interdisciplinary applied mathematics, 2nd edn. Springer, New York
  6. Fisher RA. On the dominance ratio. Proc. R. Soc. Edinb. 1922;42:321–341. [Google Scholar]
  7. Jost J (2012) Mathematical methods in biology and neurobiology (in preparation)
  8. Kimura M. Solution of a process of random genetic drift with a continuous model. PNAS–USA. 1955;41(3):144–150. doi: 10.1073/pnas.41.3.144. [DOI] [PMC free article] [PubMed] [Google Scholar]
  9. Kimura M. Random genetic drift in multi-allele locus. Evolution. 1955;9:419–435. doi: 10.2307/2405476. [DOI] [Google Scholar]
  10. Kimura M. Random genetic drift in a tri-allelic locus; exact solution with a continuous model. Biometrics. 1956;12:57–66. doi: 10.2307/3001577. [DOI] [Google Scholar]
  11. Rice S (2004) Evolutionary theory. Sinauer, Sunderland
  12. Suetin PK (2001) Ultraspherical polynomials. In Hazewinkel M (ed) Encyclopaedia of mathematics. Springer, Berlin
  13. Tran TD, Hofrichter J, Jost J (2012) A general solution of the Wright–Fisher model of random genetic drift. arxiv.org/abs/1207.6623
  14. Wright S. Evolution in Mendelian populations. Genetics. 1931;16:97–159. doi: 10.1093/genetics/16.2.97. [DOI] [PMC free article] [PubMed] [Google Scholar]
  15. Wright S. The differential equation of the distribution of gene frequencies. Proc. Natl. Acad. Sci. USA. 1945;31:382–389. doi: 10.1073/pnas.31.12.382. [DOI] [PMC free article] [PubMed] [Google Scholar]

Articles from Theory in Biosciences are provided here courtesy of Springer

RESOURCES