Cohesion Topology of High-Ticket Peer Boards and First-Quarter Silent Attrition: Degree Centrality, Reciprocal Edge Weights and Ice-Breaking Pairing Algorithms: chapter answers
The commonest loss in a high-ticket peer board is not a loud resignation but silence: the fee is paid, two meetings are attended, and the member is never seen again. The project blueprint claimed that first-quarter silent attrition comes mainly from members with no reciprocal edge in the board, and that pairing by shared attributes plus centrality builds reciprocal edges better than random ice-breaking. Having checked the sources, this book revises the claim: neither Granovetter's 1973 paper nor the 2006 paper by Backstrom and colleagues measured attrition in any community, and having no reci…
DOI pending · monograph page goes live after publication · 5DL-B-278 · 中文版
- Chapter 1 · No Reciprocal Edge: a Structural Signal of First-Quarter Silent Attrition and the Problem of Identifying It
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 reciproca… - Chapter 2 · Degree, Betweenness and Structural Holes: Whose Exit Would Cut the Board Apart
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. - Chapter 3 · Weighing Reciprocal Edges: Chat Volume, Two-Way Exchange and a Random Baseline
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. - Chapter 4 · Maximum-Weight Matching for Ice-Breaking Pairs: Exact Recursion, Greed, Rotation and Three Possible Worlds
Chapter 4 solves exact maximum-weight matching by bitmask recursion and tests its edge over random pairing in three possible worlds: 0.766 more reciprocal edges per round when the score is right, none when attributes do… - Chapter 5 · Stable Pairing: Irving's Roommates Algorithm, Instances without a Solution and the Price of Satisfaction
Chapter 5 finds stable pairs with Irving's roommates algorithm; under random rankings a board of sixteen has a stable pairing with probability 0.8485. - Chapter 6 · Similarity and Bridging: the Structural Cost of Pairing and the Ethical Limits of Risk Labels
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. - Chapter 7 · Eastern and Western Sources Examined: the Joined Lakes of the Dui Hexagram and Aristotle on Friendship
The "joined lakes" and the "discussing and practising together" of the Dui hexagram can be written as a model of reciprocal bridges between two sub-groups. Program p71 shows that the first reciprocal bridge brings the a… - Chapter 8 · Closing the Loop: the Intake Pairing Sheet, the Ice-Breaker Pairing Planner and a Pre-Registered Test
Chapter 8 gives the intake pairing sheet, the distilled Ice-Breaker Pairing Planner and a pre-registered test plan needing about 34 intake cohorts per arm with reciprocal edges as the primary outcome. Marked boxes separ…
Illustrative model calculation, not a live quote