What does The Economics of Attention conclude, in numbers, about “Power Laws: Why Audiences Concentrate”?

Answer: Under preferential attachment the best-connected node has 356 links, against 24 under uniform attachment, and the estimated exponent is close to the theoretical 3. Under uniform attachment the distribution is not a power law at all; its "exponent" in the table is only what the estimator returns when applied to the wrong shape.

Scope of the numbers: The book is not business, investment or legal advice. Marked boxes separate published evidence, runnable Python calculations (28, all checked), classical sources and the author's hypotheses, each with the result that would refute it.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 24, 356

growth rulemax degreetop 1% shareGinitail exponent
preferential35612.1%0.3912.91
uniform243.9%0.3005.51

Key formula

\[P(k) \propto k^{-\gamma}\]
Show the full program
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}")

Single source and citation

Fan, Y. (2026). The Economics of Attention (Version 1.0.0), Chapter 2: Power Laws: Why Audiences Concentrate. 5D Library. https://doi.org/10.5281/zenodo.23689302

DOI: 10.5281/zenodo.23689302 · Read the monograph · 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}
}

Other chapter answers in this book