关于「「摩之以其类」「飞而箝之」与「敛之以轻」」,《裂变、好奇心与付费墙》给出的定量结论是什么?
结论:第七章与《鬼谷子》摩篇、飞箝篇及《管子·国蓄》并读,同质性把增长因子从 0.757 提高到 1.297 但把增长局限在一个社群。
数据口径:本书不是经营、法律或投资建议;全部数据为程序生成的合成数据。 书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.757, 1.297
own-share h K within A K within B R overall new users in A
0.5 0.720 0.240 0.757 0.683
0.7 1.008 0.336 1.018 0.826
0.9 1.296 0.432 1.297 0.947
Reading: the more invitations stay inside one's own kind, the
higher the overall growth factor - like responds to like - but
the growth lives almost entirely in the community that shares.
A cascade that is supercritical overall can be subcritical in
every other community it touches.查看完整验算程序
# Chapter 7. "Rub it with its own kind": homophily in a referral cascade.
# Two communities. In A 60 % of users share, in B 20 %. A sharer sends 8
# invitations, a share h of them to their own community; an invitation is
# accepted with probability 0.30 inside one's own community and 0.10
# across. The next-generation matrix has entries
# K[a][b] = share rate of a x 8 x (h if a = b else 1 - h)
# x (0.30 if a = b else 0.10)
# (new users in b per user in a). Its largest eigenvalue R is the growth
# factor per generation; its eigenvector gives where the new users land.
# R is compared with the K of each community taken alone.
import math
def matrix(h):
s = {"A": 0.6, "B": 0.2}
k = {}
for a in "AB":
for b in "AB":
same = a == b
k[a, b] = s[a] * 8 * (h if same else 1 - h) * (0.30 if same
else 0.10)
return k
def leading(k):
a, b = k["A", "A"], k["B", "A"] # column: new users in A
c, d = k["A", "B"], k["B", "B"]
tr, det = a + d, a * d - b * c
r = tr / 2 + math.sqrt(tr * tr / 4 - det)
va, vb = b, r - a # eigenvector of [[a, b], [c, d]]
if abs(va) + abs(vb) < 1e-12:
va, vb = 1.0, 0.0
return r, abs(va) / (abs(va) + abs(vb))
if __name__ == "__main__":
print(" own-share h K within A K within B R overall"
" new users in A")
for h in (0.5, 0.7, 0.9):
k = matrix(h)
r, share_a = leading(k)
print(" {:3.1f} {:5.3f} {:5.3f} {:5.3f}"
" {:5.3f}".format(h, k["A", "A"], k["B", "B"], r,
share_a))
print("\nReading: the more invitations stay inside one's own kind, the")
print("higher the overall growth factor - like responds to like - but")
print("the growth lives almost entirely in the community that shares.")
print("A cascade that is supercritical overall can be subcritical in")
print("every other community it touches.")唯一数据源与引用
范雅福(Fan, Y.). (2026). 《超临界病毒级联、信息缺口风险率与多层付费墙优化》第 7 章「「摩之以其类」「飞而箝之」与「敛之以轻」」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090174
DOI: 10.5281/zenodo.24090174 · 阅读本章所在专著 · 5DL-B-063 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026063,
author = {Fan, Yafu},
title = {Supercritical Viral Cascades, Information-Gap Hazard Rates and Multi-Tier Paywall Optimization},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.24090174},
url = {https://doi.org/10.5281/zenodo.24090174}
}