关于「活跃不等于有环:三角闭合、传递性与互刷团块」,《社群拓扑体检》给出的定量结论是什么?

结论:第一章说明互刷团块可以把传递性抬到 0.996(真实社群为 0.671),而它在拓扑上是实心的,一维贝蒂数为零。

数据口径:书中所有社群与成员都是固定种子的合成数据,不使用任何真实社群或个人的数据;全部计算由书中程序生成,参数为示意;本书是非个人化经营建议,「水军识别」只产出供人工复核的嫌疑名单,不自动处罚任何成员。 第二章用并查集求零维条码、用模 2 列约化求一维条码,在两百个合成社群上,点赞总数的 AUC 只有 0.427,一维条码前三长之和 L3 为 0.975;补量社群的真实核心增至 30 人时降到 0.673,此时须靠零维短条。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.671, 0.996

metricgenuinepadded
members3030
likes (activity)865880
likes per member28.83329.333
co-engagement edges100166
triangles133819
transitivity0.6710.996
triangles inside sock block0816
share of triangles in block0.0000.996
H1 lead-3 persistence L30.2700.095
short H0 bars per account0.0000.533
padded / genuine likes = 1.017
查看完整验算程序
# Chapter 1. p11: A padded community out-scores a genuine one on activity.
# Synthetic data only, fixed seed; no real community or person is used.
# 24 topics on a ring with 5 posts each. Genuine: 30 members whose
# interest arcs cover the whole ring. Padded: 12 real members plus 18
# lockstep boosting accounts. Activity = likes. Co-engagement graph:
# an edge when the Jaccard distance of two liked-post sets is <= 0.75.
# Parameters are illustrative, not estimates from any platform.
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 graph_stats(pts, first_sock):
    n = len(pts)
    adj = [[i != j and jaccard(pts[i], pts[j]) <= 0.75
            for j in range(n)] for i in range(n)]
    likes = edges = tri = block = wedges = 0
    for i in range(n):
        likes += len(pts[i])
        deg = len([j for j in range(n) if adj[i][j]])
        wedges += deg * (deg - 1) // 2
        for j in range(i + 1, n):
            if not adj[i][j]:
                continue
            edges += 1
            for k in range(j + 1, n):
                if adj[i][k] and adj[j][k]:
                    tri += 1
                    if i >= first_sock:
                        block += 1
    trans = 3.0 * tri / wedges if wedges else 0.0
    h0, h1 = barcodes(pts)
    return [n, likes, likes / float(n), edges, tri, trans, block,
            block / float(tri) if tri else 0.0, lead3(h1),
            short_frac(h0, n)]


rng = random.Random(20261113)
gen = graph_stats(community(rng, 30, 24, 0), 30)
pad = graph_stats(community(rng, 12, 24, 18), 12)
rows = ["members", "likes (activity)", "likes per member",
        "co-engagement edges", "triangles", "transitivity",
        "triangles inside sock block", "share of triangles in block",
        "H1 lead-3 persistence L3", "short H0 bars per account"]
print("%-30s %10s %10s" % ("metric", "genuine", "padded"))
for k, name in enumerate(rows):
    a, b = gen[k], pad[k]
    if isinstance(a, int):
        print("%-30s %10d %10d" % (name, a, b))
    else:
        print("%-30s %10.3f %10.3f" % (name, a, b))
print("padded / genuine likes = %.3f" % (pad[1] / float(gen[1])))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《持续同调拓扑贝蒂数、高净值私域社群结构空洞与虚假抱团水军识别母典》第 1 章「活跃不等于有环:三角闭合、传递性与互刷团块」(版本 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}
}

本书其他章节结论