关于「从播放到现金:滞后、厚尾与关联封号」,《完播风险、推荐反馈与获客漏斗》给出的定量结论是什么?

结论:第五章模拟从播放到到账的现金流(回本日中位数为第 35 天),并说明共享设备的账号矩阵一年失去八个以上账号的概率从 0.0019 升到 0.2353。

数据口径:书中的威布尔参数、流量池规模、转化率、价格(令吉 RM)与封号概率都是示意模型参数,不是任何平台、账号或企业的数据;本书不描述任何平台的真实算法,也不构成营销或经营建议。 第二章模拟分级流量池:300 人样本下,即使各池观众相同,好视频也有 0.169 在第一关被拦下,观众差异下为 0.308 至 0.478;对冲噪声应重剪而不是重发。

English version

对照数据表

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

   scenario               mean lost  P(5 or more)  P(8 or more)
   independent                 3.07        0.1625        0.0019
   loosely linked              3.06        0.3521        0.1006
   tightly linked              3.02        0.3765        0.2353
   two clusters of five        3.06        0.3130        0.0966
Reading: the expected number of lost accounts is the same
in every scenario, but linked accounts fail together. Shared
devices or payment details turn a matrix into one large bet:
the chance of losing eight or more rises from 0.0019 to
0.2353. Two unlinked clusters cut that to 0.0966; only truly
independent accounts restore the diversification.
查看完整验算程序
# Chapter 5. p10: Ten accounts are not ten independent bets.
# A matrix of 10 accounts; each has the same marginal chance of a ban,
# 0.03 per month. Bans may come from a common shock: in a month with a
# platform sweep (chance s) each linked account is banned with chance
# q; otherwise with chance p0, where s q + (1 - s) p0 = 0.03.
# Scenarios: independent accounts; loosely linked (shared payment
# details); tightly linked (shared devices); and two separate clusters
# of five on different platforms, tightly linked within each. 12
# months, 40,000 runs each, fixed seed. Banned accounts stay banned.
import random

SCEN = [("independent", 0.0, 0.0),
        ("loosely linked", 0.05, 0.5),
        ("tightly linked", 0.04, 0.75)]

def months(rng, alive, s, q):
    sweep = rng.random() < s
    p0 = (0.03 - s * q) / (1 - s)
    pr = q if sweep else p0
    return [a and not (rng.random() < pr) for a in alive]

def run(rng, s, q, split=False):
    if not split:
        alive = [True] * 10
        for _ in range(12):
            alive = months(rng, alive, s, q)
        return 10 - sum(alive)
    a, b = [True] * 5, [True] * 5
    for _ in range(12):
        a = months(rng, a, s, q)
        b = months(rng, b, s, q)
    return 10 - sum(a) - sum(b)

if __name__ == "__main__":
    rng = random.Random(10)
    n = 40000
    print("   scenario               mean lost  P(5 or more)  P(8 or more)")
    rows = [(name, s, q, False) for name, s, q in SCEN]
    rows.append(("two clusters of five", 0.04, 0.75, True))
    for name, s, q, split in rows:
        lost = [run(rng, s, q, split) for _ in range(n)]
        print("   {:22s} {:9.2f} {:13.4f} {:13.4f}".format(
            name, sum(lost) / n, sum(1 for x in lost if x >= 5) / n,
            sum(1 for x in lost if x >= 8) / n))
    print("\nReading: the expected number of lost accounts is the same")
    print("in every scenario, but linked accounts fail together. Shared")
    print("devices or payment details turn a matrix into one large bet:")
    print("the chance of losing eight or more rises from 0.0019 to")
    print("0.2353. Two unlinked clusters cut that to 0.0966; only truly")
    print("independent accounts restore the diversification.")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《短视频完播率风险函数、推荐反馈环与自动化获客漏斗》第 5 章「从播放到现金:滞后、厚尾与关联封号」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090213

DOI: 10.5281/zenodo.24090213 · 阅读本章所在专著 · 5DL-B-081 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026081,
  author    = {Fan, Yafu},
  title     = {Short-Video Completion Hazards, Recommender Exploration Loops and Automated Acquisition Funnels},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090213},
  url       = {https://doi.org/10.5281/zenodo.24090213}
}

本书其他章节结论