What does Reciprocal Edges and Ice-Breaking Pairs in Peer Boards conclude, in numbers, about “Weighing Reciprocal Edges: Chat Volume, Two-Way Exchange and a Random Baseline”?

Answer: Chapter 3 compares four tie weights and tests reciprocity against an out-degree-preserving null, with a one-sided p-value of only 0.0747 on a single board.

Scope of the numbers: Chapter 1 takes a census of an illustrative board, where 74 directed pairs with contact form only 15 reciprocal edges, and shows with two simulated worlds that risk ratios of 6.09 and 2.69 can both arise where reciprocal edges do nothing. Marked boxes separate published evidence, runnable Python calculations (18 programs), 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: 0.0747

arcs L74, density a = 0.3083
observed r0.4054, rho = 0.1403
null r: mean 0.3005, sd 0.0634, 95th pct 0.4054
z1.65, one-sided p = 0.0747
r within sector 0.400 (20 arcs), across sectors 0.407 (54 arcs)
Show the full program
# Chapter 3. p32: is the board more reciprocal than chance?
# Same illustrative board as p11. r = share of arcs whose reverse arc
# also exists; density a = L / (n (n - 1)); Garlaschelli and Loffredo
# (2004): rho = (r - a) / (1 - a), > 0 means more mutual than random.
# Null model: each member keeps the number of people they contacted
# (out-degree) but the targets are redrawn uniformly; 4,000 draws with
# a fixed seed. One-sided p = share of null draws with r >= observed.
import math
import random

SECT = ["MFG", "RET", "SVC", "TEC"]
CITY = ["SH", "SZ", "BJ"]


def make_board(seed=278, n=16):
    rng = random.Random(seed)
    mem = []
    for _ in range(n):
        mem.append({"sec": SECT[rng.randrange(4)],
                    "city": CITY[rng.randrange(3)],
                    "band": 1 + rng.randrange(3),
                    "act": 0.15 + 0.85 * rng.random() ** 1.6})
    cnt = [[0] * n for _ in range(n)]
    for a in range(n):
        for b in range(n):
            if a == b:
                continue
            sim = ((mem[a]["sec"] == mem[b]["sec"])
                   + (mem[a]["city"] == mem[b]["city"])
                   + (abs(mem[a]["band"] - mem[b]["band"]) <= 1))
            q = mem[a]["act"] * (0.035 + 0.045 * sim)
            cnt[a][b] = len([t for t in range(6) if rng.random() < q])
    return mem, cnt


def recip(arcs):
    if not arcs:
        return 0.0
    return len([1 for (i, j) in arcs if (j, i) in arcs]) / len(arcs)


mem, cnt = make_board()
n = len(cnt)
arcs = {(i, j) for i in range(n) for j in range(n) if cnt[i][j]}
r = recip(arcs)
a = len(arcs) / (n * (n - 1))
rho = (r - a) / (1 - a)
print("arcs L = %d, density a = %.4f" % (len(arcs), a))
print("observed r = %.4f, rho = %.4f" % (r, rho))
outdeg = [len([j for j in range(n) if cnt[i][j]]) for i in range(n)]
rng = random.Random(20261113)
null = []
for _ in range(4000):
    sim = set()
    for i in range(n):
        others = [j for j in range(n) if j != i]
        for j in rng.sample(others, outdeg[i]):
            sim.add((i, j))
    null.append(recip(sim))
null.sort()
mean = math.fsum(null) / len(null)
sd = math.sqrt(math.fsum((x - mean) ** 2 for x in null) / (len(null) - 1))
hits = len([x for x in null if x >= r - 1e-12])
print("null r: mean %.4f, sd %.4f, 95th pct %.4f"
      % (mean, sd, null[int(0.95 * len(null))]))
print("z = %.2f, one-sided p = %.4f" % ((r - mean) / sd, hits / len(null)))
same = [(i, j) for (i, j) in arcs if mem[i]["sec"] == mem[j]["sec"]]
diff = [(i, j) for (i, j) in arcs if mem[i]["sec"] != mem[j]["sec"]]
print("r within sector %.3f (%d arcs), across sectors %.3f (%d arcs)"
      % (recip(set(same)), len(same),
         len([1 for (i, j) in diff if (j, i) in arcs]) / len(diff),
         len(diff)))

Single source and citation

Fan, Y. (2026). Cohesion Topology of High-Ticket Peer Boards and First-Quarter Silent Attrition: Degree Centrality, Reciprocal Edge Weights and Ice-Breaking Pairing Algorithms (Version 1.0.0), Chapter 3: Weighing Reciprocal Edges: Chat Volume, Two-Way Exchange and a Random Baseline. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-278 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026278,
  author    = {Fan, Yafu},
  title     = {Cohesion Topology of High-Ticket Peer Boards and First-Quarter Silent Attrition: Degree Centrality, Reciprocal Edge Weights and Ice-Breaking Pairing Algorithms},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book