Evolutionary Dynamics

⚡ Key Takeaways

Evolutionary dynamics is the mathematical study of how the frequencies of competing types (genes, strategies, phenotypes, replicators) change over time under selection, mutation, recombination, and stochastic drift. Key result: in deterministic infinite populations, selection drives frequencies according to the replicator equation, whose rest points and stability connect directly to Nash equilibria; in finite populations, fixation probabilities and the Moran process govern fate. Applies to population genetics, game theory, ecology, epidemiology, cancer biology, and cultural evolution. Founded by Fisher, Wright, Haldane (1920s–30s) and extended by Maynard Smith, Price, Hofbauer & Sigmund, and Nowak.

💡 The Core Insight

Replication plus selection equals a flow on the probability simplex in which each type's growth rate is its fitness relative to the population mean. Whenever fitness depends on the frequencies themselves — i.e., the payoff to a strategy depends on what everyone else is doing — the dynamics become a game, and the fixed points of the flow coincide with the equilibria of that game. Finiteness adds noise: drift can fix a deleterious type or eliminate an advantageous one, so "survival of the fittest" becomes a statement about probabilities, not certainties.

Formal Statement

DefinitionThe Replicator Equation

Let the population consist of nn types with frequencies collected in x=(x1,…,xn)x=(x_1,\dots,x_n) living on the simplex

1
Sn={x∈Rn:xi≥0, ∑i=1nxi=1}.\quad S_n = \Big\{ x\in\mathbb{R}^n : x_i\ge 0,\ \textstyle\sum_{i=1}^n x_i = 1 \Big\}.

Derivation hint: the constraints are nonnegativity of frequencies and normalization; SnS_n is an (n−1)(n-1)-dimensional standard simplex. Let fi(x)f_i(x) be the fitness (per-capita reproductive rate) of type ii, and let

2
fˉ(x)=∑j=1nxj fj(x)\quad \bar{f}(x) = \sum_{j=1}^n x_j\, f_j(x)

be the mean population fitness. The replicator equation is

3
x˙i=xi(fi(x)−fˉ(x)),i=1,…,n.\quad \dot{x}_i = x_i\big(f_i(x) - \bar{f}(x)\big), \qquad i=1,\dots,n.

Derivation hint: start from unnormalized abundances n˙i=nifi\dot n_i = n_i f_i with total N=∑njN=\sum n_j; differentiate xi=ni/Nx_i=n_i/N using the quotient rule and substitute N˙/N=fˉ\dot N/N = \bar f. Here fif_i may be frequency-independent (constant — pure selection) or frequency-dependent (a game). In the linear game case fi(x)=(Ax)i=∑jaijxjf_i(x)=(Ax)_i=\sum_j a_{ij}x_j, where A=(aij)A=(a_{ij}) is the payoff matrix giving the payoff to type ii against type jj.

DefinitionEvolutionarily Stable Strategy (ESS)

A strategy x∗∈Snx^\ast\in S_n is an ESS if for every x≠x∗x\neq x^\ast in a neighborhood,

4
x∗⊤Ax>x⊤Ax.\quad x^{\ast\top}A x > x^\top A x .

