关于「无标度网络、优先连接与鲁棒性」,《社会网络与结构洞》给出的定量结论是什么?

结论:结果有三点值得注意。第一,即使数据确实来自优先连接模型,指数的估计也随 \(k_{\min}\) 变化:\(k_{\min} = 2\) 时为 2.40,\(k_{\min} = 8\) 时为 2.80,都低于理论值 3,因为有限规模的网络中尾部还没有完全形成。第二,对数正态数据在 \(k_{\min} = 4\) 时也给出 2.77 的「指数」,与 BA 数据几乎一样;只有把 \(k_{\min}\) 逐步提高,才看到它的「指数」不断变大(3.60、4.56),暴露出它不是幂律。第三,似然比检验对对数正态数据给出了明确的结论(\(z = -5.73\),偏向对数正态);但对真正的 BA 数据,检验无法区分幂律与对数正态(\(z = -0.63\),\(p = 0.53\)),最佳拟合的对数正态参数(\(\mu = -12\)、\(\sigma = 2.9\))说明它正在用一个极宽的分布模仿幂律。也就是说,在约 1,600 个尾部数据点的规模上,「无法拒绝幂律」并不等于「证明是幂律」;布罗伊多与克劳塞特的大量网络落在「弱证据」等级上,部分原因正在于此。

数据口径:书中以标注框区分已发表的证据、可运行的 Python 计算(15 段程序,全部核对)、原典与作者的假说。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: -0.63, -5.73, 2.40, 2.77, 2.80, 2.9

BA: max value 418
kmin2: alpha = 2.40 +/- 0.01 (n tail = 20000)
kmin4: alpha = 2.69 +/- 0.02 (n tail = 6002)
kmin8: alpha = 2.80 +/- 0.04 (n tail = 1630)
kmin 16: alpha2.77 +/- 0.09 (n tail = 431)
kmin 8, power law vs log-normal: R-0.8, z = -0.63, p = 0.531
-> cannot tell them apart; best log-normal mu-12.00, sigma = 2.9
LN: max value 57
kmin2: alpha = 2.09 +/- 0.01 (n tail = 15408)
kmin4: alpha = 2.77 +/- 0.02 (n tail = 7504)
kmin8: alpha = 3.60 +/- 0.06 (n tail = 2062)
kmin 16: alpha4.56 +/- 0.21 (n tail = 301)
kmin 8, power law vs log-normal: R-32.0, z = -5.73, p = 0.000
-> log-normal favoured; best log-normal mu1.00, sigma = 0.8

核心公式

\[f_c = 1 - \frac{1}{\kappa - 1}\]
查看完整验算程序
# Is it a power law? Maximum-likelihood exponent and a likelihood-ratio test
# against a log-normal (in the spirit of Clauset, Shalizi & Newman 2009 and
# Broido & Clauset 2019). Two synthetic degree samples of 20,000 nodes:
#   BA: a Barabasi-Albert network with m = 2 (true tail exponent 3);
#   LN: rounded log-normal values exp(Normal(1.0, 0.8)), not a power law.
# Exponent: alpha = 1 + n / sum ln(k / (kmin - 0.5)) (discrete approximation).
# LR test: continuous approximation above kmin - 0.5; the log-normal is fitted
# by grid search (mu -24 to 4, sigma 0.2 to 4; the tail mass uses erfc, which
# stays accurate far out in the tail); Vuong's normalised ratio z and
# two-sided p are reported.
import math, random
from statistics import NormalDist
rng, PHI = random.Random(9), NormalDist().cdf
N, M = 20000, 2
targets, deg = [], [0] * N
for i in range(M + 1):
    for j in range(i):
        targets += [i, j]; deg[i] += 1; deg[j] += 1
for new in range(M + 1, N):
    chosen = set()
    while len(chosen) < M:
        chosen.add(rng.choice(targets))
    for t in chosen:
        targets += [t, new]; deg[t] += 1; deg[new] += 1
samples = {"BA": deg,
           "LN": [max(1, round(math.exp(rng.gauss(1.0, 0.8)))) for _ in range(N)]}

def alpha_hat(ks, kmin):
    tail = [k for k in ks if k >= kmin]
    a = 1 + len(tail) / sum(math.log(k / (kmin - 0.5)) for k in tail)
    return a, (a - 1) / math.sqrt(len(tail)), len(tail)

def lr_test(ks, kmin):
    x = [k for k in ks if k >= kmin]; xm = kmin - 0.5; n = len(x)
    a = 1 + n / sum(math.log(v / xm) for v in x)
    lp = [math.log((a - 1) / xm) - a * math.log(v / xm) for v in x]
    lx = [math.log(v) for v in x]
    def ln_ll(mu, s):
        tailp = 0.5 * math.erfc((math.log(xm) - mu) / (s * math.sqrt(2)))
        if tailp < 1e-300: return None
        c = -math.log(s * math.sqrt(2 * math.pi)) - math.log(tailp)
        return [c - l - (l - mu) ** 2 / (2 * s * s) for l in lx]
    best = None
    grid = [(mu / 4, s / 10) for mu in range(-96, 17) for s in range(2, 41)]
    for mu, s in grid:
        ll = ln_ll(mu, s)
        if ll is not None and (best is None or sum(ll) > best[0]):
            best = (sum(ll), mu, s, ll)
    d = [p - q for p, q in zip(lp, best[3])]
    R = sum(d); sd = math.sqrt(sum((v - R / n) ** 2 for v in d) / n)
    z = R / (sd * math.sqrt(n))
    return R, z, 2 * PHI(-abs(z)), best[1], best[2]

for name, ks in samples.items():
    print(f"{name}: max value {max(ks)}")
    for kmin in (2, 4, 8, 16):
        a, se, n = alpha_hat(ks, kmin)
        print(f"   kmin {kmin:2d}: alpha = {a:.2f} +/- {se:.2f} (n tail = {n})")
    R, z, p, mu, sig = lr_test(ks, 8)
    if p >= 0.1:
        verdict = "cannot tell them apart"
    else:
        verdict = "power law favoured" if z > 0 else "log-normal favoured"
    print(f"   kmin 8, power law vs log-normal: R = {R:+.1f}, z = {z:+.2f},"
          f" p = {p:.3f}")
    print(f"      -> {verdict}; best log-normal mu = {mu:.2f}, sigma = {sig:.1f}")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《社会网络拓扑、结构洞与复杂传染的数学模型》第 4 章「无标度网络、优先连接与鲁棒性」(版本 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}
}

本书其他章节结论