关于「分支过程:高尔顿—沃森级联、临界点与过度离散」,《短视频流量池冷启动》给出的定量结论是什么?

结论:第二章用分支过程说明转发强度提高一成可使大级联的概率乘以 4.1。

数据口径:书中所有门槛、池子规模与权重均为示意,平台规则以其官方公示为准;全部计算由书中程序生成;本书是非个人化经营建议,只讨论真实内容质量与合规测试,不涉及任何刷量或规避平台规则的做法。 第三章说明硬门槛在数据上是斜坡,批次从 100 人增至 3,000 人时放行区间宽度从 0.124 收窄到 0.023;示意基准视频的破圈概率为 0.03585,瓶颈在第四道门。

English version

对照数据表

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

mP(die out)mean sizeP(N>=100)P(N>=1000)
0.501.00002.00.00000.00000
0.801.00005.00.00140.00000
0.901.000010.00.01740.00001
0.951.000020.00.04130.00152
0.991.0000100.00.07100.01663
1.001.0000inf0.08000.02524
1.050.9063inf0.13200.09526
1.200.6863inf0.31570.31370
1.500.4172inf0.58280.58281
near m = 1 the tail of N falls like n^(-1/2) for P(N >= n);
a 10 percent rise in m from 0.9 to 0.99 multiplies P(N>=100)
by 4.1

核心公式

\[P(N = n) = \frac{e^{-mn}(mn)^{n-1}}{n!}.\]
查看完整验算程序
# Chapter 2. p21: Galton-Watson cascades with Poisson offspring.
# Each viewer who shares brings in a Poisson(m) number of new sharers
# (m = mean reshares per sharer, illustrative). The cascade dies out
# with probability q, the smallest root of q = exp(m (q - 1)), found
# by iterating from 0 (the Watson iteration of Chapter 7). The total
# number of sharers from one seed follows the Borel law
#     P(N = n) = exp(-m n) (m n)^(n - 1) / n!,
# with mean 1 / (1 - m) when m < 1. For m > 1 the Borel terms
# leave out the mass of never-ending cascades, so the tail includes
# it. We report P(N >= 100) exactly as one minus the sum of the first
# 99 terms, added with math.fsum.
import math


def extinction(m, steps=20000):
    # m <= 1: extinction is certain (theorem); iteration would creep up
    if m <= 1.0:
        return 1.0
    q = 0.0
    for _ in range(steps):
        q = math.exp(m * (q - 1.0))
    return q


def borel(m, n):
    lg = -m * n + (n - 1) * math.log(m * n) - math.lgamma(n + 1)
    return math.exp(lg)


print("    m  P(die out)  mean size  P(N>=100)  P(N>=1000)")
for m in (0.5, 0.8, 0.9, 0.95, 0.99, 1.0, 1.05, 1.2, 1.5):
    q = extinction(m)
    mean = "%9.1f" % (1.0 / (1.0 - m)) if m < 1.0 else "      inf"
    t100 = 1.0 - math.fsum(borel(m, n) for n in range(1, 100))
    t1000 = 1.0 - math.fsum(borel(m, n) for n in range(1, 1000))
    print("%5.2f  %10.4f  %s  %9.4f  %10.5f"
          % (m, q, mean, t100, t1000))
print("near m = 1 the tail of N falls like n^(-1/2) for P(N >= n);")
print("a 10 percent rise in m from 0.9 to 0.99 multiplies P(N>=100)")
print("by %.1f" % ((1.0 - math.fsum(borel(0.99, n) for n in range(1, 100)))
                    / (1.0 - math.fsum(borel(0.9, n)
                                       for n in range(1, 100)))))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《全域短视频赛马池冷启动动力学、完播互动复播阶跃阈值与零投流破圈测试矩阵母典》第 2 章「分支过程:高尔顿—沃森级联、临界点与过度离散」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-273 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026273,
  author    = {Fan, Yafu},
  title     = {Cold-Start Dynamics of Short-Video Traffic Pools: Step Thresholds in Completion, Engagement and Replay and a Zero-Ad-Spend Breakout Test Matrix},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论