Equivalently (Maynard Smith's two conditions): for all x≠x∗x\neq x^\ast,

5
x⊤Ax∗≤x∗⊤Ax∗,and if equality holds thenx⊤Ax<x∗⊤Ax.\quad x^\top A x^\ast \le x^{\ast\top} A x^\ast,\quad\text{and if equality holds then}\quad x^\top A x < x^{\ast\top} A x.

Derivation hint: the equilibrium (first) condition is Nash; the stability (second) condition handles neutral alternative best replies by requiring the resident to beat the mutant in mutant-dominated populations. Expand fˉ\bar f of a perturbed population (1−ϵ)x∗+ϵx(1-\epsilon)x^\ast+\epsilon x and require it to invade.

TheoremFolk Theorem of Evolutionary Game Theory

For the replicator dynamics [3] with linear fitness f=Axf=Ax on SnS_n: 1. If x∗x^\ast is a Nash equilibrium, it is a rest point of [3]. 2. If x∗x^\ast is the limit of an interior orbit as t→∞t\to\infty, it is a Nash equilibrium. 3. If x∗x^\ast is Lyapunov stable, it is a Nash equilibrium. 4. If x∗x^\ast is an ESS, it is asymptotically stable. The converse of (4) fails: asymptotic stability does not imply ESS for n≥3n\ge 3 in mixed strategies (though it does for the single-population symmetric case under certain conditions).

TheoremEquivalence: Replicator and Lotka–Volterra

The replicator equation on SnS_n in nn variables is topologically equivalent (via a diffeomorphism removing one dimension) to the generalized Lotka–Volterra equation in n−1n-1 variables:

6
y˙k=yk(rk+∑l=1n−1bkl yl),k=1,…,n−1.\quad \dot{y}_k = y_k\Big( r_k + \sum_{l=1}^{n-1} b_{kl}\, y_l \Big),\qquad k=1,\dots,n-1.

Derivation hint: set yk=xk/xny_k = x_k/x_n, differentiate the ratio, substitute [3], and absorb constants; the map Sn∘→R>0n−1S_n^{\circ}\to\mathbb{R}^{n-1}_{>0} is the Hofbauer transformation.

Why It Holds / Derivation

ProofDeriving the Replicator Equation

Step 1 — Unnormalized growth. Let ni(t)≥0n_i(t)\ge 0 be the abundance (number) of type ii, growing at per-capita rate fif_i:

7
n˙i=ni fi(x).\quad \dot{n}_i = n_i\, f_i(x).

Derivation hint: this is the defining assumption of exponential per-capita reproduction with rate equal to fitness.

Step 2 — Total population. Let N=∑jnjN=\sum_j n_j. Summing [7],

8
N˙=∑jn˙j=∑jnjfj=N fˉ(x),\quad \dot{N} = \sum_j \dot n_j = \sum_j n_j f_j = N\,\bar f(x),

using xj=nj/Nx_j = n_j/N so ∑jnjfj=N∑jxjfj=Nfˉ\sum_j n_j f_j = N\sum_j x_j f_j = N\bar f. Derivation hint: factor out NN and recognize the frequency-weighted mean.

Step 3 — Quotient rule. With xi=ni/Nx_i = n_i/N,

9
x˙i=n˙iN−niN˙N2=niN(n˙ini−N˙N)=xi(fi−fˉ).\quad \dot{x}_i = \frac{\dot n_i N - n_i \dot N}{N^2} = \frac{n_i}{N}\Big(\frac{\dot n_i}{n_i} - \frac{\dot N}{N}\Big) = x_i\big(f_i - \bar f\big).

Derivation hint: divide numerator and denominator by NN and substitute [7] and [8].

Step 4 — Invariance of the simplex. Check ∑ix˙i=∑ixifi−fˉ∑ixi=fˉ−fˉ=0\sum_i \dot x_i = \sum_i x_i f_i - \bar f \sum_i x_i = \bar f - \bar f = 0, so ∑ixi\sum_i x_i is conserved; and xi=0⇒x˙i=0x_i=0 \Rightarrow \dot x_i = 0, so each face is invariant. Hence SnS_n is forward-invariant. ■\blacksquare

∎
ProofESS implies Asymptotic Stability under Replicator Dynamics

Step 1 — Candidate Lyapunov function. For an interior ESS x∗x^\ast, define the relative entropy (Kullback–Leibler divergence)

10
V(x)=∑i: xi∗>0xi∗ln⁡ ⁣xi∗xi≥0,\quad V(x) = \sum_{i:\,x_i^\ast>0} x_i^\ast \ln\!\frac{x_i^\ast}{x_i} \ge 0,

with V(x)=0V(x)=0 iff x=x∗x=x^\ast (Gibbs inequality). Derivation hint: KL divergence is nonnegative and vanishes only at equality of distributions; it is the natural information-geometric distance on the simplex.

Step 2 — Time derivative. Differentiate along [3]:

11
V˙=−∑ixi∗x˙ixi=−∑ixi∗(fi−fˉ)=−(x∗⊤Ax−x⊤Ax).\quad \dot V = -\sum_i x_i^\ast \frac{\dot x_i}{x_i} = -\sum_i x_i^\ast\big(f_i-\bar f\big) = -\big(x^{\ast\top}Ax - x^\top A x\big).

Derivation hint: x˙i/xi=fi−fˉ\dot x_i/x_i = f_i-\bar f; then ∑ixi∗fi=x∗⊤Ax\sum_i x_i^\ast f_i = x^{\ast\top}Ax and ∑ixi∗fˉ=fˉ=x⊤Ax\sum_i x_i^\ast\bar f = \bar f = x^\top Ax.

Step 3 — Sign from the ESS condition. By the ESS inequality [4], x∗⊤Ax>x⊤Axx^{\ast\top}Ax > x^\top Ax for x≠x∗x\neq x^\ast in a neighborhood, hence V˙<0\dot V < 0 there. By Lyapunov's theorem x∗x^\ast is asymptotically stable. ■\blacksquare

∎
mathematician · John Maynard Smith | 1920–2004

Trained first as an aeronautical engineer, Maynard Smith turned to biology under J.B.S. Haldane. With George Price he introduced the evolutionarily stable strategy in the 1973 Nature paper "The Logic of Animal Conflict," importing von Neumann–Morgenstern game theory into Darwinian biology. His 1982 book Evolution and the Theory of Games established the field. Crucially, ESS reframed evolution: an equilibrium is not what is best for the species but what cannot be invaded by a rare mutant — a strictly individual-selectionist, dynamical notion that dissolved much loose "good of the species" thinking.

Building Intuition

🧠 Intuition

Picture the simplex SnS_n as the arena. A population is a single point; evolution moves it. The replicator equation says each coordinate grows in proportion to how much it beats the average. Above-average types swell; below-average types shrink; the average itself rises whenever fitness is constant (Fisher's theorem). Geometrically, the flow is a "fitness gradient" warped by the metric of the simplex. Now make fitness frequency-dependent and the landscape deforms as you walk on it — like trying to climb a hill that sinks where you step. This is why frequency-dependent selection can produce stable coexistence (negative frequency dependence, the rare type wins) or oscillation (rock–paper–scissors, no type is ever best). The ESS is the place where, having arrived, no rare invader can do better — a fixed point that is also a "no regret" condition. In finite populations, replace the smooth flow with a noisy walk on a lattice of integer counts. Now the destiny of a type is a gambler's ruin problem: it either fixes (reaches frequency 1) or vanishes. Selection biases the coin; drift keeps flipping it.

Figure
Replicator flow on the 1-simplex for a coordination game: two stable rest points at the corners separated by an unstable interior equilibrium x∗x^\ast.
x=0 x=1 x* dx/dt = x(1-x)(f₁-f₂) flow ← flow → Bistability: basin boundary at unstable x*

Worked Examples

ExampleHawk–Dove Game: Finding the ESS and the Equilibrium Frequency

Given. Two strategies contest a resource of value V=2V=2. Cost of injury in an escalated fight C=6C=6. Payoff matrix (row = focal, column = opponent):

HawkDove
Hawk(V−C)/2=−2(V-C)/2 = -2V=2V = 2
Dove00V/2=1V/2 = 1

So A=(−2201)A=\begin{pmatrix} -2 & 2\\ 0 & 1\end{pmatrix}.

Step 1 — Pure strategies. Hawk is not an ESS since Hawk-vs-Hawk payoff −2<-2 < Dove-vs-Hawk payoff 00. Dove is not an ESS since Hawk invades Dove (Hawk-vs-Dove 2>2 > Dove-vs-Dove 11). So the ESS is mixed.

Step 2 — Indifference (interior Nash). Let pp = frequency of Hawk. A mixed ESS requires equal payoffs to Hawk and Dove:

payoff(Hawk)=−2p+2(1−p),payoff(Dove)=0⋅p+1⋅(1−p).\text{payoff(Hawk)} = -2p + 2(1-p),\qquad \text{payoff(Dove)} = 0\cdot p + 1\cdot(1-p).

Set equal:

−2p+2−2p=1−p  ⇒  −4p+2=1−p  ⇒  −3p=−1.-2p + 2 - 2p = 1 - p \;\Rightarrow\; -4p + 2 = 1 - p \;\Rightarrow\; -3p = -1.

Step 3 — Solve.

p∗=13.p^\ast = \tfrac{1}{3}.

General formula: p∗=V/C=2/6=1/3.p^\ast = V/C = 2/6 = 1/3. ✓

Step 4 — Stability. With V<CV<C this interior point is an ESS (since the off-diagonal advantage gives negative frequency dependence: rare Hawks do well, common Hawks do badly).

pHawk∗=13 (dimensionless frequency), an ESS\boxed{p^\ast_{\text{Hawk}} = \tfrac{1}{3} \text{ (dimensionless frequency), an ESS}}
ExampleMoran Process: Fixation Probability of an Advantageous Mutant

Given. A finite population of N=100N=100 individuals, two types: resident (fitness 1) and mutant with relative fitness r=1.05r=1.05 (5% advantage). One mutant appears. Use the constant-fitness Moran process.

Step 1 — Fixation probability formula. For a single mutant of fitness rr in a Moran population of size NN, the probability that it fixes is

12
ρ=1−1/r1−1/rN.\quad \rho = \frac{1 - 1/r}{1 - 1/r^{N}}.

Derivation hint: solve the gambler's-ruin recursion for the birth–death chain whose ratio of down-to-up transition rates is 1/r1/r, with absorbing boundaries at 00 and NN.

Step 2 — Plug in. 1/r=1/1.05=0.952381/r = 1/1.05 = 0.95238. Then 1−1/r=0.0476191 - 1/r = 0.047619. 1/rN=(0.95238)1001/r^{N} = (0.95238)^{100}. Compute ln⁡(0.95238)=−0.048790\ln(0.95238)= -0.048790, times 100=−4.8790100 = -4.8790, so 1/r100=e−4.8790=0.0076001/r^{100} = e^{-4.8790}= 0.007600. Then 1−1/r100=0.992401 - 1/r^{100} = 0.99240.

Step 3 — Divide.

ρ=0.0476190.99240=0.04798.\rho = \frac{0.047619}{0.99240} = 0.04798.

Step 4 — Interpret. A mutant with a 5% advantage fixes only ~4.8% of the time — about the naive selection coefficient s=0.0476≈(r−1)/rs=0.0476\approx (r-1)/r. Compare neutral case ρneutral=1/N=0.01\rho_{\text{neutral}} = 1/N = 0.01. So selection multiplies the fixation chance roughly fivefold but most beneficial mutants are still lost to drift.

ρ≈0.048 (dimensionless probability)\boxed{\rho \approx 0.048 \text{ (dimensionless probability)}}

Common Misconceptions

⚠️ Common mistake

"Evolution maximizes fitness / the population always climbs uphill." This is true only for frequency-independent selection of a single locus (Fisher's Fundamental Theorem, and only for the additive component of variance). With frequency dependence the mean fitness can decrease over time, orbits can cycle (rock–paper–scissors), and the dynamics can converge to a state where everyone is worse off (the Prisoner's Dilemma drives the population to mutual defection). There is no global Lyapunov function in general; "fitness landscapes" as static hills are a frequency-independent fiction.

⚠️ Common mistake

"ESS, Nash equilibrium, and asymptotically stable rest point are the same thing." They form a strict hierarchy: ESS ⇒\Rightarrow asymptotically stable ⇒\Rightarrow Nash ⇒\Rightarrow rest point, and none of the reverse implications hold in general. A rest point need not be Nash (e.g., a saddle); a Nash equilibrium need not be asymptotically stable (a center, as in matching pennies); and an asymptotically stable point need not be an ESS once n≥3n\ge 3.

CounterexampleRock–Paper–Scissors: No ESS, Perpetual Cycling

Take the zero-sum cyclic payoff matrix

A=(0−1110−1−110).A = \begin{pmatrix} 0 & -1 & 1\\ 1 & 0 & -1\\ -1 & 1 & 0\end{pmatrix}.

The unique Nash equilibrium is the centroid x∗=(1/3,1/3,1/3)x^\ast=(1/3,1/3,1/3), but it is not an ESS — there is no neighborhood where x∗⊤Ax>x⊤Axx^{\ast\top}Ax>x^\top Ax since the game is zero-sum and the equilibrium is a center. Under replicator dynamics the orbits are closed periodic curves around x∗x^\ast (the function ∏ixi\prod_i x_i is conserved), so the population cycles forever Rock→Paper→Scissors→Rock and never settles. If the matrix is perturbed so the diagonal sum is slightly positive, x∗x^\ast becomes asymptotically stable but still not an ESS — concretely refuting "asymptotically stable ⇒\Rightarrow ESS."

Connections

connection

Evolutionary dynamics sits at a crossroads of several fields. The replicator equation is formally a Lotka–Volterra Equations system after a coordinate change [6], tying selection to predator–prey ecology. Its fixed-point theory is exactly Nash Equilibrium of the underlying game, making it the dynamic counterpart of static Game Theory. The KL-divergence Lyapunov function [10] reveals an Information Geometry structure — the replicator flow is gradient ascent in the Shahshahani (Fisher) metric. In finite populations the Moran Process and Wright–Fisher Model connect to Markov Chains and gambler's-ruin theory, while diffusion limits link to the Fokker–Planck Equation via Kimura's diffusion approximation. The adaptive-dynamics extension feeds into Bifurcation Theory through evolutionary branching.

Real-World Applications

🔬 Where this appears

Historical Development

⏳ History
- 1922–1930 — R.A. Fisher. Diffusion treatment of gene frequencies; the Fundamental Theorem of Natural Selection (1930) linking the rate of fitness increase to additive genetic variance.
- 1931 — Sewall Wright. Introduces the adaptive landscape and the role of random drift in small populations; the Wright–Fisher model of finite-population sampling.
- 1932 — J.B.S. Haldane. The Causes of Evolution; quantitative selection coefficients and the mathematical synthesis of Mendelism and Darwinism.
- 1958 — P.A.P. Moran. Introduces the Moran birth–death process, giving a clean finite-population Markov chain with tractable fixation probabilities [12].
- 1962 — Motoo Kimura. Diffusion approximation for fixation probabilities; later (1968) the neutral theory of molecular evolution, foregrounding drift.
- 1970 — George R. Price. The Price equation, a covariance identity decomposing evolutionary change into selection and transmission terms — the most general statement of evolutionary dynamics.
- 1973 — Maynard Smith & Price. "The Logic of Animal Conflict" defines the ESS; game theory enters biology.
- 1978 — Taylor & Jonker; Hofbauer, Schuster, Sigmund. Formulate the replicator equation as a dynamical system and prove the link to ESS and Lotka–Volterra.
- 1998–2006 — Hofbauer & Sigmund; Nowak. Evolutionary Games and Population Dynamics (1998) and Nowak's Evolutionary Dynamics (2006) consolidate the field, adding evolutionary graph theory (2005, fixation on networks) and the unification of finite/infinite, deterministic/stochastic frameworks.

Subtleties & Limits

open-problem

Finite-population, structured, and non-equilibrium frontiers. Several deep questions remain open or only partially resolved:

  • Evolutionary graph theory. Fixation probabilities depend on population structure; certain graphs ("amplifiers of selection," e.g., stars) boost ρ\rho while others suppress it. A full classification of which graphs amplify versus suppress for arbitrary games (including frequency-dependent fitness) is incomplete, and the existence of "superamplifiers" robust to mutation remains debated.
  • The strategy-of-evolution problem. For games with n≥4n\ge 4 strategies, replicator dynamics can exhibit chaos (Hofbauer–Sigmund); characterizing parameter regions of chaotic versus convergent behavior, and what this means biologically, is unsettled.
  • Stochastic stability and timescale separation. When mutation, selection, and drift act on disparate timescales, the long-run distribution (stochastically stable states, à la Foster–Young / Fudenberg–Imhof) can differ from any deterministic prediction; rigorous results exist only for special classes.
  • Multilevel selection and the Price equation closure. The Price equation is exact but not closed (the transmission term requires its own dynamics); a fully predictive multilevel theory reconciling individual and group selection is still contested.
  • Eco-evolutionary feedback. Coupling population size dynamics to frequency dynamics (eco-evolutionary models) breaks the simplex-invariance assumption; generic conditions for evolutionary branching, coexistence, and evolutionary suicide under such feedback are an active research area in adaptive dynamics.

See Also

Replicator Equation · Nash Equilibrium · Lotka–Volterra Equations · Moran Process · Price Equation · Adaptive Dynamics · Evolutionary Graph Theory · Information Geometry · Population Genetics · Game Theory