Bak–Sneppen model

An extremal coevolution model that repeatedly replaces the least-fit species and its neighbors, self-organizing toward a critical fitness threshold and avalanche dynamics.

Version

v2 · 2026-09-19 · History

Domain-specific #

3398

Domain group

Interdisciplinary & Synthetic

Origin domain

Systems Thinking & Cybernetics

Subdomain

Complex Systems Modeling → Systems Thinking & Cybernetics

Core Idea

The Bak–Sneppen model assigns random fitness values on a graph, selects the current minimum at each step, and redraws it with adjacent values, producing punctuated cascades without externally tuning a control parameter. Extremal selection removes the lowest barrier, neighbor coupling propagates updates, and the population’s distribution develops a gap whose boundary organizes scale-free avalanche statistics. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

How would you explain it like I'm…

Lowest Score Swap Game

Imagine kids standing in a circle, each holding a card with a random score. Every turn, the kid with the lowest score gets a new card, and so do the two kids next to them. Sometimes that causes only a little change, but sometimes it sets off a long chain of changes around the circle, small and huge ones, all without anyone turning a knob.

Chain-Reaction Fitness Game

The Bak–Sneppen model is a simple computer game about change spreading through a group. Picture spots on a map or in a ring, each linked to its neighbors and each given a random 'fitness' number. At every step you find the spot with the lowest fitness and give it a new random number, and you also give new random numbers to its neighbors. Over time, most numbers end up above a certain level, and when a low one appears, it can set off a burst of changes called an avalanche. These avalanches come in all sizes, from tiny to huge, and the system arranges itself this way on its own, without anyone having to tune a setting just right.

Extremal Avalanche Model

The Bak-Sneppen model places random fitness values on the nodes of a graph (for example, a ring). At each step it finds the node with the minimum fitness and gives it and its neighbors new random values. This 'extremal' rule always removes the weakest barrier, and the neighbor coupling spreads changes through the system. Over time, the distribution of fitness values develops a gap: nearly all values end up above a threshold. Activity comes in 'avalanches' of connected updates below that threshold, and their sizes follow scale-free (power-law) statistics, all without tuning any outside control parameter. This is an example of self-organized behavior producing punctuated, burst-like change.

 

The Bak–Sneppen model assigns random fitness values to the sites of a graph, and at each time step selects the site with the current minimum, redrawing its value and the values of its adjacent sites from the fitness distribution. Extremal selection eliminates the lowest barrier, while neighbor coupling propagates updates through the network. In the stationary state, the fitness distribution develops a gap: values accumulate above a threshold, and the boundary of this gap organizes avalanches — sequences of updates below the threshold — whose sizes and durations follow scale-free statistics. The resulting punctuated cascades emerge without externally tuning a control parameter. Rigorous statements depend on specifying the graph and neighborhood, the fitness distribution, the update and time conventions, the threshold definition, the avalanche observable, and how finite-size effects and stationarity are treated.

Scope of Application

Bak–Sneppen model belongs to complex systems modeling and is useful where the analyst can specify the typed complex systems modeling carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate graph, neighborhood, fitness distribution, extremal update, time convention, threshold definition, avalanche observable, finite-size treatment, and stationarity claim are explicit. The scope is broad within that domain but bounded by the need for graph, neighborhood, fitness distribution, extremal update, time convention, threshold definition, avalanche observable, finite-size treatment, and stationarity claim are explicit. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Clarity

The abstraction clarifies a crowded vocabulary by making graph, neighborhood, fitness distribution, extremal update, time convention, threshold definition, avalanche observable, finite-size treatment, and stationarity claim are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Bak–Sneppen model can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

Manages Complexity

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Bak–Sneppen model. Bak–Sneppen model compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning

1. Identify the carrier. State what the elements, states, objects, or observations are: the typed complex systems modeling carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
2. Lock the constitutive rule. Express graph, neighborhood, fitness distribution, extremal update, time convention, threshold definition, avalanche observable, finite-size treatment, and stationarity claim are explicit independently of one notation or implementation.

Knowledge Transfer

Knowledge transfers strongly among subfields of complex systems modeling because they reuse the typed complex systems modeling carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, Extremal selection removes the lowest barrier, neighbor coupling propagates updates, and the population’s distribution develops a gap whose boundary organizes scale-free avalanche statistics., and type the carrier, state every parameter and convention in the definition, test that graph, neighborhood, fitness distribution, extremal update, time convention, threshold definition, avalanche observable, finite-size treatment, and stationarity claim are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions

Current abstraction Bak–Sneppen model Domain-specific

Parents (1) — outgoing typed relations

• Bak–Sneppen model is a kind of Tipping Points (or Phase Transitions) Prime

  It remains its own entry because its identity is fixed by graph, neighborhood, fitness distribution, extremal update, time convention, threshold definition, avalanche observable, finite-size treatment, and stationarity claim.

Hierarchy path (1) — routes to 1 parentless root

• Bak–Sneppen model → is a kind of Tipping Points (or Phase Transitions) → presupposes State and State Transition → includes Phase Space

Neighborhood in Abstraction Space

Bak–Sneppen model sits in a crowded region of the domain-specific corpus (28^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Graphical & Network Models of Dependence (16 abstractions)

Nearest neighbors

• Local World Evolving Network Models — 0.89
• Decentralised system — 0.89
• Fitness model (network theory) — 0.89
• Modularity (networks) — 0.88
• Signal-flow graph — 0.88

Computed from structural-signature embeddings · 2026-10-25