What does Social Networks and Structural Holes conclude, in numbers, about “The Strength of Weak Ties and Small Worlds”?
Answer: 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 helped were acquaintances seen infrequently. Neighbourhood overlap makes the argument computable: low-overlap ties bring novel information and hold the whole network together. The Watts–Strogatz model shows that a few shortcuts make path lengths collapse while clustering barely changes. Large-scale studies with Facebook and LinkedIn data show that the overall contribution of weak ties comes largely from their number, and that, tie for tie, moderate strength is most useful. The next chapter moves from ties to positions: what it means to stand in the gap between circles.
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
| 600 people, 2405 ties | 2255 inside groups, 150 between |
| mean overlap novelty of the contact's other contacts | |
| inside-group ties | 0.230 0.627 |
| between-group ties | 0.001 0.998 |
| largest component (share of people) after removing a share of ties: | |
| removed low overlap first random high overlap first | |
| 0% | 1.00 1.00 1.00 |
| 3% | 1.00 1.00 1.00 |
| 6% | 0.99 1.00 1.00 |
| 8% | 0.93 1.00 1.00 |
| 10% | 0.26 1.00 1.00 |
| 20% | 0.03 1.00 1.00 |
| 40% | 0.03 1.00 0.99 |
Key formula
Show the full program
# Bridges, closed triangles and redundant information (Granovetter 1973;
# Onnela et al. 2007). Synthetic network: 30 groups of 20 people, dense inside
# each group (tie probability 0.4) plus 150 random ties between groups.
# Neighbourhood overlap of tie i-j: shared contacts / (k_i - 1 + k_j - 1 - shared).
# "Novelty" of j for i: share of j's other contacts that i does not know.
# Then ties are removed in order of overlap (lowest first or highest first)
# and the largest connected component is tracked. Illustrative parameters.
import random
rng = random.Random(2)
G, S, P_IN, N_BETWEEN = 30, 20, 0.4, 150
N = G * S
nb = [set() for _ in range(N)]
for g in range(G):
m = range(g * S, (g + 1) * S)
for a in m:
for b in m:
if a < b and rng.random() < P_IN:
nb[a].add(b); nb[b].add(a)
added = 0
while added < N_BETWEEN:
a, b = rng.randrange(N), rng.randrange(N)
if a // S != b // S and b not in nb[a]:
nb[a].add(b); nb[b].add(a); added += 1
edges = [(a, b) for a in range(N) for b in nb[a] if a < b]
def overlap(a, b):
sh = len(nb[a] & nb[b]); den = len(nb[a]) - 1 + len(nb[b]) - 1 - sh
return sh / den if den > 0 else 0.0
def novelty(a, b): # share of b's other contacts unknown to a
others = nb[b] - {a}
return len(others - nb[a]) / len(others) if others else 0.0
inside = [e for e in edges if e[0] // S == e[1] // S]
across = [e for e in edges if e[0] // S != e[1] // S]
mean = lambda xs: sum(xs) / len(xs)
print(f"{N} people, {len(edges)} ties: {len(inside)} inside groups,"
f" {len(across)} between")
print(" mean overlap novelty of the contact's other contacts")
for name, es in (("inside-group ties", inside), ("between-group ties", across)):
nov = mean([novelty(a, b) for a, b in es] + [novelty(b, a) for a, b in es])
print(f" {name:18s} {mean([overlap(*e) for e in es]):10.3f} {nov:8.3f}")
def giant(keep):
par = list(range(N))
def find(x):
while par[x] != x:
par[x] = par[par[x]]; x = par[x]
return x
for a, b in keep:
ra, rb = find(a), find(b)
if ra != rb: par[ra] = rb
size = {}
for x in range(N):
r = find(x); size[r] = size.get(r, 0) + 1
return max(size.values()) / N
order = sorted(edges, key=lambda e: (overlap(*e), rng.random()))
shuffled = edges[:]; rng.shuffle(shuffled)
print("largest component (share of people) after removing a share of ties:")
print(" removed low overlap first random high overlap first")
for f in (0.0, 0.03, 0.06, 0.08, 0.1, 0.2, 0.4):
k = int(f * len(edges))
low, rnd = giant(order[k:]), giant(shuffled[k:])
high = giant(order[:len(edges) - k])
print(f" {f:4.0%} {low:6.2f} {rnd:6.2f} {high:6.2f}")Single source and citation
Fan, Y. (2026). Social Network Topology, Structural Holes and Complex Contagion (Version 1.0.0), Chapter 1: The Strength of Weak Ties and Small Worlds. 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 2 · Structural Holes: Closure and Brokerage
- Chapter 3 · Simple and Complex Contagion
- 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