关于「信息级联及其打破」,《社会网络与结构洞》给出的定量结论是什么?
结论:以 \(p = 0.7\)、抛硬币规则为例:只要两个人做出选择,级联已经形成的概率就是 0.79,错误级联的概率是 0.195;到第 10 个人时,级联几乎必然已经形成,错误级联的概率是 0.247,之后不再改变。也就是说,即使每个人的私人信息有七成的准确率,整个群体仍有约四分之一的机会集体走错,而且一旦走错就不会自己纠正。跟随自己信号的规则让错误级联少一些(0.155),因为无差别的人仍然透露了信号,级联形成得慢一些。信号越准确,错误级联越少,但即使 \(p = 0.8\),抛硬币规则下仍有 14% 的错误级联。模拟的结果(0.246)与精确计算(0.247)一致。
数据口径:书中以标注框区分已发表的证据、可运行的 Python 计算(15 段程序,全部核对)、原典与作者的假说。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.155, 0.195, 0.246, 0.247, 0.7, 0.79
| rule 'coin': P(cascade started) / P(wrong cascade) after n people | |||||
| p | n = 2 | n = 4 | n = 10 | n = 20 | limit (wrong) |
| 0.6 | 0.76/0.280 | 0.94/0.347 | 1.00/0.368 | 1.00/0.368 | 0.368 |
| 0.7 | 0.79/0.195 | 0.96/0.236 | 1.00/0.247 | 1.00/0.247 | 0.247 |
| 0.8 | 0.84/0.120 | 0.97/0.139 | 1.00/0.143 | 1.00/0.143 | 0.143 |
| rule 'own': P(cascade started) / P(wrong cascade) after n people | |||||
| p | n = 2 | n = 4 | n = 10 | n = 20 | limit (wrong) |
| 0.6 | 0.52/0.160 | 0.77/0.237 | 0.97/0.300 | 1.00/0.307 | 0.308 |
| 0.7 | 0.58/0.090 | 0.82/0.128 | 0.99/0.153 | 1.00/0.155 | 0.155 |
| 0.8 | 0.68/0.040 | 0.90/0.053 | 1.00/0.059 | 1.00/0.059 | 0.059 |
| Monte Carlo check (p = 0.7, n = 20, coin): wrong cascade 0.246, exact 0.247 |
查看完整验算程序
# Information cascades in the Bikhchandani-Hirshleifer-Welch (1992) model.
# The true state is "good" (assumed here; the other case is symmetric). Each
# person privately gets a signal that is right with probability p, sees all
# earlier choices, and chooses by Bayes' rule. Before a cascade every choice
# reveals a signal, so the state is the lead d = (good signals) - (bad signals)
# shown so far. Once |d| = 2 everyone imitates: an up (correct) or down (wrong)
# cascade. A person whose own signal exactly cancels the lead is indifferent:
# "coin": flips a coin, as in BHW; "own": follows the own signal.
import random
def cascade_probs(p, n, rule):
st = {-1: 0.0, 0: 1.0, 1: 0.0, "up": 0.0, "down": 0.0}
for _ in range(n):
new = {-1: 0.0, 0: 0.0, 1: 0.0, "up": st["up"], "down": st["down"]}
new[1] += st[0] * p; new[-1] += st[0] * (1 - p)
h = 0.5 if rule == "coin" else 0.0 # chance an indifferent person herds
new["up"] += st[1] * (p + (1 - p) * h); new[0] += st[1] * (1 - p) * (1 - h)
new["down"] += st[-1] * ((1 - p) + p * h); new[0] += st[-1] * p * (1 - h)
st = new
return st["up"], st["down"]
def limit_wrong(p, rule):
if rule == "coin":
return 1 - p * (1 + p) / (2 * (1 - p + p * p))
return (1 - p) ** 2 / (p * p + (1 - p) ** 2)
for rule in ("coin", "own"):
print(f"rule '{rule}': P(cascade started) / P(wrong cascade) after n people")
print(" p n = 2 n = 4 n = 10 n = 20 limit (wrong)")
for p in (0.6, 0.7, 0.8):
cells = []
for n in (2, 4, 10, 20):
up, down = cascade_probs(p, n, rule)
cells.append(f"{up + down:.2f}/{down:.3f}")
lim = limit_wrong(p, rule)
print(f" {p:.1f} " + " ".join(cells) + f" {lim:.3f}")
rng = random.Random(12)
def simulate(p, n, rule): # check by brute force with explicit counting
d = 0
for _ in range(n):
good = rng.random() < p
if d >= 2 or d <= -2:
continue
s = 1 if good else -1
if d + s == 0 and d != 0:
herd = rule == "coin" and rng.random() < 0.5
d = d + (2 * d if herd else s) # herd: |d| becomes 2 (cascade)
else:
d += s
return d <= -2
sims = 200000
wrong = sum(simulate(0.7, 20, "coin") for _ in range(sims)) / sims
print(f"Monte Carlo check (p = 0.7, n = 20, coin): wrong cascade {wrong:.3f},"
f" exact {cascade_probs(0.7, 20, 'coin')[1]:.3f}")唯一数据源与引用
范雅福(Fan, Y.). (2026). 《社会网络拓扑、结构洞与复杂传染的数学模型》第 6 章「信息级联及其打破」(版本 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}
}