Simon model¶
A stochastic growth model in which new categories enter at a fixed probability while existing categories receive new occurrences in proportion to their current counts, generating a power-law size distribution.
Core Idea¶
The Simon model explains skewed word frequencies, firm sizes, citations, and network degrees through cumulative advantage plus innovation, with the tail exponent determined by the innovation rate under the basic assumptions. At each step one unit arrives; with declared probability it creates a new class, otherwise it joins an existing class selected proportional to size, reinforcing early random advantages. 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¶
Simon model belongs to preferential attachment and applied probability and is useful where the analyst can specify the typed preferential attachment and applied probability carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the discrete time and unit, innovation probability, initial state, class-size count, size-proportional selection rule, normalization, asymptotic regime, tail-exponent convention, and deviations from stationarity are explicit. The scope is broad within that domain but bounded by the need for the discrete time and unit, innovation probability, initial state, class-size count, size-proportional selection rule, normalization, asymptotic regime, tail-exponent convention, and deviations from stationarity 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 the discrete time and unit, innovation probability, initial state, class-size count, size-proportional selection rule, normalization, asymptotic regime, tail-exponent convention, and deviations from stationarity 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 Simon 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 Simon model. Simon 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 preferential attachment and applied probability 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 the discrete time and unit, innovation probability, initial state, class-size count, size-proportional selection rule, normalization, asymptotic regime, tail-exponent convention, and deviations from stationarity are explicit independently of one notation or implementation.
Knowledge Transfer¶
Knowledge transfers strongly among subfields of preferential attachment and applied probability because they reuse the typed preferential attachment and applied probability carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, At each step one unit arrives; with declared probability it creates a new class, otherwise it joins an existing class selected proportional to size, reinforcing early random advantages., and type the carrier, state every parameter and convention in the definition, test that the discrete time and unit, innovation probability, initial state, class-size count, size-proportional selection rule, normalization, asymptotic regime, tail-exponent convention, and deviations from stationarity are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.
Relationships to Other Abstractions¶
Current abstraction Simon model Domain-specific
Parents (1) — more general patterns this builds on
-
Simon model is a kind of Reinforcement Prime
The proposed strict upward parent is
prime:reinforcement.
Hierarchy paths (5) — routes to 5 parentless roots
- Simon model → Reinforcement → Conditioning (Behavioral) → Learning → Adaptation
- Simon model → Reinforcement → Conditioning (Behavioral) → Feedback
- Simon model → Reinforcement → Natural Selection → Selection
- Simon model → Reinforcement → Conditioning (Behavioral) → Learning → Memory Consolidation
- Simon model → Reinforcement → Reward Prediction Error → Prediction Error → Baseline Deviation → Comparison → Self Checking
Neighborhood in Abstraction Space¶
Simon model sits in a crowded region of the domain-specific corpus (33rd percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Machine Learning & Statistical Estimation (24 abstractions)
Nearest neighbors
- Piecewise function — 0.91
- Inverse distribution — 0.90
- Exchangeable random variables — 0.90
- Sure-thing principle — 0.90
- Outcome (probability) — 0.90
Computed from structural-signature embeddings · 2026-09-08