What does Community Topology Checkup conclude, in numbers, about “How Long Is Long: a Permutation Null Model, an Alarm Line and the Dose-Response of Community Size”?

Answer: Chapter 4 draws an alarm line of 0.1786 with a permutation null model, crossed by 0.775 of genuine communities, and sets a minimum community size.

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.1786, 0.775

quantilenull L3null longestgenuine L3
0.050.11270.04200.1168
0.500.14470.05570.2480
0.900.16940.06630.3217
0.950.17860.06970.3537
0.990.19710.07640.3922
alarm line (null 95th percentile of L3) = 0.1786
genuine communities above the line= 0.775
mean L3: null 0.1465, genuine 0.2391
Show the full program
# Chapter 4. p41: How long is a long bar? A permutation null model.
# Null community: each of 30 members keeps the number of likes of a
# genuine member but the liked posts are drawn at random, which
# destroys the ring of interests and keeps the activity. 200 null and
# 200 genuine communities, fixed seed, synthetic only. The null
# quantiles of L3 give the alarm line used in later chapters.
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 quantile(v, q):
    s = sorted(v)
    return s[min(len(s) - 1, int(q * len(s)))]


rng = random.Random(20261113)
null3, nullL, gen3, genL = [], [], [], []
for _ in range(200):
    g = community(rng, 30, 24, 0)
    z = [set(rng.sample(range(N_POSTS), len(p))) for p in g]
    for pts, a3, aL in ((g, gen3, genL), (z, null3, nullL)):
        h0, h1 = barcodes(pts)
        a3.append(lead3(h1))
        aL.append(max([d - b for b, d in h1] + [0.0]))
print("quantile   null L3  null longest  genuine L3")
for q in (0.05, 0.5, 0.9, 0.95, 0.99):
    print("  %.2f     %.4f    %.4f       %.4f"
          % (q, quantile(null3, q), quantile(nullL, q),
             quantile(gen3, q)))
line = quantile(null3, 0.95)
pw = len([1 for v in gen3 if v > line]) / 200.0
print("alarm line (null 95th percentile of L3) = %.4f" % line)
print("genuine communities above the line      = %.3f" % pw)
print("mean L3: null %.4f, genuine %.4f"
      % (math.fsum(null3) / 200, math.fsum(gen3) / 200))

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 4: How Long Is Long: a Permutation Null Model, an Alarm Line and the Dose-Response of Community Size. 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