关于「互惠边的权重:聊天量、双向往来与随机基准」,《私董社群的互惠边与破冰配对》给出的定量结论是什么?
结论:第三章比较边的四种权重,并以保出度零模型检验互惠,单个社群的单侧 p 值只有 0.0747。
数据口径:书中的社群、成员、属性与概率均为示意;全部计算由书中程序生成;本书是非个人化经营建议,只使用成员明示同意的数据,不做个人画像,退群自由,退款按约定。 第一章普查一个示意社群:74 个有往来的有向对只形成 15 条互惠边,并用两个模拟世界说明,风险比 6.09 与 2.69 都可能出自互惠边毫无作用的世界。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.0747
| arcs L | 74, density a = 0.3083 |
| observed r | 0.4054, rho = 0.1403 |
| null r: mean 0.3005, sd 0.0634, 95th pct 0.4054 | |
| z | 1.65, one-sided p = 0.0747 |
| r within sector 0.400 (20 arcs), across sectors 0.407 (54 arcs) |
查看完整验算程序
# Chapter 3. p32: is the board more reciprocal than chance?
# Same illustrative board as p11. r = share of arcs whose reverse arc
# also exists; density a = L / (n (n - 1)); Garlaschelli and Loffredo
# (2004): rho = (r - a) / (1 - a), > 0 means more mutual than random.
# Null model: each member keeps the number of people they contacted
# (out-degree) but the targets are redrawn uniformly; 4,000 draws with
# a fixed seed. One-sided p = share of null draws with r >= observed.
import math
import random
SECT = ["MFG", "RET", "SVC", "TEC"]
CITY = ["SH", "SZ", "BJ"]
def make_board(seed=278, n=16):
rng = random.Random(seed)
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 recip(arcs):
if not arcs:
return 0.0
return len([1 for (i, j) in arcs if (j, i) in arcs]) / len(arcs)
mem, cnt = make_board()
n = len(cnt)
arcs = {(i, j) for i in range(n) for j in range(n) if cnt[i][j]}
r = recip(arcs)
a = len(arcs) / (n * (n - 1))
rho = (r - a) / (1 - a)
print("arcs L = %d, density a = %.4f" % (len(arcs), a))
print("observed r = %.4f, rho = %.4f" % (r, rho))
outdeg = [len([j for j in range(n) if cnt[i][j]]) for i in range(n)]
rng = random.Random(20261113)
null = []
for _ in range(4000):
sim = set()
for i in range(n):
others = [j for j in range(n) if j != i]
for j in rng.sample(others, outdeg[i]):
sim.add((i, j))
null.append(recip(sim))
null.sort()
mean = math.fsum(null) / len(null)
sd = math.sqrt(math.fsum((x - mean) ** 2 for x in null) / (len(null) - 1))
hits = len([x for x in null if x >= r - 1e-12])
print("null r: mean %.4f, sd %.4f, 95th pct %.4f"
% (mean, sd, null[int(0.95 * len(null))]))
print("z = %.2f, one-sided p = %.4f" % ((r - mean) / sd, hits / len(null)))
same = [(i, j) for (i, j) in arcs if mem[i]["sec"] == mem[j]["sec"]]
diff = [(i, j) for (i, j) in arcs if mem[i]["sec"] != mem[j]["sec"]]
print("r within sector %.3f (%d arcs), across sectors %.3f (%d arcs)"
% (recip(set(same)), len(same),
len([1 for (i, j) in diff if (j, i) in arcs]) / len(diff),
len(diff)))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《高客单私董社群防退群内聚拓扑、度中心性互惠边权重与破冰配对算法母典》第 3 章「互惠边的权重:聊天量、双向往来与随机基准」(版本 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}
}