What does Social Networks and Structural Holes conclude, in numbers, about “Eigenvector Centrality and PageRank”?

Answer: Eigenvector centrality brings "whom one is connected to" into the calculation of status and can be found by power iteration. Bonacich's beta-centrality joins degree and eigenvector centrality into one family of measures; negative beta captures the bargaining power of being depended upon, which connects with structural holes. PageRank is a random walk with random jumps on a directed network: the damping factor deals with dangling nodes and traps and guarantees convergence, and \(d = 0.85\) is a compromise rather than an optimum. The next chapter discusses how, when everyone watches what the people before them do, a group can converge on the same direction, and why that direction may be wrong.

Scope of the numbers: Marked boxes separate published evidence, runnable Python calculations (15 programs, all checked), classical sources and the author's hypotheses.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. printed values that match the answer: 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

Key formula

\[\lambda\, x_i = \sum_j a_{ij}\, x_j\]
Show the full program
# 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}")

Single source and citation

Fan, Y. (2026). Social Network Topology, Structural Holes and Complex Contagion (Version 1.0.0), Chapter 5: Eigenvector Centrality and PageRank. 5D Library. https://doi.org/10.5281/zenodo.23764990

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

Other chapter answers in this book