The Law of Large Numbers in Complex Systems: From Statistical Convergence to Compressed Models
Bibliographic record
Abstract
This paper, originally written in 2021 and substantially reworked in 2026, demonstrates that complex adaptive systems — biological, cognitive, and social — systematically violate the conditions required by the law of large numbers (independence, identical distribution, finite expectation), and that these violations are structurally entailed by the requirements of persistence rather than incidental. We introduce agent replaceability R(a) as a formal measure of the degree to which a system component's structural contribution can be recovered after loss, and show that decreasing replaceability forces a transition from population-level statistical averaging (the "LLN-strategy") to individual-level Bayesian inference with strong priors (the "model-strategy"). A scale-dependent compressibility criterion based on Kolmogorov complexity provides a non-circular characterization of this transition: the model-strategy becomes necessary when the environment contains compressible structure at the agent's operational scale that statistical averaging would destroy. The central theoretical contribution is the encapsulation principle: the two strategies are not alternatives but hierarchical levels of a single architecture. Every internal model is a compressed encoding of statistical regularities accumulated through an LLN-process at a longer timescale — many cheap trials → compression into model parameters → one costly action. The law of large numbers is never abandoned; it descends to a lower floor of the system's organization. This nesting is demonstrated to be recursive. Cognitive biases are shown to be Bayesian-optimal under strong priors and asymmetric loss functions, not deviations from rationality. Concrete case studies include bacterial chemotaxis (transitional case), feline ballistic motor control (full model-strategy with cerebellar forward/inverse models), microgravity experiments revealing the hierarchical failure modes of internal models under distributional shift, and neural-network robotics providing substrate-independent experimental confirmation — robots trained solely for viability spontaneously invented gait transitions. Six testable predictions are derived, including a maladaptation prediction from the encapsulation principle. The framework unifies probability theory, non-equilibrium thermodynamics, Kolmogorov complexity, predictive processing, and evolutionary biology within a single formal architecture. Part of the Unified Structural Theory of Complex Systems research program. Keywords: law of large numbers, Bayesian inference, Kolmogorov complexity, encapsulation principle, replaceability, persistence, predictive processing, cognitive heuristics, motor control, microgravity, robotics, non-equilibrium thermodynamics License: Creative Commons Attribution 4.0 International (CC BY 4.0) Author – Boris Kriger¹²¹ Information Physics Institute, Gosport, Hampshire, United Kingdom boris.kriger@informationphysicsinstitute.net² Institute of Integrative and Interdisciplinary Research, Toronto, Canadaboriskriger@interdisciplinary-institute.org
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.005 | 0.039 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.007 |
| Scholarly communication | 0.003 | 0.007 |
| Open science | 0.001 | 0.003 |
| Research integrity | 0.002 | 0.004 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".