What does Critical Transitions and Resilience conclude, in numbers, about “Tight Coupling and Modularity: Normal Accidents and High Reliability”?
Answer: The firebreak is real, but it is pronounced only when cross-module links are very few. With \(\mu = 0.01\) (about 12 cross-module links in the whole network), a mean of 35 nodes fail, nearly two thirds (65 %) of failures stay within the starting module, and the chance that more than 100 nodes fail is only 6 %. With 5 % cross-module links, the mean rises to 136 failed nodes and the chance of more than 100 to 54 %; at 10 % the network differs little from a fully random one (\(\mu = 0.9\)). A handful of cross-module links is enough to carry the failure out.
Scope of the numbers: The book is not medical advice and makes no investment or financial forecasts; its business and physiological examples are analogies. Marked boxes separate published evidence, runnable Python calculations (15 programs, all checked), classical sources and the author's hypotheses.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 0.01, 100, 35, 54
| mu | mean failed | P(> 1 module hit) | modules hit | P(> 100 failed) | mean path length |
| 0.01 | 34.9 | 35% | 1.6 | 6% | 7.64 |
| 0.03 | 84.0 | 60% | 3.7 | 34% | 5.50 |
| 0.05 | 136.1 | 68% | 5.6 | 54% | 4.89 |
| 0.10 | 199.3 | 76% | 7.4 | 70% | 4.29 |
| 0.20 | 201.4 | 76% | 7.3 | 69% | 3.87 |
| 0.50 | 212.1 | 80% | 7.6 | 72% | 3.58 |
| 0.90 | 218.6 | 84% | 7.8 | 74% | 3.55 |
Show the full program
# Modularity as a firebreak, and what it costs. 400 nodes in 10 modules of 40; 1,200 links
# (mean degree 6); a share mu of the links joins different modules. A failure starts at one
# random node and passes along each link once with probability beta = 0.3 (independent
# cascade, i.e. bond percolation). 400 runs per mu (20 networks x 20 seeds). Cost of modularity:
# mean shortest-path length between nodes (longer = slower help, slower information).
import random
from collections import deque
rng = random.Random(13)
N, M, LINKS, BETA = 400, 10, 1200, 0.3
def network(mu):
adj = [set() for _ in range(N)]; size = N // M; n = 0
while n < LINKS:
a = rng.randrange(N); home = (a // size) * size
if rng.random() < mu: # a random node in another module
b = (home + size + rng.randrange(N - size)) % N
else: # a random node in the same module
b = home + rng.randrange(size)
if a != b and b not in adj[a]: adj[a].add(b); adj[b].add(a); n += 1
return adj
def spread(adj, seed):
hit, q = {seed}, deque([seed])
while q:
v = q.popleft()
for w in adj[v]:
if w not in hit and rng.random() < BETA: hit.add(w); q.append(w)
return hit
def mean_path(adj, sources=25):
tot = cnt = 0
for s in rng.sample(range(N), sources):
d = {s: 0}; q = deque([s])
while q:
v = q.popleft()
for w in adj[v]:
if w not in d: d[w] = d[v] + 1; q.append(w)
tot += sum(d.values()); cnt += len(d) - 1
return tot / cnt
print(" mu mean failed P(> 1 module hit) modules hit P(> 100 failed) mean path length")
for mu in (0.01, 0.03, 0.05, 0.1, 0.2, 0.5, 0.9):
sizes, multi, mods, paths = [], 0, 0, []
for _ in range(20):
adj = network(mu); paths.append(mean_path(adj))
for _ in range(20):
h = spread(adj, rng.randrange(N))
m = len({v // (N // M) for v in h})
sizes.append(len(h)); multi += m > 1; mods += m
n = len(sizes)
big, path = sum(s > 100 for s in sizes) / n, sum(paths) / len(paths)
print(f" {mu:4.2f} {sum(sizes) / n:6.1f} {multi / n:4.0%}"
f" {mods / n:4.1f} {big:4.0%} {path:4.2f}")Single source and citation
Fan, Y. (2026). Phase Transitions, Critical Slowing Down and Resilience in Complex Dynamical Systems (Version 1.0.0), Chapter 6: Tight Coupling and Modularity: Normal Accidents and High Reliability. 5D Library. https://doi.org/10.5281/zenodo.23770082
DOI: 10.5281/zenodo.23770082 · Read the monograph · 5DL-B-028 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026028,
author = {Fan, Yafu},
title = {Phase Transitions, Critical Slowing Down and Resilience in Complex Dynamical Systems},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.23770082},
url = {https://doi.org/10.5281/zenodo.23770082}
}Other chapter answers in this book
- Chapter 1 · Folds, Hysteresis and Flips That Are Hard to Undo
- Chapter 2 · Critical Slowing Down: Why Recovery Gets Slower
- Chapter 3 · The Limits of Early Warning: Signal to Noise, Selection Bias and Flips Without Warning
- Chapter 4 · Two Kinds of Resilience: Recovering Quickly or Withstanding the Blow
- Chapter 5 · Cascading Failure: Spare Capacity and Interdependence
- Chapter 8 · Practice and a Pre-registered Trial