关于「简单传染与复杂传染」,《社会网络与结构洞》给出的定量结论是什么?
结论:阈值模型说明群体结果对阈值分布极为敏感。需要多个来源强化的复杂传染,在聚簇网络中传得更好,跨越群体需要宽桥;在线实验支持这一点,观察性数据则显示来自不同圈子的接触更有效。程序显示,桥的位置比数量更重要:三条放在一起的连带比十六条分散的连带更可靠;但一小部分低阈值的人会让窄桥也起作用。2024 年的理论结果表明,只要低于阈值时仍有一点采纳的可能,长连带又会加速传播。下一章从传播转向网络本身的结构:度的分布、无标度的争议,以及网络在失效与攻击下的表现。
数据口径:书中以标注框区分已发表的证据、可运行的 Python 计算(15 段程序,全部核对)、原典与作者的假说。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库
| threshold 2 for everyone in B: chance that B is taken over (> 90 % adopt) | |
| bridge width w wide bridge scattered ties | |
| 1 | 0.00 0.000 |
| 2 | 0.00 0.000 |
| 3 | 1.00 0.000 |
| 4 | 1.00 0.002 |
| 8 | 1.00 0.018 |
| 16 | 1.00 0.136 |
| 32 | 1.00 0.698 |
| scattered ties, w | 4, with a share f of B at threshold 1: |
| f | 0.00: chance of take-over 0.002 |
| f | 0.02: chance of take-over 0.011 |
| f | 0.05: chance of take-over 0.043 |
| f | 0.10: chance of take-over 0.152 |
| f | 0.20: chance of take-over 0.412 |
查看完整验算程序
# Bridge width and threshold heterogeneity (extending volume 13, Chapter 5).
# Community A has fully adopted a costly behaviour. Community B is a ring of
# 200 people, each tied to 2 neighbours on each side (4 contacts). w bridge
# ties run from A to B. A person in B adopts once at least THETA of his or her
# contacts have adopted (Centola & Macy 2007). Bridges are either
# "wide": the w ties land two per person on adjacent people in B, or
# "scattered": each tie lands on a person in B chosen at random.
# Optionally a share f of people in B has threshold 1 instead of 2.
import random
rng = random.Random(6)
NB, REPS = 200, 2000
def spread_in_b(bridge_count, theta):
# bridge_count[i] = number of A-adopters tied to person i of B
adopted = [False] * NB
changed = True
while changed:
changed = False
for i in range(NB):
if adopted[i]:
continue
ring = sum(adopted[(i + d) % NB] for d in (-2, -1, 1, 2))
if ring + bridge_count[i] >= theta[i]:
adopted[i] = changed = True
return sum(adopted) / NB
def trial(w, kind, f=0.0):
count = [0] * NB
if kind == "wide":
start = rng.randrange(NB)
for t in range(w):
count[(start + t // 2) % NB] += 1
else:
for _ in range(w):
count[rng.randrange(NB)] += 1
theta = [1 if rng.random() < f else 2 for _ in range(NB)]
return spread_in_b(count, theta)
def p_cross(w, kind, f=0.0, reps=REPS):
return sum(trial(w, kind, f) > 0.9 for _ in range(reps)) / reps
print("threshold 2 for everyone in B: chance that B is taken over (> 90 % adopt)")
print(" bridge width w wide bridge scattered ties")
for w in (1, 2, 3, 4, 8, 16, 32):
wide, scat = p_cross(w, "wide", reps=50), p_cross(w, "scattered")
print(f" {w:5d} {wide:8.2f} {scat:10.3f}")
print("scattered ties, w = 4, with a share f of B at threshold 1:")
for f in (0.0, 0.02, 0.05, 0.1, 0.2):
print(f" f = {f:4.2f}: chance of take-over {p_cross(4, 'scattered', f):.3f}")唯一数据源与引用
范雅福(Fan, Y.). (2026). 《社会网络拓扑、结构洞与复杂传染的数学模型》第 3 章「简单传染与复杂传染」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.23764990
DOI: 10.5281/zenodo.23764990 · 阅读本章所在专著 · 5DL-B-025 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026025,
author = {Fan, Yafu},
title = {Social Network Topology, Structural Holes and Complex Contagion},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.23764990},
url = {https://doi.org/10.5281/zenodo.23764990}
}