关于「幂律:观众为什么会集中」,《注意力的经济学》给出的定量结论是什么?
结论:在优先连接下,连接最多的节点有 356 条连接,均匀连接下只有 24 条;估计的指数接近理论值 3。均匀连接下的分布根本不是幂律,表中它的「指数」只是把估计方法用在错误形状上得到的数字。
数据口径:本书不是商业、投资或法律建议。 书中以标注框区分已发表的证据、可运行的 Python 计算(28 段,全部核对)、原典与作者的假说,每个假说都写明什么结果会推翻它。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 24, 356
| growth rule | max degree | top 1% share | Gini | tail exponent |
| preferential | 356 | 12.1% | 0.391 | 2.91 |
| uniform | 24 | 3.9% | 0.300 | 5.51 |
核心公式
\[P(k) \propto k^{-\gamma}\]
查看完整验算程序
import random
from math import log
def grow(n, m, preferential, seed=1):
"""Grow a network to n nodes; each new node links to m existing nodes.
preferential=True: chosen in proportion to current degree (Barabasi-Albert); False: uniformly."""
rng = random.Random(seed)
deg = [m] * (m + 1) # start from a small complete graph
ends = [i for i in range(m + 1) for _ in range(m)] # each node listed once per link end
for new in range(m + 1, n):
targets = set()
while len(targets) < m:
targets.add(rng.choice(ends) if preferential else rng.randrange(new))
deg.append(m)
for t in targets:
deg[t] += 1
ends += [t, new]
return deg
def gini(x):
x = sorted(x); n = len(x)
return sum((2 * i - n - 1) * v for i, v in enumerate(x, 1)) / (n * sum(x))
def gamma_mle(deg, kmin):
tail = [k for k in deg if k >= kmin] # discrete approximation, Clauset et al. (2009)
return 1 + len(tail) / sum(log(k / (kmin - 0.5)) for k in tail)
print("growth rule max degree top 1% share Gini tail exponent")
for name, pref in (("preferential", True), ("uniform", False)):
deg = grow(20000, 2, pref)
top = sorted(deg, reverse=True)[: len(deg) // 100]
print(f"{name:14s} {max(deg):10d} {sum(top) / sum(deg):12.1%} {gini(deg):6.3f} {gamma_mle(deg, 10):8.2f}")唯一数据源与引用
范雅福(Fan, Y.). (2026). 《注意力的经济学》第 2 章「幂律:观众为什么会集中」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.23689302
DOI: 10.5281/zenodo.23689302 · 阅读本章所在专著 · 5DL-B-006 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026006,
author = {Fan, Yafu},
title = {The Economics of Attention},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.23689302},
url = {https://doi.org/10.5281/zenodo.23689302}
}