关于「零互惠边:首季沉默流失的结构信号与识别难题」,《私董社群的互惠边与破冰配对》给出的定量结论是什么?
结论:第一章普查一个示意社群:74 个有往来的有向对只形成 15 条互惠边,并用两个模拟世界说明,风险比 6.09 与 2.69 都可能出自互惠边毫无作用的世界。
数据口径:书中的社群、成员、属性与概率均为示意;全部计算由书中程序生成;本书是非个人化经营建议,只使用成员明示同意的数据,不做个人画像,退群自由,退款按约定。 第一章普查一个示意社群:74 个有往来的有向对只形成 15 条互惠边,并用两个模拟世界说明,风险比 6.09 与 2.69 都可能出自互惠边毫无作用的世界。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 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 |
查看完整验算程序
# 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)))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《高客单私董社群防退群内聚拓扑、度中心性互惠边权重与破冰配对算法母典》第 1 章「零互惠边:首季沉默流失的结构信号与识别难题」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 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}
}