What does Identity Labels and Self-Persuasion, Weighed conclude, in numbers, about “In-Group Belonging Calls: Minimal-Group Matrices and Threshold Cascades”?

Answer: Chapter 4 uses a Tajfel-style matrix and a threshold cascade to show that exposed plants raise the critical seed from 0.1203 to 0.2320.

Scope of the numbers: Its parameters are illustrative; all calculations are generated by its programs; it is not legal advice and not personalised financial or business advice. Marked boxes separate published evidence, runnable Python calculations (19 programs), classical sources and the author's hypotheses.

中文版

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.1203, 0.2320

seed share (trust intact) share (after exposure +0.10)
0.040.0100 0.0010
0.080.0230 0.0030
0.120.0880 0.0060
0.141.0000 0.0090
0.201.0000 0.0340
0.301.0000 1.0000
threshold shift critical real seed
0.000.1203
0.050.1758
0.100.2320
0.150.2890
exposure raises the seed needed by 0.1117
Show the full program
# Chapter 4. p42: Belonging cascades, and what planted members cost.
# Model: Granovetter (1978) threshold model on 1,000 prospects. Each
# joins once the visible member share reaches his threshold;
# thresholds are the 1,000 normal quantiles with mean 0.40 and sd
# 0.15 (illustrative, no sampling). Iterate x <- F(seed + x) to the
# fixed point. If planted members are exposed, prospects re-decide
# from zero and distrust raises every threshold by a shift.
from statistics import NormalDist

N = 1000
ND = NormalDist(0.40, 0.15)
TH = [ND.inv_cdf((i + 0.5) / N) for i in range(N)]


def settle(seed, shift=0.0):
    x = 0.0
    for _ in range(500):
        vis = min(1.0, seed + x * (1 - seed))
        joined = 0
        for t in TH:
            if t + shift <= vis:
                joined += 1
        nx = joined / N
        if abs(nx - x) < 1e-12:
            break
        x = nx
    return x


def critical(shift):
    lo, hi = 0.0, 1.0
    for _ in range(40):
        mid = (lo + hi) / 2
        if settle(mid, shift) > 0.5:
            hi = mid
        else:
            lo = mid
    return hi


print("seed   share (trust intact)  share (after exposure +0.10)")
for s in (0.04, 0.08, 0.12, 0.14, 0.20, 0.30):
    print("{:4.2f}  {:20.4f}  {:28.4f}".format(
        s, settle(s), settle(s, 0.10)))
print("threshold shift   critical real seed")
for sh in (0.00, 0.05, 0.10, 0.15):
    print("{:15.2f}  {:19.4f}".format(sh, critical(sh)))
gap = critical(0.10) - critical(0.0)
print("exposure raises the seed needed by {:.4f}".format(gap))

Single source and citation

Fan, Y. (2026). Self-Fulfilling Identity Labels, In-Group Belonging Calls and the Rhetoric of Resistance-Free High-Ticket Self-Persuasion (Version 1.0.0), Chapter 4: In-Group Belonging Calls: Minimal-Group Matrices and Threshold Cascades. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-142 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026142,
  author    = {Fan, Yafu},
  title     = {Self-Fulfilling Identity Labels, In-Group Belonging Calls and the Rhetoric of Resistance-Free High-Ticket Self-Persuasion},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book