关于「特征向量中心性与 PageRank」,《社会网络与结构洞》给出的定量结论是什么?

结论:特征向量中心性把「连接的是谁」纳入地位的计算,可以用幂迭代求得。博纳西奇的 β 中心性把度与特征向量中心性连成一族指标,负的 β 衡量「被依赖」的议价权力,与结构洞相通。PageRank 是有向网络上带随机跳转的随机游走:阻尼系数处理了悬挂节点与陷阱,保证收敛,\(d = 0.85\) 是一种折中而不是最优。下一章讨论,当每个人都在观察前面的人怎么做时,群体会怎样一起走向同一个方向,而那个方向未必正确。

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

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 与结论吻合的打印值: 0.85

d = 0.85: G 0.279 H 0.260 A 0.144 C 0.143 B 0.084 F 0.036 E 0.032 D 0.023
converged in 146 iterations; error ratio per step about 0.827 (close to d)
dampingiterationsG + H sharetop page
0.50350.326G
0.851460.539G
0.954620.759G
0.9923560.938G
1.00never1.000H

核心公式

\[\lambda\, x_i = \sum_j a_{ij}\, x_j\]
查看完整验算程序
# PageRank by power iteration, standard library only (Brin & Page 1998;
# Page et al. 1999). An invented web of 8 pages. F has no out-links (a
# dangling page): its rank is spread evenly over all pages. G and H link only
# to each other (a "rank sink" that B feeds). With damping d, the surfer
# follows a link with probability d and jumps to a random page otherwise:
#   PR = (1 - d)/n + d * (sum over in-links PR(j)/out(j) + dangling mass/n)
links = {"A": "BC", "B": "CG", "C": "A", "D": "CE", "E": "CF", "F": "",
         "G": "H", "H": "G"}
pages = sorted(links)
n = len(pages)

def pagerank(d, tol=1e-12, max_it=20000):
    pr = {p: 1 / n for p in pages}
    errs = []
    for it in range(1, max_it + 1):
        dangling = sum(pr[p] for p in pages if not links[p])
        new = {p: (1 - d) / n + d * dangling / n for p in pages}
        for p in pages:
            for q in links[p]:
                new[q] += d * pr[p] / len(links[p])
        err = sum(abs(new[p] - pr[p]) for p in pages)
        errs.append(err); pr = new
        if err < tol:
            return pr, it, errs
    return pr, max_it, errs

pr, it, errs = pagerank(0.85)
order = sorted(pages, key=lambda p: -pr[p])
print("d = 0.85: " + "  ".join(f"{p} {pr[p]:.3f}" for p in order))
print(f"  converged in {it} iterations; error ratio per step about"
      f" {errs[30] / errs[29]:.3f} (close to d)")
print("damping   iterations   G + H share   top page")
for d in (0.5, 0.85, 0.95, 0.99, 1.0):
    pr_d, it_d, _ = pagerank(d)
    top = max(pages, key=lambda p: pr_d[p])
    its = f"{it_d:9d}" if it_d < 20000 else "    never"
    print(f"  {d:4.2f}   {its}     {pr_d['G'] + pr_d['H']:8.3f}       {top}")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《社会网络拓扑、结构洞与复杂传染的数学模型》第 5 章「特征向量中心性与 PageRank」(版本 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}
}

本书其他章节结论