关于「东西方原典考辨:「周而不比」与欧拉多面体公式」,《社群拓扑体检》给出的定量结论是什么?
结论:《论语》的「周而不比」可以写成两个可算的指标:周对应一维条码 L3,比对应零维短条。在合成数据上,真实环形社群 50 个中有 41 个周而不比,补量社群 48 个比而不周;但真实的封闭俱乐部有 49 个比而不周,与补量社群无法区分,含家庭的社群里周与比兼有或皆无的接近一半。欧拉的多面体公式对五种正多面体成立,对七顶点环面不成立,贝蒂数 1、2、1 解释了原因。两部原典都给出了一个正确的结构区分,也都说得过宽。最后一章要把这些结构量放回社群的日常运营:一个主事者每个月该怎么做,什么样的数据会推翻本书?
数据口径:书中所有社群与成员都是固定种子的合成数据,不使用任何真实社群或个人的数据;全部计算由书中程序生成,参数为示意;本书是非个人化经营建议,「水军识别」只产出供人工复核的嫌疑名单,不自动处罚任何成员。 第二章用并查集求零维条码、用模 2 列约化求一维条码,在两百个合成社群上,点赞总数的 AUC 只有 0.427,一维条码前三长之和 L3 为 0.975;补量社群的真实核心增至 30 人时降到 0.673,此时须靠零维短条。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 41, 48, 49
| type | mean zhou | mean bi | zhou¬-bi | bi¬-zhou | both | neither |
|---|---|---|---|---|---|---|
| A | 0.2365 | 0.001 | 41 | 0 | 0 | 9 |
| B | 0.0773 | 0.563 | 0 | 48 | 2 | 0 |
| C | 0.1875 | 0.077 | 22 | 4 | 6 | 18 |
| D | 0.0359 | 0.673 | 0 | 49 | 1 | 0 |
查看完整验算程序
# Chapter 7. p72: "Zhou" and "bi" as two measurable indices.
# Zhou (broad ties) = L3, the lead-3 one-dimensional persistence.
# Bi (closed faction) = short H0 bars per account below delta 0.2.
# Four synthetic archetypes, 50 each, fixed seed: A genuine ring of
# 30; B padded, 12 real + 18 lockstep; C genuine ring of 22 with two
# real families of 4; D a genuine club of 6 closed groups of 5 with
# narrow, separate interests. Quadrant lines: L3 0.1786 (p41), bi 0.10.
import math
import random
T, P = 24, 5 # 24 topics on a ring, 5 posts each (illustrative)
N_POSTS = T * P
def member(rng, centre, width, q=0.8, stray=0.03):
# a genuine member likes posts on an arc of topics around centre
s = set()
for t in range(T):
dd = abs(t - centre) % T
dd = min(dd, T - dd)
hit = q if dd <= width / 2.0 else stray
for k in range(P):
if rng.random() < hit:
s.add(t * P + k)
return s
def sock(rng, target, q=0.95, stray=0.01):
# a boosting account likes the operator's target posts in lockstep
s = set()
for p in range(N_POSTS):
if rng.random() < (q if p in target else stray):
s.add(p)
return s
def community(rng, n_real, arc, n_sock):
# n_real genuine members with interest centres on [0, arc) topics,
# plus n_sock boosting accounts aimed at 30 target posts
pts = []
for _ in range(n_real):
pts.append(member(rng, rng.uniform(0, arc), rng.randint(5, 8)))
target = set(rng.sample(range(N_POSTS), 30))
for _ in range(n_sock):
pts.append(sock(rng, target))
return pts
def jaccard(a, b):
u = len(a | b)
return 1.0 - len(a & b) / u if u else 0.0
def barcodes(pts, cap=1.0):
return barcodes_d(len(pts), lambda i, j: jaccard(pts[i], pts[j]), cap)
def barcodes_d(n, dist, cap=1.0):
# Vietoris-Rips filtration (up to triangles) of a distance dist(i, j).
# H0 by union-find; H1 by mod-2 reduction of triangle columns,
# each column stored as a Python integer used as a bitset of edges.
edges = []
for i in range(n):
for j in range(i + 1, n):
d = dist(i, j)
if d <= cap:
edges.append((d, i, j))
edges.sort()
eid = {(i, j): k for k, (d, i, j) in enumerate(edges)}
par = list(range(n))
def find(x):
while par[x] != x:
par[x] = par[par[x]]
x = par[x]
return x
h0, neg = [], set()
for k, (d, i, j) in enumerate(edges):
a, b = find(i), find(j)
if a != b:
par[max(a, b)] = min(a, b)
h0.append((d, i, j))
neg.add(k)
tris = []
for (i, j), e in eid.items():
for k in range(j + 1, n):
f, g = eid.get((i, k)), eid.get((j, k))
if f is not None and g is not None:
tris.append(tuple(sorted((e, f, g), reverse=True)))
tris.sort()
piv, h1 = {}, []
for t in tris:
col = (1 << t[0]) | (1 << t[1]) | (1 << t[2])
while col:
low = col.bit_length() - 1
if low not in piv:
piv[low] = col
break
col ^= piv[low]
if col and edges[t[0]][0] > edges[low][0]:
h1.append((edges[low][0], edges[t[0]][0]))
for k in range(len(edges)):
if k not in neg and k not in piv:
h1.append((edges[k][0], cap)) # still open at the cap
return h0, h1
def lead3(h1):
# length of the three longest one-dimensional bars, added exactly
top = sorted((d - b for b, d in h1), reverse=True)[:3]
return math.fsum(top)
def short_frac(h0, n, delta=0.2):
# zero-dimensional bars dying below delta, per account
return len([1 for d, i, j in h0 if d < delta]) / float(n)
def family(rng, k, keep=0.85, width=None):
base = member(rng, rng.uniform(0, 24), width or rng.randint(5, 8))
return [set(p for p in sorted(base) if rng.random() < keep)
for _ in range(k)]
def make(rng, kind):
if kind == "A":
return community(rng, 30, 24, 0)
if kind == "B":
return community(rng, 12, 24, 18)
if kind == "C":
return (community(rng, 22, 24, 0) + family(rng, 4)
+ family(rng, 4))
pts = []
for _ in range(6):
pts += family(rng, 5, keep=0.9, width=2)
return pts
rng = random.Random(20261113)
print("type mean zhou mean bi zhou¬-bi bi¬-zhou both neither")
for kind in "ABCD":
z, b, quad = [], [], [0, 0, 0, 0]
for _ in range(50):
pts = make(rng, kind)
h0, h1 = barcodes(pts)
zi, bi = lead3(h1), short_frac(h0, len(pts))
z.append(zi)
b.append(bi)
hz, hb = zi > 0.1786, bi > 0.10
quad[0 if hz and not hb else 1 if hb and not hz
else 2 if hz else 3] += 1
print(" %s %.4f %.3f %5d %5d %3d %5d"
% ((kind, math.fsum(z) / 50, math.fsum(b) / 50) + tuple(quad)))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《持续同调拓扑贝蒂数、高净值私域社群结构空洞与虚假抱团水军识别母典》第 7 章「东西方原典考辨:「周而不比」与欧拉多面体公式」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-236 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026236,
author = {Fan, Yafu},
title = {Persistent Homology and Betti Numbers: Structural Voids in High-Net-Worth Private Communities and the Review of Fake Cliques},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}