What does Community Topology Checkup conclude, in numbers, about “Activity Is Not a Loop: Triangle Closure, Transitivity and Blocks of Mutual Boosting”?

Answer: Chapter 1 shows that a boosting block can raise transitivity to 0.996 (0.671 in a genuine community) while being topologically solid, with first Betti number zero.

Scope of the numbers: Every community and member in the book is synthetic data with fixed seeds, and no data from any real community or person is used; all calculations are generated by its programs, and its parameters are illustrative. The book is not individual business advice, and its "detection of paid boosters" produces only a list of suspects for human review, never an automatic penalty for any member.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 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
Show the full program
# 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])))

Single source and citation

Fan, Y. (2026). Persistent Homology and Betti Numbers: Structural Voids in High-Net-Worth Private Communities and the Review of Fake Cliques (Version 1.0.0), Chapter 1: Activity Is Not a Loop: Triangle Closure, Transitivity and Blocks of Mutual Boosting. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 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}
}

Other chapter answers in this book