What does Reciprocal Edges and Ice-Breaking Pairs in Peer Boards conclude, in numbers, about “Degree, Betweenness and Structural Holes: Whose Exit Would Cut the Board Apart”?

Answer: Chapter 2 computes degree, betweenness and constraint; deleting the hub drops the share of member pairs still able to reach each other from 0.758 to 0.229.

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.229, 0.758

intact board: isolates 2, components 3, pairs joined 0.758
removedegisolatescomponentspairs joined
M157570.229
M083240.457
M063450.524
M033340.629
M163340.629
M011230.743
any one of the 7 single-edge members leaves: min 0.743, max 0.743
Show the full program
# Chapter 2. p22: whose exit would split the board?
# Same illustrative board and reciprocal graph as p11 and p21. For each
# member we delete that member and count, among the other 15: members
# left with no reciprocal edge, connected components (isolates count
# as components), and the share of the 105 member pairs still joined
# by some path. A pure what-if on structure, not a forecast of anyone.
import random
from collections import deque

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 components(nodes, adj):
    seen, comps = set(), []
    for s in sorted(nodes):
        if s in seen:
            continue
        comp, dq = [s], deque([s])
        seen.add(s)
        while dq:
            v = dq.popleft()
            for w in adj[v]:
                if w in nodes and w not in seen:
                    seen.add(w)
                    comp.append(w)
                    dq.append(w)
        comps.append(comp)
    return comps


mem, cnt = make_board()
n = len(cnt)
adj = [[j for j in range(n) if j != i and cnt[i][j] and cnt[j][i]]
       for i in range(n)]


def after_removal(x):
    nodes = set(range(n)) - {x}
    iso = len([v for v in nodes if not [w for w in adj[v] if w != x]])
    comps = components(nodes, adj)
    joined = 0
    for c in comps:
        joined += len(c) * (len(c) - 1) // 2  # step
    return iso, len(comps), joined / 105


base = components(set(range(n)), adj)
pairs0 = 0
for c in base:
    pairs0 += len(c) * (len(c) - 1) // 2  # step
print("intact board: isolates %d, components %d, pairs joined %.3f"
      % (len([v for v in range(n) if not adj[v]]), len(base),
         pairs0 / 120))
print("remove  deg  isolates  components  pairs joined")
rows = [(x,) + after_removal(x) for x in range(n)]
for x, iso, nc, share in sorted(rows, key=lambda r: (r[3], r[0]))[:6]:
    print(" M%02d    %3d     %3d        %3d        %.3f"
          % (x + 1, len(adj[x]), iso, nc, share))
leaves = [r for r in rows if len(adj[r[0]]) == 1]
print("any one of the %d single-edge members leaves: min %.3f, max %.3f"
      % (len(leaves), min(r[3] for r in leaves),
         max(r[3] for r in leaves)))

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 2: Degree, Betweenness and Structural Holes: Whose Exit Would Cut the Board Apart. 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