关于「没有信号的领导:知情少数、未知情者与群体共识」,《集群动力学与分布式共识》给出的定量结论是什么?
结论:少数知情者可以在没有信号的情况下引导群体,库赞等人 2005 年的结论是:群体越大,所需知情者的比例越小,但没有普适的比例;本书的简化模型显示准确度主要取决于知情者人数,同时也暴露出它只能折中、不能选择的局限。库赞等人 2011 年的鱼群实验表明,未训练个体可以削弱偏好强烈的少数的控制,把选择交还数量上的多数;在本书逐一模仿随机他人的模型中未知情者完全不起作用,改用「三人取多数」的规则后才出现这一效应,而哈特内特等人 2016 年的模型显示,反应高度非线性时效应的方向反而相反——效应的有无与方向都取决于交互规则的具体形式。下一章转向意见的平均:德格鲁特模型。
数据口径:本书是教学与研究用的数学模型,不是管理咨询,也不构成任何政治主张。 书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序,全部核对)、原典与作者的假说;书中所有数据都是虚构或模拟的。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库
| accuracy (mean of 10 runs) by group size N and share of informed individuals | |
| N p | 0.05 p = 0.10 p = 0.20 p = 0.40 |
| 10 | 0.896 0.883 0.920 0.962 |
| 30 | 0.944 0.943 0.976 0.987 |
| 100 | 0.968 0.985 0.991 0.996 |
| 300 | 0.994 0.995 0.998 0.999 |
| two informed subgroups of 5 (N | 50) whose targets differ by D degrees; |
| share of 10 runs ending within 15 deg of the average / of either target | |
| D | 60: average 0.80 one target 0.20 |
| D | 150: average 0.60 one target 0.00 |
核心公式
\[x = \frac{n_A s_A}{n_A s_A + n_B s_B},\]
查看完整验算程序
# Leadership without signalling, in a heading-only caricature of Couzin et al. (2005).
# Each step every individual looks at k = 7 randomly drawn others (no positions are
# modelled) and turns to the direction of the sum of their unit headings plus its own; an
# informed individual adds w * g (g = preferred direction, w = 0.5). Gaussian turning
# error SD 0.4 rad. Nobody knows who is informed. 400 steps; accuracy = mean of
# cos(group heading - g) over steps 200..400 (1 = on target, 0 = no information).
import math, random
def run(N, n_inf, rng, w=0.5, k=7, sd=0.4, steps=400, goals=None):
th = [rng.uniform(-math.pi, math.pi) for _ in range(N)]
goals = goals or [0.0] * n_inf # preferred directions of the informed
acc, heads = 0.0, []
for t in range(steps):
c = [math.cos(a) for a in th]; s = [math.sin(a) for a in th]; new = []
pick = rng.choices(range(N), k=k * N) # k random others per individual
for i in range(N):
nb = pick[k * i:k * i + k]
sx = c[i] + sum(c[j] for j in nb); sy = s[i] + sum(s[j] for j in nb)
n = math.hypot(sx, sy) or 1.0; sx, sy = sx / n, sy / n
if i < len(goals):
sx += w * math.cos(goals[i]); sy += w * math.sin(goals[i])
new.append(math.atan2(sy, sx) + rng.gauss(0, sd))
th = new
if t >= steps // 2:
psi = math.atan2(sum(map(math.sin, th)), sum(map(math.cos, th)))
acc += math.cos(psi); heads.append(psi)
return acc / (steps - steps // 2), heads[-1]
if __name__ == "__main__":
rng = random.Random(2005)
print("accuracy (mean of 10 runs) by group size N and share of informed individuals")
shares = (0.05, 0.10, 0.20, 0.40)
print(" N " + "".join(f" p = {p:4.2f}" for p in shares))
for N in (10, 30, 100, 300):
row = []
for p in shares:
n = max(1, round(p * N))
row.append(sum(run(N, n, rng)[0] for _ in range(10)) / 10)
print(f" {N:4d} " + "".join(f" {a:6.3f} " for a in row))
print("two informed subgroups of 5 (N = 50) whose targets differ by D degrees;")
print("share of 10 runs ending within 15 deg of the average / of either target")
for D in (60, 150):
g = math.radians(D / 2); mid = side = 0
for _ in range(10):
psi = run(50, 10, rng, goals=[g] * 5 + [-g] * 5)[1]
mid += abs(psi) < math.radians(15)
side += min(abs(psi - g), abs(psi + g)) < math.radians(15)
print(f" D = {D:3d}: average {mid / 10:.2f} one target {side / 10:.2f}")唯一数据源与引用
范雅福(Fan, Y.). (2026). 《集群动力学、耦合振子同步与分布式共识的数学模型》第 4 章「没有信号的领导:知情少数、未知情者与群体共识」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.23828063
DOI: 10.5281/zenodo.23828063 · 阅读本章所在专著 · 5DL-B-044 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026044,
author = {Fan, Yafu},
title = {Collective Dynamics, Coupled-Oscillator Synchrony and Distributed Consensus},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.23828063},
url = {https://doi.org/10.5281/zenodo.23828063}
}