What does Social Networks and Structural Holes conclude, in numbers, about “Simple and Complex Contagion”?
Answer: 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 crossing between groups needs wide bridges; an online experiment supports this, while observational data show that contact from different circles is more effective. The programs show that the placement of a bridge matters more than its size: three ties placed together are more reliable than sixteen scattered ones; but a small share of low-threshold people makes narrow bridges work as well. A 2024 theoretical result shows that as long as there is some chance of adopting below the threshold, long ties speed spreading up again. The next chapter turns from spreading to the structure of networks themselves: degree distributions, the scale-free dispute, and how networks behave under failure and attack.
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. standard-library Python only
| threshold 2 for everyone in B: chance that B is taken over (> 90 % adopt) | |
| bridge width w wide bridge scattered ties | |
| 1 | 0.00 0.000 |
| 2 | 0.00 0.000 |
| 3 | 1.00 0.000 |
| 4 | 1.00 0.002 |
| 8 | 1.00 0.018 |
| 16 | 1.00 0.136 |
| 32 | 1.00 0.698 |
| scattered ties, w | 4, with a share f of B at threshold 1: |
| f | 0.00: chance of take-over 0.002 |
| f | 0.02: chance of take-over 0.011 |
| f | 0.05: chance of take-over 0.043 |
| f | 0.10: chance of take-over 0.152 |
| f | 0.20: chance of take-over 0.412 |
Show the full program
# Bridge width and threshold heterogeneity (extending volume 13, Chapter 5).
# Community A has fully adopted a costly behaviour. Community B is a ring of
# 200 people, each tied to 2 neighbours on each side (4 contacts). w bridge
# ties run from A to B. A person in B adopts once at least THETA of his or her
# contacts have adopted (Centola & Macy 2007). Bridges are either
# "wide": the w ties land two per person on adjacent people in B, or
# "scattered": each tie lands on a person in B chosen at random.
# Optionally a share f of people in B has threshold 1 instead of 2.
import random
rng = random.Random(6)
NB, REPS = 200, 2000
def spread_in_b(bridge_count, theta):
# bridge_count[i] = number of A-adopters tied to person i of B
adopted = [False] * NB
changed = True
while changed:
changed = False
for i in range(NB):
if adopted[i]:
continue
ring = sum(adopted[(i + d) % NB] for d in (-2, -1, 1, 2))
if ring + bridge_count[i] >= theta[i]:
adopted[i] = changed = True
return sum(adopted) / NB
def trial(w, kind, f=0.0):
count = [0] * NB
if kind == "wide":
start = rng.randrange(NB)
for t in range(w):
count[(start + t // 2) % NB] += 1
else:
for _ in range(w):
count[rng.randrange(NB)] += 1
theta = [1 if rng.random() < f else 2 for _ in range(NB)]
return spread_in_b(count, theta)
def p_cross(w, kind, f=0.0, reps=REPS):
return sum(trial(w, kind, f) > 0.9 for _ in range(reps)) / reps
print("threshold 2 for everyone in B: chance that B is taken over (> 90 % adopt)")
print(" bridge width w wide bridge scattered ties")
for w in (1, 2, 3, 4, 8, 16, 32):
wide, scat = p_cross(w, "wide", reps=50), p_cross(w, "scattered")
print(f" {w:5d} {wide:8.2f} {scat:10.3f}")
print("scattered ties, w = 4, with a share f of B at threshold 1:")
for f in (0.0, 0.02, 0.05, 0.1, 0.2):
print(f" f = {f:4.2f}: chance of take-over {p_cross(4, 'scattered', f):.3f}")Single source and citation
Fan, Y. (2026). Social Network Topology, Structural Holes and Complex Contagion (Version 1.0.0), Chapter 3: Simple and Complex Contagion. 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
- Chapter 1 · The Strength of Weak Ties and Small Worlds
- Chapter 2 · Structural Holes: Closure and Brokerage
- Chapter 4 · Scale-Free Networks, Preferential Attachment and Robustness
- Chapter 5 · Eigenvector Centrality and PageRank
- Chapter 6 · Information Cascades and How to Break Them
- Chapter 8 · Practice and a Pre-registered Trial