关于「有限的受众、聚集的网络与没有归零的获客成本」,《裂变、好奇心与付费墙》给出的定量结论是什么?

结论:第二章说明,在有限受众中 K 为 1.15 只能触达 0.255,聚集网络中实测的 K 为 0.934 而树状估计为 1.35,获客成本没有归零:每个付费用户为 3.22,占价格的 0.325。

数据口径:本书不是经营、法律或投资建议;全部数据为程序生成的合成数据。 书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.255, 0.325, 1.15, 3.22

   K      reached   z = 1 - exp(-Kz)   K_eff < 1 from gen   peak gen (size)
   1.15    0.255        0.249                 42              42 (9,421)
   1.50    0.618        0.583                 19              19 (72,388)
   2.00    0.869        0.797                 12              12 (187,722)
   3.00    0.993        0.940                  8               8 (394,652)
   cost per paying user: free readings 3.00 + commissions 0.22 = 3.22
   as a share of the price 9.9: 0.325
Reading: in a finite audience K_eff falls below 1 once a share
1 - 1/K has been reached; a K just above 1 reaches only about a
quarter of the audience. (The generation recurrence reaches a
little more than the classical relation, which also counts
repeated invitations to the same person.) Referral growth is not
free: the free readings given to everyone who never pays are the
main acquisition cost.
查看完整验算程序
# Chapter 2. A finite audience, and what "zero acquisition cost" hides.
# Part 1. Users can only be recruited from a finite reachable audience of
# 1,000,000 people. Generation by generation (100 seed users), each new
# user's invitations land on people already reached in proportion to the
# share already reached, so the effective number is K_eff = K x (unreached
# share). The program reports the final share reached (it solves the
# classical final-size relation z = 1 - exp(-K z) as a check), the
# generation at which K_eff falls below 1, and the peak generation size.
# Part 2. Every new user receives a free reading that costs c = 0.15 to
# generate and deliver; a 5 % share pay the price p = 9.9; a paying user
# whose referral link brought the payer earns a commission of 50 %. With
# the funnel of p02 at K = 1.15, a share 0.05 / 1.15 of joiners comes from
# paid links. Acquisition cost per paying user =
#   c / 0.05 + (share of payers from paid links) x 0.5 x 9.9.
import math

AUDIENCE, SEEDS = 1_000_000, 100

def run(k):
    reached, new, gen = SEEDS, SEEDS, 0
    below, peak = None, (0, SEEDS)
    while new >= 1:
        unreached = 1 - reached / AUDIENCE
        if below is None and k * unreached < 1:
            below = gen
        new = k * unreached * new
        reached += new
        gen += 1
        if new > peak[1]:
            peak = (gen, new)
    return reached / AUDIENCE, below, peak

def final_size(k):
    z = 0.5
    for _ in range(500):
        z = 1 - math.exp(-k * z)
    return z

if __name__ == "__main__":
    print("   K      reached   z = 1 - exp(-Kz)   K_eff < 1 from gen"
          "   peak gen (size)")
    for k in (1.15, 1.5, 2.0, 3.0):
        share, below, (pg, ps) = run(k)
        print("   {:4.2f}    {:5.3f}        {:5.3f}                {:3d}"
              "             {:3d} ({:,.0f})".format(k, share, final_size(k),
                                                    below, pg, ps))
    c, conv, price, alpha, k = 0.15, 0.05, 9.9, 0.5, 1.15
    via_link = 0.05 / k
    cac = c / conv + via_link * alpha * price
    print("\n   cost per paying user: free readings {:.2f} + commissions"
          " {:.2f} = {:.2f}".format(c / conv, via_link * alpha * price, cac))
    print("   as a share of the price 9.9: {:.3f}".format(cac / price))
    print("\nReading: in a finite audience K_eff falls below 1 once a share")
    print("1 - 1/K has been reached; a K just above 1 reaches only about a")
    print("quarter of the audience. (The generation recurrence reaches a")
    print("little more than the classical relation, which also counts")
    print("repeated invitations to the same person.) Referral growth is not")
    print("free: the free readings given to everyone who never pays are the")
    print("main acquisition cost.")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《超临界病毒级联、信息缺口风险率与多层付费墙优化》第 2 章「有限的受众、聚集的网络与没有归零的获客成本」(版本 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}
}

本书其他章节结论