关于「德格鲁特共识:影响力、谱隙与群体智慧」,《集群动力学与分布式共识》给出的定量结论是什么?

结论:德格鲁特模型中,强连通且非周期的网络必然达成共识,共识是初始意见按影响力 \(\pi\) 的加权平均;分歧按 \(|\lambda_2|^t\) 衰减,谱隙只描述渐近速率。戈卢布与杰克逊证明,群体明智当且仅当最大影响力随人数趋于 0;收敛快慢与是否明智无关。星形与「精英」网络收敛快却不明智,中心人物的偏差按其影响力传递给整个群体。实验表明多数人的更新接近德格鲁特式平均;中心化网络中的社会影响能否改善估计,取决于中心人物是否偏离真值。下一章讨论人们只听取与自己相近的意见时会发生什么。

数据口径:本书是教学与研究用的数学模型,不是管理咨询,也不构成任何政治主张。 书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序,全部核对)、原典与作者的假说;书中所有数据都是虚构或模拟的。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库

network (N = 21)max piN_eff=1/sum pi^2|lam_2|gappredicted simulated
complete0.04821.00.00001.000011.0
ring k=10.04821.00.97040.0296154104.6
ring k=20.04821.00.91270.08735129.8
ring k=2 + 6 shortcuts0.06020.60.84290.15712716.8
two cliques + 1 bridge0.05420.90.98460.0154297152.2
star0.3447.10.50000.500077.0
predicted = rounds for |lam_2|^t to fall to 1/100; simulated = rounds until
the spread max - min falls below 1 % of its start (mean of 5 random starts)

核心公式

\[p_\infty = \sum_i \pi_i\, p_i(0),\]
查看完整验算程序
# DeGroot (1974) averaging p(t+1) = T p(t) on undirected graphs with self-loops,
# T_ij = 1/(d_i + 1) for j = i or j ~ i. Then T is reversible: pi_i = (d_i + 1)/sum(d + 1)
# is the left unit eigenvector (influence), the consensus is sum_i pi_i p_i(0), and
# disagreement shrinks like |lambda_2|^t, lambda_2 = largest-modulus eigenvalue below 1.
import math, random

def jacobi_eigs(S, sweeps=60):
    a = [row[:] for row in S]; n = len(a)
    for _ in range(sweeps):
        if sum(a[i][j] ** 2 for i in range(n) for j in range(n) if i != j) < 1e-22: break
        for p in range(n - 1):
            for q in range(p + 1, n):
                if abs(a[p][q]) < 1e-15: continue
                t = (a[q][q] - a[p][p]) / (2 * a[p][q])
                t = (1 if t >= 0 else -1) / (abs(t) + math.sqrt(t * t + 1))
                c = 1 / math.sqrt(t * t + 1); s = t * c
                for k in range(n):
                    u, v = a[k][p], a[k][q]
                    a[k][p], a[k][q] = c * u - s * v, s * u + c * v
                for k in range(n):
                    u, v = a[p][k], a[q][k]
                    a[p][k], a[q][k] = c * u - s * v, s * u + c * v
    return sorted(a[i][i] for i in range(n))

def ring(n, k=1):
    return [{(i + s) % n for s in range(-k, k + 1) if s} for i in range(n)]

def networks(n=21):
    rng = random.Random(3); sw = ring(n, 2)
    for _ in range(6):
        i, j = rng.sample(range(n), 2); sw[i].add(j); sw[j].add(i)
    two = [{j for j in range(n) if j != i and (j < 10) == (i < 10)} for i in range(n)]
    two[0].add(10); two[10].add(0)              # two cliques (10 and 11) and one bridge
    return [("complete", [set(range(n)) - {i} for i in range(n)]), ("ring k=1", ring(n)),
            ("ring k=2", ring(n, 2)), ("ring k=2 + 6 shortcuts", sw),
            ("two cliques + 1 bridge", two),
            ("star", [set(range(1, n))] + [{0}] * (n - 1))]

def rounds_to_one_percent(adj, rng):
    p = [rng.random() for _ in adj]; s0 = max(p) - min(p)
    for t in range(1, 100000):
        p = [(p[i] + sum(p[j] for j in nb)) / (len(nb) + 1) for i, nb in enumerate(adj)]
        if max(p) - min(p) < 0.01 * s0: return t

if __name__ == "__main__":
    rng = random.Random(1974)
    print("network (N = 21)        max pi  N_eff=1/sum pi^2  |lam_2|    gap   predicted"
          " simulated")
    for name, adj in networks():
        w = [len(nb) + 1 for nb in adj]; pi = [x / sum(w) for x in w]
        S = [[(1 if (j in adj[i] or i == j) else 0) / math.sqrt(w[i] * w[j])
              for j in range(len(adj))] for i in range(len(adj))]
        lam = jacobi_eigs(S); l2 = max(abs(lam[0]), abs(lam[-2]))
        pred = 1 if l2 < 1e-12 else math.ceil(math.log(100) / -math.log(l2))
        sim = sum(rounds_to_one_percent(adj, rng) for _ in range(5)) / 5
        print(f"{name:24s}  {max(pi):.3f}      {1 / sum(x * x for x in pi):5.1f}"
              f"         {l2:.4f}  {1 - l2:.4f}    {pred:4d}    {sim:7.1f}")
    print("predicted = rounds for |lam_2|^t to fall to 1/100; simulated = rounds until")
    print("the spread max - min falls below 1 % of its start (mean of 5 random starts)")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《集群动力学、耦合振子同步与分布式共识的数学模型》第 5 章「德格鲁特共识:影响力、谱隙与群体智慧」(版本 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}
}

本书其他章节结论