What does Reciprocal Edges and Ice-Breaking Pairs in Peer Boards conclude, in numbers, about “No Reciprocal Edge: a Structural Signal of First-Quarter Silent Attrition and the Problem of Identifying It”?
Answer: 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.
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: 15, 74
| id | sec city band | out | in | sent | recv | recip | ||
| M01 | SVC | SZ | 2 | 1 | 5 | 1 | 7 | 1 |
| M02 | TEC | SZ | 1 | 5 | 3 | 5 | 4 | 2 |
| M03 | RET | SZ | 2 | 8 | 6 | 9 | 9 | 3 |
| M04 | MFG | SZ | 3 | 4 | 2 | 5 | 2 | 0 |
| M05 | TEC | BJ | 1 | 3 | 5 | 4 | 8 | 1 |
| M06 | TEC | BJ | 3 | 7 | 4 | 13 | 5 | 3 |
| M07 | SVC | BJ | 1 | 6 | 3 | 7 | 6 | 1 |
| M08 | RET | BJ | 2 | 7 | 4 | 8 | 4 | 3 |
| M09 | TEC | SZ | 2 | 0 | 6 | 0 | 8 | 0 |
| M10 | MFG | BJ | 2 | 3 | 3 | 3 | 4 | 1 |
| M11 | RET | SZ | 3 | 3 | 6 | 3 | 6 | 1 |
| M12 | RET | BJ | 3 | 5 | 5 | 5 | 5 | 1 |
| M13 | RET | BJ | 3 | 1 | 6 | 1 | 6 | 1 |
| M14 | MFG | SZ | 1 | 5 | 2 | 6 | 4 | 2 |
| M15 | RET | SZ | 2 | 9 | 8 | 17 | 10 | 7 |
| M16 | SVC | SZ | 1 | 7 | 6 | 8 | 7 | 3 |
| arcs (a->b with >=1 contact): 74 | ||||||||
| reciprocal edges: 15; share of arcs reciprocated: 0.405 | ||||||||
| members with zero reciprocal edges: 2 of 16: M04 M09 |
Show the full program
# Chapter 1. p11: a census of reciprocal edges on one illustrative board.
# Model: 16 members of a high-ticket peer board, first 90 days. Each
# ordered pair (a, b) carries a count of consented, member-initiated
# contacts from a to b (1:1 calls booked, follow-up notes after a
# session). A reciprocal edge needs at least one contact each way.
# Attributes (sector, city, size band) are fields members opted in to
# share. Every number is illustrative, generated with a fixed seed.
import math
import random
SECT = ["MFG", "RET", "SVC", "TEC"]
CITY = ["SH", "SZ", "BJ"]
def make_board(n=16):
rng = random.Random(278)
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 reciprocal(cnt):
n = len(cnt)
return [[1 if i != j and cnt[i][j] > 0 and cnt[j][i] > 0 else 0
for j in range(n)] for i in range(n)]
mem, cnt = make_board()
n = len(mem)
rec = reciprocal(cnt)
print("id sec city band out in sent recv recip")
zero = []
for i in range(n):
out_d = len([j for j in range(n) if cnt[i][j] > 0])
in_d = len([j for j in range(n) if cnt[j][i] > 0])
sent = int(math.fsum(cnt[i]))
recv = int(math.fsum(cnt[j][i] for j in range(n)))
r = int(math.fsum(rec[i]))
if r == 0:
zero.append("M%02d" % (i + 1))
print("M%02d %s %s %d %3d %3d %4d %4d %5d"
% (i + 1, mem[i]["sec"], mem[i]["city"], mem[i]["band"],
out_d, in_d, sent, recv, r))
arcs = len([1 for i in range(n) for j in range(n) if cnt[i][j] > 0])
mutual = len([1 for i in range(n) for j in range(n) if rec[i][j]])
print("arcs (a->b with >=1 contact): %d" % arcs)
print("reciprocal edges: %d; share of arcs reciprocated: %.3f"
% (mutual // 2, mutual / arcs))
print("members with zero reciprocal edges: %d of %d: %s"
% (len(zero), n, " ".join(zero)))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 1: No Reciprocal Edge: a Structural Signal of First-Quarter Silent Attrition and the Problem of Identifying It. 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
- Chapter 2 · Degree, Betweenness and Structural Holes: Whose Exit Would Cut the Board Apart
- Chapter 3 · Weighing Reciprocal Edges: Chat Volume, Two-Way Exchange and a Random Baseline
- Chapter 4 · Maximum-Weight Matching for Ice-Breaking Pairs: Exact Recursion, Greed, Rotation and Three Possible Worlds
- Chapter 5 · Stable Pairing: Irving's Roommates Algorithm, Instances without a Solution and the Price of Satisfaction
- Chapter 6 · Similarity and Bridging: the Structural Cost of Pairing and the Ethical Limits of Risk Labels
- Chapter 7 · Eastern and Western Sources Examined: the Joined Lakes of the Dui Hexagram and Aristotle on Friendship
- Chapter 8 · Closing the Loop: the Intake Pairing Sheet, the Ice-Breaker Pairing Planner and a Pre-Registered Test