关于「群体归属召唤:最小群体矩阵与阈值级联」,《身份标签与自我说服的可证伪修辞学》给出的定量结论是什么?
结论:第四章用泰弗尔式矩阵与阈值级联说明托被识破后临界种子从 0.1203 升到 0.2320。
数据口径:书中参数为示意;全部计算由书中程序生成;本书不是法律意见,也不是个人化的财务或经营建议。 书中以标注框区分已发表的证据、可运行的 Python 计算(19 段程序)、原典与作者的假说。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.1203, 0.2320
| seed share (trust intact) share (after exposure +0.10) | |
| 0.04 | 0.0100 0.0010 |
| 0.08 | 0.0230 0.0030 |
| 0.12 | 0.0880 0.0060 |
| 0.14 | 1.0000 0.0090 |
| 0.20 | 1.0000 0.0340 |
| 0.30 | 1.0000 1.0000 |
| threshold shift critical real seed | |
| 0.00 | 0.1203 |
| 0.05 | 0.1758 |
| 0.10 | 0.2320 |
| 0.15 | 0.2890 |
| exposure raises the seed needed by 0.1117 |
查看完整验算程序
# 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))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《身份标签自我实现、群体归属召唤与高客单零抗拒自我说服修辞学》第 4 章「群体归属召唤:最小群体矩阵与阈值级联」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 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}
}