Social Network Topology, Structural Holes and Complex Contagion: chapter answers
Information, help and new practices flow along the ties between people, but claims such as "the more people you know the better" or "find the key person and it will spread overnight" make things far too simple. This book uses graph-theoretic models, runnable programs and empirical research to ask how the structure of social networks shapes what a person can see, how far a behaviour can spread and why groups go wrong together. It covers Granovetter's "strength of weak ties" (whose job-finding figures come from a subsample of 54 people), neighbourhood overlap and the role of weak ties in holdin…
DOI 10.5281/zenodo.23764990 · Read the monograph · 中文版
- Chapter 1 · The Strength of Weak Ties and Small Worlds
From the "forbidden triad" Granovetter inferred that strong ties are rarely bridges and that bridges are mostly weak ties; his job-finding data come from a subsample of 54 people and show that most of the people who hel… - Chapter 2 · Structural Holes: Closure and Brokerage
Coleman's closure stresses that dense networks bring trust and sanctions; Burt's structural holes stress that standing between circles brings information and opportunity. Network constraint measures how far a person is… - Chapter 3 · Simple and Complex Contagion
The threshold model shows that collective outcomes are extremely sensitive to the distribution of thresholds. Complex contagions, which need reinforcement from several sources, spread better in clustered networks, and c… - Chapter 4 · Scale-Free Networks, Preferential Attachment and Robustness
Under attack the difference is stark: after the 10 % of nodes with the highest degree are removed, the BA network's largest component still holds 63 % of the nodes, and after 15 % only 4 %; the same attack does much les… - Chapter 5 · Eigenvector Centrality and PageRank
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… - Chapter 6 · Information Cascades and How to Break Them
Take $p = 0.7$ and the coin rule: once just two people have chosen, the probability that a cascade has already formed is 0.79, and the probability of a wrong cascade 0.195; by the tenth person a cascade has almost certa… - Chapter 8 · Practice and a Pre-registered Trial
Chapter 8 gives a four-step topology checklist and a pre-registered trial randomised by team, comparing "independent anonymous written judgments and reasons, shown to all before discussion" with "open statements in orde…
Illustrative model calculation, not a live quote