What does Social Networks and Structural Holes conclude, in numbers, about “Practice and a Pre-registered Trial”?
Answer: 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 order of seniority" (single primary outcome: an index of the anchoring of the team's final estimate on the first two speakers' initial estimates; 50 analysable and 59 recruited teams per arm, 118 teams and 590 people in all; decision rule written as code). Marked boxes separate published evidence, runnable Python calculations (15 programs, all checked), classical sources and the author's hypotheses. The book teaches no technique for manipulating other people's networks; the author's influencer- and digital-marketing business has a direct commercial interest in its subject, which is disclosed in the book.
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 onlyprinted values that match the answer: 118, 15, 50, 59, 590
| teams per arm for 90 % power (10 tasks per team) | |
| difference | ICC rho | 0.2 | 0.3 | 0.5 |
| 0.08 | | 59 | 77 | 114 |
| 0.10 | | 38 | 50 | 74 |
| 0.12 | | 27 | 35 | 52 |
| chosen | 0.10, rho = 0.30 -> 50 analysable teams per arm; allowing 15 % loss |
| recruit 59 teams per arm | 118 teams, 590 people |
| ignoring clustering (tasks as independent) would suggest only 15 teams per arm; | |
| design effect 1 + (m - 1) rho | 3.70 |
| simulation check: power with 50 teams per arm | 0.91; with 15 = 0.46 |
Show the full program
# Sample size for the Chapter 8 trial. Unit of randomisation and analysis: the
# 5-person team. Each team does m = 10 estimation tasks with known answers.
# Per task, the anchoring index c = |G - R| / (|G - F| + |G - R|) on log
# estimates (G agreed group estimate, F mean private estimate of the first two
# speakers, R mean of the other three); team score = mean c over its tasks.
# Assumptions (to be confirmed): SD of c across tasks sigma = 0.25; share of
# that variance lying between teams (ICC) rho = 0.30; smallest difference of
# interest 0.10; two-sided alpha 0.05; power 0.90; normal approximation + 1.
import math, random
from statistics import NormalDist
Z = NormalDist().inv_cdf(0.975) + NormalDist().inv_cdf(0.90)
SIGMA, M = 0.25, 10
def teams_per_arm(delta, rho, m=M, sigma=SIGMA):
var_team = sigma ** 2 * (rho + (1 - rho) / m) # variance of a team mean
return math.ceil(2 * Z ** 2 * var_team / delta ** 2) + 1
print("teams per arm for 90 % power (10 tasks per team)")
print(" difference | ICC rho = 0.2 | 0.3 | 0.5")
for delta in (0.08, 0.10, 0.12):
print(f" {delta:.2f} | {teams_per_arm(delta, 0.2):13d} |"
f" {teams_per_arm(delta, 0.3):3d} | {teams_per_arm(delta, 0.5):3d}")
n = teams_per_arm(0.10, 0.30); rec = math.ceil(n / 0.85)
print(f"chosen: 0.10, rho = 0.30 -> {n} analysable teams per arm;"
" allowing 15 % loss")
print(f" recruit {rec} teams per arm: {2 * rec} teams, {2 * rec * 5} people")
naive = math.ceil(2 * Z ** 2 * SIGMA ** 2 / 0.10 ** 2 / M) + 1
print(f"ignoring clustering (tasks as independent) would suggest only {naive}"
" teams per arm;")
print(f" design effect 1 + (m - 1) rho = {1 + (M - 1) * 0.30:.2f}")
rng = random.Random(15)
def sim_power(teams, delta, rho, sims=2000):
hits = 0
for _ in range(sims):
means = []
for arm_shift in (0.0, delta):
sd_b, sd_w = SIGMA * math.sqrt(rho), SIGMA * math.sqrt(1 - rho)
means.append([arm_shift + rng.gauss(0, sd_b) +
sum(rng.gauss(0, sd_w) for _ in range(M)) / M
for _ in range(teams)])
a, b = means
ma, mb = sum(a) / teams, sum(b) / teams
va = sum((x - ma) ** 2 for x in a) / (teams - 1)
vb = sum((x - mb) ** 2 for x in b) / (teams - 1)
hits += abs(mb - ma) / math.sqrt((va + vb) / teams) > 1.96
return hits / sims
p1, p2 = sim_power(n, 0.10, 0.30), sim_power(naive, 0.10, 0.30)
print(f"simulation check: power with {n} teams per arm = {p1:.2f};"
f" with {naive} = {p2:.2f}")Single source and citation
Fan, Y. (2026). Social Network Topology, Structural Holes and Complex Contagion (Version 1.0.0), Chapter 8: Practice and a Pre-registered Trial. 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 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