关于「沉没数据的续费棘轮,与同样上升的筛选曲线」,《弃单、续费与大单筛选》给出的定量结论是什么?

结论:第三章写出沉没数据棘轮,并证明一个人人续费率不变的筛选模型(sBG)能把同一条群组曲线拟合到最大差距 0.011。

数据口径:书中的回访率、退订率、续费参数、客户估值与成交率均为示意或合成模型;全部数据由书中程序生成;本书不是法律意见。 书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。

English version

对照数据表

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

sBG fit to the ratchet cohort: a0.65, b = 2.7
largest survival gap over 24 months0.011
month0 renewal: ratchet 0.801, selection 0.806
month3 renewal: ratchet 0.898, selection 0.898
month6 renewal: ratchet 0.934, selection 0.930
month 12 renewal: ratchet 0.958, selection 0.958
a new subscriber given 12 months of imported history:
ratchet model renewal 0.958; selection model 0.806
查看完整验算程序
# Chapter 3. p06: Rising renewal without any ratchet. In the shifted-
# beta-geometric (sBG) model each subscriber has a fixed monthly churn
# probability theta ~ Beta(a, b); nobody becomes stickier, yet the
# cohort renewal rate (b + t - 1) / (a + b + t - 1) rises because those
# likely to churn leave first. We fit (a, b) to the cohort survival
# curve of the ratchet model in p05 and compare the two curves.
import importlib.util
from math import lgamma, exp

def load(name):
    spec = importlib.util.spec_from_file_location(name, name + ".py")
    m = importlib.util.module_from_spec(spec)
    spec.loader.exec_module(m)
    return m

p05 = load("p05_sunk_data")
MONTHS = 24

def lbeta(a, b):
    return lgamma(a) + lgamma(b) - lgamma(a + b)

def sbg_survival(a, b, months=MONTHS):
    return [exp(lbeta(a, b + t) - lbeta(a, b)) for t in range(1, months + 1)]

def fit(target):
    best = None
    for i in range(1, 121):
        a = i * 0.05
        for j in range(1, 241):
            b = j * 0.1
            sv = sbg_survival(a, b)
            err = sum((x - y) ** 2 for x, y in zip(sv, target))
            if best is None or err < best[0]:
                best = (err, a, b)
    return best

if __name__ == "__main__":
    target = p05.survival(MONTHS)
    err, a, b = fit(target)
    sv = sbg_survival(a, b)
    gap = max(abs(x - y) for x, y in zip(sv, target))
    print("   sBG fit to the ratchet cohort: a = {:.2f}, b = {:.1f}".format(
        a, b))
    print("   largest survival gap over {} months: {:.3f}".format(
        MONTHS, gap))
    for t in (1, 4, 7, 13):
        rate = (b + t - 1) / (a + b + t - 1)
        print("   month {:2d} renewal: ratchet {:.3f}, selection {:.3f}"
              .format(t - 1, p05.renew(t - 1), rate))
    print("   a new subscriber given 12 months of imported history:")
    print("     ratchet model renewal {:.3f}; selection model {:.3f}".format(
        p05.renew(12), b / (a + b)))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《弃单挽回动力学、沉没数据续费棘轮与高客单顾问筛选机制》第 3 章「沉没数据的续费棘轮,与同样上升的筛选曲线」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090209

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

BibTeX
@book{fan2026079,
  author    = {Fan, Yafu},
  title     = {Cart-Abandonment Recovery Kinetics, Sunk-Data Retention Ratchets and High-Ticket B2B Qualification Mechanisms},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090209},
  url       = {https://doi.org/10.5281/zenodo.24090209}
}

本书其他章节结论