关于「实践与预注册试验」,《社会网络与结构洞》给出的定量结论是什么?

结论:第八章给出一份四步拓扑核查表,以及一项以团队为单位随机化的预注册试验方案:比较「先独立匿名写下判断与理由、公开汇总后再讨论」与「按资历顺序公开表态」,唯一主要结局为团队最终估计向前两位发言者初始估计的锚定指数,每组 50 个可分析团队、招募 59 个,共 118 个团队、590 人,判定规则写成代码。书中以标注框区分已发表的证据、可运行的 Python 计算(15 段程序,全部核对)、原典与作者的假说。本书不传授任何操纵他人关系网的技巧;作者经营的网红营销与数字营销业务与本书主题有直接商业利益,已在书中披露。

数据口径:书中以标注框区分已发表的证据、可运行的 Python 计算(15 段程序,全部核对)、原典与作者的假说。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 118, 15, 50, 59, 590

teams per arm for 90 % power (10 tasks per team)
difference | ICC rho0.2 | 0.3 | 0.5
0.08 |59 | 77 | 114
0.10 |38 | 50 | 74
0.12 |27 | 35 | 52
chosen0.10, rho = 0.30 -> 50 analysable teams per arm; allowing 15 % loss
recruit 59 teams per arm118 teams, 590 people
ignoring clustering (tasks as independent) would suggest only 15 teams per arm;
design effect 1 + (m - 1) rho3.70
simulation check: power with 50 teams per arm0.91; with 15 = 0.46
查看完整验算程序
# 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}")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《社会网络拓扑、结构洞与复杂传染的数学模型》第 8 章「实践与预注册试验」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.23764990

DOI: 10.5281/zenodo.23764990 · 阅读本章所在专著 · 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}
}

本书其他章节结论