5D Library › Books › 5DL-B-063

超临界病毒级联、信息缺口风险率与多层付费墙优化

分支再生阈值、分享解锁激励相容与二阶价格歧视

Supercritical Viral Cascades, Information-Gap Hazard Rates and Multi-Tier Paywall Optimization: Galton-Watson Referral Thresholds, Share-to-Unlock Incentives and Second-Degree Price Discrimination

  • 范雅福 Fan Yafu
  • Version 1.0.0 · 2026-11-08
  • CC-BY-NC-ND-4.0
  • 5DL-B-063
DOI10.5281/zenodo.24090174

摘要

付费测算网站的增长引擎由分享机制、免费钩子与付费阶梯组成,每个部件背后都有一句口号。本书把口号还原为分支过程、风险率、信号检测与价格歧视的模型,运行模型,看口号在哪里成立。本书不是经营、法律或投资建议;全部数据为程序生成的合成数据。

第一章把「拉人免费解锁」与「付费加分佣」写成高尔顿—沃森分支过程:分享者凑够门槛就停,所以 K 被分享率封顶,分享率为 30% 或 50% 时任何门槛都不能让 K 越过 1;即使 K 为 1.15,单个种子仍有 0.729 的概率熄灭,级联规模的中位数只有 3 人。第二章说明,在有限受众中 K 为 1.15 只能触达 0.255,聚集网络中实测的 K 为 0.934 而树状估计为 1.35,获客成本没有归零:每个付费用户为 3.22,占价格的 0.325。第三章说明分佣几乎不改变谁付费,却提高 K 与每个种子的总收入;假账号便宜时平台测得的 K 为 1.992 而真实 K 为 0.065,50% 的分佣变成 50% 的折扣。第四章把信息缺口写成购买风险率:揭示一半时购买概率 0.451 最高,延迟一天降到 0.078;通用解读被认为的准确度 0.838 接近有信息的解读,却在调包检验中只有随机水平 0.333,身份标签使转发率从 0.583 升到 0.745。

第五章在帕累托支付意愿下说明,尾指数 1.5 时完全价格歧视的上界是单一价格的 3.00 倍,但对一件商品任何菜单都胜不过单一价格(2.961 对 3.000);多层付费墙多收钱是因为它卖多件商品,收入占上界的比例从 0.150 升到 0.339。第六章说明捆绑独立的问题在 20 题时收走 0.678 的价值,诱饵档的效果取决于一个必须测量的参数,按题付费与年卡并行最好。第七章与《鬼谷子》摩篇、飞箝篇及《管子·国蓄》并读,同质性把增长因子从 0.757 提高到 1.297 但把增长局限在一个社群。第八章给出四步核查、合规清单与一项预注册的付费墙检验(每组 166,788 棵推荐树)。书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。

关键词:推荐营销;病毒式增长;K 值;高尔顿—沃森分支过程;熄灭概率;最终规模;小世界网络;同质性;激励相容;推荐奖励;假账号;信息缺口;好奇心;巴纳姆效应;信号检测;帕累托分布;价格歧视;标价;菜单定价;捆绑;诱饵效应;按次付费;整群随机;干扰;预注册;鬼谷子;管子

Abstract

The growth engine of a paid reading website consists of a sharing mechanism, a free hook and a ladder of paid tiers, and behind each stands a slogan. This book writes the slogans back out as models of branching processes, hazard rates, signal detection and price discrimination, runs them, and sees where the slogans hold. It is not business, legal or investment advice; all data are synthetic, generated by its programs.

Chapter 1 writes "invite friends to unlock free" and "pay and earn a commission" as a Galton-Watson branching process: a sharer stops at the threshold, so the share rate caps K, and at share rates of 30 % or 50 % no threshold takes K past 1; even at K = 1.15 a single seed dies out with probability 0.729, and the median cascade is 3 users. Chapter 2 shows that in a finite audience K = 1.15 reaches only 0.255, that in a clustered network the measured K is 0.934 against a tree estimate of 1.35, and that acquisition costs do not fall to zero: 3.22 per paying user, 0.325 of the price. Chapter 3 shows that commissions hardly change who pays but raise K and total revenue per seed; when fake accounts are cheap the platform measures K at 1.992 while the real K is 0.065, and a 50 % commission becomes a 50 % discount. Chapter 4 writes the information gap as a purchase hazard: revealing half gives the highest purchase probability, 0.451, falling to 0.078 after a day's delay; a generic reading is judged 0.838 accurate, close to an informed one, yet scores only the chance level of 0.333 in a swap test, and an identity label raises sharing from 0.583 to 0.745.

Chapter 5 shows under Pareto willingness to pay that at a tail index of 1.5 the ceiling of perfect discrimination is 3.00 times one price, but that for one good no menu beats one price (2.961 against 3.000); a multi-tier paywall takes more because it sells several goods, raising the share of the ceiling from 0.150 to 0.339. Chapter 6 shows that bundling independent questions collects 0.678 of their value at 20 questions, that a decoy tier depends on a parameter that must be measured, and that offering per-question pricing alongside an annual pass is best. Chapter 7 reads the "Rubbing" and "Flying and Clamping" chapters of the Guiguzi and the "State Reserves" chapter of the Guanzi; homophily raises the growth factor from 0.757 to 1.297 but confines growth to one community. Chapter 8 gives a four-step check, a compliance checklist and a pre-registered paywall test (166,788 referral trees per arm). Marked boxes separate published evidence, runnable Python calculations (16 programs), classical sources and the author's hypotheses.

