---
slug: convergence-encyclopedia-c11
title: Convergence Encyclopedia: C11 — Networks / Small-World / Scale-Free
canonical: https://miscsubjects.com/a/convergence-encyclopedia-c11
---

**F1 — Tier.** T1 (small-world phenomenon); T1 (scale-free claim, with Clauset caution). Uncertainty flag: The scale-free property is less ubiquitous than initially claimed; many networks are better described by alternative distributions.

**F2 — Sources.** 
- Euler, L. (1736). “Solutio problematis ad geometriam situs pertinentis.” Commentarii Academiae Scientiarum Petropolitanae, 8, 128–140.
- Watts, D.J. & Strogatz, S.H. (1998). “Collective dynamics of ‘small-world’ networks.” Nature, 393(6684), 440–442.
- Barabasi, A.L. & Albert, R. (1999). “Emergence of scaling in random networks.” Science, 286(5439), 509–512.
- Granovetter, M.S. (1973). “The strength of weak ties.” American Journal of Sociology, 78(6), 1360–1380.

**F3 — Domains.** Neural networks (brain connectome), internet routing, food webs, metabolic networks, scientific collaboration networks, social networks, power grids.

**F4 — Scale.** Protein interaction networks (~10³ nodes) → World Wide Web (~10¹² nodes); neural circuits (~10⁴ neurons) → human brain (~10¹¹ neurons).

**F5 — Falsifier.** A large adaptive network (≥10⁴ nodes, evolving under selection pressure) that is demonstrably neither small-world (high average path length, low clustering) nor approximately scale-free in degree distribution. If such networks are common and functional, the convergence claim weakens.

**F6 — Rival (strongest form).** Network properties are statistical artifacts of growth processes, not deep structural principles. Preferential attachment (Barabasi-Albert) produces power-law degree distributions, but so do many other growth mechanisms. More critically: Clauset, Shalizi & Newman (2009) SIAM Review 51:661 showed that many claimed scale-free networks do not survive rigorous statistical fitting. The “scale-free” property is often an artifact of log-binning or insufficient data. Small-worldness is more robust but may be a trivial consequence of sparse random graphs with local clustering. CITED.

**F7 — Independence.** HIGH — with caveat. Euler (mathematics, 1736 — founding graph theory), Watts-Strogatz (sociology/applied math, Cornell, 1998), and Barabasi (physics, Notre Dame, 1999) arrived independently. BUT: all employ graph theory — this is a shared mathematical framework, a hidden common cause. The independence assessment is HIGH for the empirical discoveries (small-world, preferential attachment); MODERATE for the formal framework.

**F8 — Pattern type.** Mathematical.

**F9 — Maps.** A3 (pattern-dynamics), A7 (pattern geometry).

---

## Corpus map
- Previous: [Convergence Encyclopedia: C10](/a/convergence-encyclopedia-c10)
- Next: [Convergence Encyclopedia: C12](/a/convergence-encyclopedia-c12)
- Encyclopedia start: [The Schema](/a/convergence-encyclopedia-schema)
- Same node, other planes: [Catalogue node C11](/a/oip-node-c11-networks-small-world-scale-free) · [Catalogue hub](/a/oip-convergence-public-article)
- Edges touching C11: [convergence edge 8](/a/oip-convergence-edge-8) · [convergence edge 9](/a/oip-convergence-edge-9)
- Kin corpora: [Total Structure](/a/oip-total-structure) · [Signature of the Grain](/a/oip-sog-preamble-axioms)
