Moran Process¶
Model a finite constant-size population as a discrete birth–death Markov chain in which one type is selected to reproduce and one individual to be replaced, yielding stochastic extinction or fixation under drift and selection.
Core Idea¶
The Moran process is a discrete-time stochastic model for a finite population of fixed size \(N\). In the classical two-type version, one individual is selected for reproduction and one for death or replacement at each step, so the count \(X_t\) of type \(A\) changes by at most one. Moran introduced the overlapping-generation random process as an alternative to models that replace an entire generation at once.
Under neutral sampling, when \(X_t=i\), the upward and downward transition probabilities are both \(i(N-i)/N^2\), with the remaining probability assigned to no change. Without mutation, states \(0\) and \(N\) are absorbing: type \(A\) ultimately becomes extinct or fixed. Its neutral fixation probability from \(i\) copies is \(i/N\).
Scope of Application¶
The process is literal in theoretical population genetics and evolutionary dynamics when finite constant-size populations evolve through asynchronous individual replacement.
- Neutral genetic drift. Calculating extinction, fixation, and absorption times in a finite population.
- Selection. Comparing fixation probabilities under relative-fitness differences.
- Evolutionary games. Allowing fitness to depend on current type frequencies.
- Mutation-selection models. Adding transitions that prevent permanent absorption.
- Evolutionary graph theory. Generalizing reproduction and replacement across a population structure.
- Cancer and microbial evolution models. Describing abstract clonal competition under carefully declared population assumptions, without prescribing experiments.
Clarity¶
Specify population size, ploidy abstraction, types, state variable, time convention, reproduction weighting, death or replacement sampling, whether the same individual can be selected twice, mutation, update order, and spatial structure. Write the transition kernel before quoting fixation results. Distinguish unconditional absorption time from conditional fixation time and state whether formulas count events, generations, or rescaled time.
Manages Complexity¶
A population configuration collapses to a finite-state birth–death chain whose absorption probabilities and times can often be computed exactly. The model isolates drift and selection without tracking genealogies or all individual identities, and the tri-diagonal kernel turns many questions into recurrences rather than an enumeration of full population configurations. It also gives a controlled baseline against which spatial, frequency-dependent, or mutation-bearing variants can be compared one assumption at a time.
Abstract Reasoning¶
- Choose the finite population size and focal type state.
- Declare the reproduction weighting and replacement rule.
- Derive upward, downward, and self-loop probabilities from the current count.
- Verify that each row of the transition kernel sums to one.
- Identify absorbing or mutation-connected boundary states.
- Solve the harmonic recurrence for fixation probability.
- Compute or simulate absorption-time distributions under the same time convention.
- Compare selection, mutation, structure, and update-order variants without conflating them.
Knowledge Transfer¶
The strict parent is Stochastic Process: \(X_t\) is an indexed family of random population states governed by one joint law, with a Markov dependence structure and sample-path/ensemble distinction. Evolutionary Algorithm and Genetic Drift are related applications or regimes, not the taxonomic identity.
Stochastic Process is the strict parent because the Moran trajectory is a time-indexed random state governed by a transition kernel. The transferable skeleton is finite state + random update law + repeated transitions -> distribution over paths and boundary outcomes.
Relationships to Other Abstractions¶
Current abstraction Moran Process Domain-specific
Parents (1) — more general patterns this builds on
-
Moran Process is a kind of Markov Process Prime
The accepted reference-grade review places Moran Process under Markov Process because the child instantiates or depends on the parent's broader structure while retaining its own constitutive identity.
Hierarchy paths (4) — routes to 4 parentless roots
- Moran Process → Markov Process → Stochastic Process
- Moran Process → Markov Process → State and State Transition → Phase Space
- Moran Process → Markov Process → Probability → Measure → Set and Membership
- Moran Process → Markov Process → Probability → Measure → Aggregation → Micro Macro Linkage
Neighborhood in Abstraction Space¶
Moran Process sits in a sparse region of the domain-specific corpus (87th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Population Genetics & Selection (15 abstractions)
Nearest neighbors
- Protected Polymorphism — 0.80
- Hardy-Weinberg Principle — 0.80
- Evolutionary Attractor — 0.80
- Branching process — 0.80
- General selection model — 0.79
Computed from structural-signature embeddings · 2026-09-08