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.
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.
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¶
- 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) — more general patterns this builds on
-
Bak–Sneppen model is a kind of Tipping Points (or Phase Transitions) Prime
The proposed strict upward parent is
prime:tipping_points_or_phase_transitions.
Hierarchy path (1) — routes to 1 parentless root
- Bak–Sneppen model → Tipping Points (or Phase Transitions) → State and State Transition → Phase Space
Neighborhood in Abstraction Space¶
Bak–Sneppen model sits in a moderately populated region (47th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.
Family — Network Evolution & Community Structure (19 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-09-08