关于「追更的幸存者:读者异质性、幸存者偏差与删失」,《长篇叙事的因果图、悬念熵与伏笔回收》给出的定量结论是什么?

结论:第六章说明读者异质性让晚出现的钩子在朴素比较中显得效果惊人(比值 0.194,真实效应为零),而朴素比例把第 50 章留存算成 0.0918,乘积极限估计给出 0.1656。

数据口径:书中的连载、读者与参数均为示意模型;全部计算由书中程序生成;本书不是法律、财务或投资建议,并坚持一条红线:不得以虚假悬念骗取点击。 第一、二章用卡恩拓扑排序与按键分组的版本检查找出时间悖论与同一属性的两个值,并说明跨卷吃书藏在推得出的先后里:示意连载第六卷的一条边与写在第 2 卷到第 6 卷之间的 10 条边相冲突。

English version

对照数据表

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

readers 5,000; still reading on day 120 (censored): 1,038
chaptertrue S(t)naive shareKaplan-Meier
50.61210.58720.6063
100.45260.40280.4372
250.26600.20740.2629
500.16550.09180.1656
800.11740.03720.1162
naive 'dropout rate' (stopped / joined): 0.792
查看完整验算程序
# Chapter 6. p63: readers still reading are censored, not lost.
# 5,000 readers join a serial on a day drawn uniformly from 0 to 119 and
# read one chapter a day from chapter 1, each leaving after a chapter
# with a constant theta ~ Beta(0.8, 6) (the p61 model). The data are
# read on day 120, so a reader who joined on day d can have read at most
# 120 - d chapters: if still reading, that reader is right-censored.
# "Naive" counts everyone who reached chapter t over all who joined; the
# Kaplan and Meier (1958) product-limit estimate uses only those still
# at risk. Fixed-seed simulation; illustrative parameters.
import math
import random

A, B, N, DAY = 0.8, 6.0, 5000, 120
rng = random.Random(20261112)
obs = []                                   # (chapters read, still reading)
for _ in range(N):
    d = rng.randrange(DAY)
    th = rng.betavariate(A, B)
    cap, t = DAY - d, 0
    while t < cap:
        t += 1
        if rng.random() < th:
            obs.append((t, False))
            break
    else:
        obs.append((cap, True))


def true_s(t):
    lb = (math.lgamma(B + t) - math.lgamma(A + B + t)
          - math.lgamma(B) + math.lgamma(A + B))
    return math.exp(lb)


def km(t):
    s = 1.0
    for c in range(1, t + 1):
        at_risk = len([1 for x, _ in obs if x >= c])
        quit_here = len([1 for x, cen in obs if x == c and not cen])
        if at_risk:
            s *= 1 - quit_here / at_risk
    return s


cen = len([1 for _, c in obs if c])
print("readers {:,}; still reading on day {} (censored): {:,}".format(
    N, DAY, cen))
print("chapter  true S(t)  naive share  Kaplan-Meier")
for t in (5, 10, 25, 50, 80):
    naive = len([1 for x, c in obs if x > t or (x == t and c)]) / N
    print("{:>7}  {:>9.4f}  {:>11.4f}  {:>12.4f}".format(
        t, true_s(t), naive, km(t)))
print("naive 'dropout rate' (stopped / joined): {:.3f}".format(
    (N - cen) / N))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《长篇叙事因果有向无环图校验、章节悬念信息熵锯齿调度与伏笔遗忘衰减回收》第 6 章「追更的幸存者:读者异质性、幸存者偏差与删失」(版本 1.0.0). 5D Library. DOI 待发布

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

BibTeX
@book{fan2026178,
  author    = {Fan, Yafu},
  title     = {Causal-DAG Validation of Long-Form Narrative, Sawtooth Scheduling of Chapter Suspense Entropy and Forgetting-Aware Foreshadowing Recovery},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论