关于「紧耦合与模块化:常态事故与高可靠性」,《临界转变与韧性》给出的定量结论是什么?
结论:防火墙的作用是真实的,但只在跨模块的连接很少时才明显。\(\mu = 0.01\)(全网只有约 12 条跨模块连接)时,平均失效 35 个节点,近三分之二(65%)的失效停在起始模块里,超过 100 个节点失效的概率只有 6%。跨模块连接增加到 5%,平均失效升到 136 个,超过 100 个的概率升到 54%;到 10%,与完全随机的网络(\(\mu = 0.9\))已相差不大。几条跨模块的连接就足以把失效带出去。
数据口径:本书不是医疗建议,也不作投资或金融预测;企业与生理的例子都是类比。 书中以标注框区分已发表的证据、可运行的 Python 计算(15 段程序,全部核对)、原典与作者的假说。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 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 |
查看完整验算程序
# 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}")唯一数据源与引用
范雅福(Fan, Y.). (2026). 《复杂系统相变、临界慢化与生态韧性的非线性动力学》第 6 章「紧耦合与模块化:常态事故与高可靠性」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.23770082
DOI: 10.5281/zenodo.23770082 · 阅读本章所在专著 · 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}
}