What does Reciprocal Edges and Ice-Breaking Pairs in Peer Boards conclude, in numbers, about “Similarity and Bridging: the Structural Cost of Pairing and the Ethical Limits of Risk Labels”?

Answer: Chapter 6 does the structural accounts of similar and bridging pairs and shows that "no reciprocal edge" used as a risk label is right only 0.240 of the time.

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.240

bpiRRexit|flagflagged who staymembersboards
(per 16 members)neededof 16
0.080.2520.1283.49109369
0.080.2530.1603.36104466
0.080.4020.1145.67109669
0.080.4030.1335.55121877
0.120.2520.1923.2368743
0.120.2530.2403.0465541
0.120.4020.1715.3069844
0.120.4030.2005.1277949
0.200.2520.3202.7236323
0.200.2530.4002.4034322
0.200.4020.2864.5738024
0.200.4030.3334.2742927
Show the full program
# Chapter 6. p62: why "zero reciprocal edges" must not become a label.
# b = quarterly silent-exit rate of the whole board, pi = share of
# zero-edge members, RR = exit risk ratio (zero-edge versus others):
#   p0 = b / (pi RR + 1 - pi),  p1 = RR p0.
# p1 is the chance that a zero-edge member exits (the "precision" of
# the flag); flagged members who stay = pi (1 - p1) per member.
# Members needed so the 95% CI of RR spans at most a factor 1.5 each
# way: N = (1.96 / ln 1.5)^2 ((1-p1)/(pi p1) + (1-p0)/((1-pi) p0)).
# All rates illustrative; boards of 16 members.
import math

print("  b    pi   RR   exit|flag  flagged who stay  members  boards")
print("                            (per 16 members)   needed  of 16")
for b in (0.08, 0.12, 0.20):
    for pi in (0.25, 0.4):
        for rr in (2.0, 3.0):
            p0 = b / (pi * rr + 1 - pi)
            p1 = rr * p0
            stay = 16 * pi * (1 - p1)
            var = (1 - p1) / (pi * p1) + (1 - p0) / ((1 - pi) * p0)
            need = math.ceil((1.96 / math.log(1.5)) ** 2 * var)
            print(" %.2f  %.2f  %.0f     %.3f          %5.2f        %5d"
                  "  %5d" % (b, pi, rr, p1, stay, need,
                             math.ceil(need / 16)))

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 6: Similarity and Bridging: the Structural Cost of Pairing and the Ethical Limits of Risk Labels. 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