Keywords: referral marketing; viral growth; K-factor; Galton-Watson branching process; extinction probability; final size; small-world network; homophily; incentive compatibility; referral rewards; fake accounts; information gap; curiosity; Barnum effect; signal detection; Pareto distribution; price discrimination; posted price; menu pricing; bundling; decoy effect; per-use pricing; cluster randomisation; interference; pre-registration; Guiguzi; Guanzi

目录 · Contents

  • 序:增长与收费的算术English 中文Preface: The Arithmetic of Growth and Charging
  • 第一章 拉人解锁的分支过程English 中文Chapter 1. The Branching Process of "Invite to Unlock"
  • 第二章 有限的受众、聚集的网络与没有归零的获客成本English 中文Chapter 2. A Finite Audience, a Clustered Network and an Acquisition Cost That Is Not Zero
  • 第三章 分佣、分享解锁与假账号的激励相容English 中文Chapter 3. Commissions, Share-to-Unlock and the Incentives of Fake Accounts
  • 第四章 信息缺口、购买风险率与「说得准」的感觉English 中文Chapter 4. Information Gaps, Purchase Hazards and the Feeling of "So Accurate"
  • 第五章 帕累托支付意愿、单一价格与收益上界English 中文Chapter 5. Pareto Willingness to Pay, One Price and the Revenue Ceiling
  • 第六章 捆绑、诱饵档与按题付费English 中文Chapter 6. Bundles, Decoy Tiers and Paying per Question
  • 第七章 「摩之以其类」「飞而箝之」与「敛之以轻」English 中文Chapter 7. "Rub It with Its Own Kind", "Lift Then Clamp" and "Gather When Light"
  • 第八章 四步核查、合规清单与一项预注册的付费墙检验English 中文Chapter 8. A Four-Step Check, a Compliance Checklist and a Pre-Registered Paywall Test

How to cite · 引用

Fan, Y. (2026). Supercritical Viral Cascades, Information-Gap Hazard Rates and Multi-Tier Paywall Optimization: Galton-Watson Referral Thresholds, Share-to-Unlock Incentives and Second-Degree Price Discrimination [超临界病毒级联、信息缺口风险率与多层付费墙优化] (Version 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090174

BibTeX
@book{fan2026supercritical,
  title = {{Supercritical Viral Cascades, Information-Gap Hazard Rates and Multi-Tier Paywall Optimization}: Galton-Watson Referral Thresholds, Share-to-Unlock Incentives and Second-Degree Price Discrimination},
  author = {Fan, Yafu},
  year = {2026},
  publisher = {5D Library},
  edition = {Version 1.0.0},
  doi = {10.5281/zenodo.24090174},
  url = {https://doi.org/10.5281/zenodo.24090174},
  note = {Chinese title: 超临界病毒级联、信息缺口风险率与多层付费墙优化}
}
DOIhttps://doi.org/10.5281/zenodo.24090174
DOI(全部版本 all versions)https://doi.org/10.5281/zenodo.24090173
ORCIDhttps://orcid.org/0009-0004-3519-1203
5D Library ID5DL-B-063
版本 Version1.0.0 · 中英双语版 Bilingual edition
出版日期 Date2026-11-08
网址 Onlinehttps://5dlibrary.com/books/supercritical-viral-cascades-curiosity-gaps-paywall-pricing/
SHA-256 · supercritical-viral-cascades-curiosity-gaps-paywall-pricing_bilingual_v1.0.0.pdfc72f32f46c15865cdacf04f541c85df7b903c05d3ff5ce71b4950280de2217cb
SHA-256 · supercritical-viral-cascades-curiosity-gaps-paywall-pricing_en_v1.0.0.pdf203cc3c3e0e3321487575b8d3d1fe3ee1d28327d557de5140a72865fb884804b
SHA-256 · supercritical-viral-cascades-curiosity-gaps-paywall-pricing_zh_v1.0.0.pdf42cc026851c59754ab44bd4fe54652e46e16415543da41a115c56c340b83046d
Licence · 许可Licensed under Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0). https://creativecommons.org/licenses/by-nc-nd/4.0/

Disclosure. The author uses the works of 5D Library, including this book, as the methodological basis of his community courses, the 5D Ascension Cards (Dimensional Shift Card Decks) and the Yafu AI knowledge base, and develops and runs paid online reading software and services built on traditional divinatory arts, including share-to-unlock, referral commission and multi-tier payment features; the models of this book are the mathematical basis of those features, so he has a direct commercial interest in its subject. The book promotes no software, course, card deck or service, uses no user data from the author's businesses, and accepts no sponsorship. It is not business, legal or investment advice, and its pricing and growth models are not a recommendation of any particular charging scheme. The test in Chapter 8 must be run and analysed with pre-registered code by people independent of the pricing decision, and its results will be published whether positive or negative.