关于「弃单跟进的时序与次数」,《弃单、续费与大单筛选》给出的定量结论是什么?

结论:第一章用受外部激发的回访强度模型(不是严格的霍克斯过程)比较跟进时序:「15 分钟、24 小时、72 小时」达到网格最优增益的 91%,220 个时序中有 33 个达到 90%,最优面很平;扣除退订后,第四封以后几乎没有净收益。

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

English version

对照数据表

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

natural return within 7 days0.214
schedule 0.25 h / 24 h / 72 h0.369 (+15.5 points)
best grid schedule 0.25/12/24 h0.384 (+17.0 points)
the rule reaches 91% of the best gain
33 of 220 grid schedules reach 90% of the best gain
查看完整验算程序
# Chapter 1. p01: When to send three follow-ups after an abandoned cart.
# Natural return of an abandoner has hazard h0(t) = a exp(-t/tau) (hours).
# A follow-up sent at time s adds an excitation b(s) exp(-(t-s)/kappa),
# where b(s) = b0 exp(-s/rho) falls as interest fades, and the k-th
# message is weaker by a factor f^k (habituation) and by 1-exp(-gap/G)
# when it follows the previous one too closely. Return is absorbing,
# so this is an externally excited intensity, not a self-exciting Hawkes
# process. We compare the schedule 0.25 h / 24 h / 72 h with the best
# three times on a grid, counting returns within 7 days (168 h).
from itertools import combinations
from math import exp

A, TAU = 0.02, 12.0          # natural return: about 21% eventually
B0, RHO, KAPPA, F, G = 0.08, 30.0, 2.0, 0.8, 12.0
HORIZON, DT = 168.0, 0.05
GRID = (0.25, 1, 2, 4, 8, 12, 24, 36, 48, 72, 96, 120)

def weights(times):
    w, prev = [], None
    for k, s in enumerate(times):
        g = 1.0 if prev is None else 1 - exp(-(s - prev) / G)
        w.append(F ** k * g * B0 * exp(-s / RHO))
        prev = s
    return w

def returned(times, horizon=HORIZON, dt=DT):
    times = sorted(times)
    ws = weights(times)
    cum, t = 0.0, 0.0
    while t < horizon:
        lam = A * exp(-t / TAU)
        for w, s in zip(ws, times):
            if t >= s:
                lam += w * exp(-(t - s) / KAPPA)
        cum += lam * dt
        t += dt
    return 1 - exp(-cum)

def curve(times, step=1.0):
    out, cum, t = [], 0.0, 0.0
    times = sorted(times)
    ws = weights(times)
    while t <= HORIZON:
        out.append((t, 1 - exp(-cum)))
        sub = 0.0
        for i in range(20):
            u = t + (i + 0.5) * step / 20
            lam = A * exp(-u / TAU)
            for w, s in zip(ws, times):
                if u >= s:
                    lam += w * exp(-(u - s) / KAPPA)
            sub += lam * step / 20
        cum += sub
        t += step
    return out

if __name__ == "__main__":
    base = returned(())
    rule = returned((0.25, 24, 72))
    print("   natural return within 7 days: {:.3f}".format(base))
    print("   schedule 0.25 h / 24 h / 72 h: {:.3f}  (+{:.1f} points)".format(
        rule, 100 * (rule - base)))
    scores = {c: returned(c) for c in combinations(GRID, 3)}
    best = max(scores, key=scores.get)
    rb = scores[best]
    print("   best grid schedule {} h: {:.3f}  (+{:.1f} points)".format(
        "/".join("{:g}".format(x) for x in best), rb, 100 * (rb - base)))
    print("   the rule reaches {:.0%} of the best gain".format(
        (rule - base) / (rb - base)))
    near = sum(1 for v in scores.values() if v - base >= 0.9 * (rb - base))
    print("   {} of {} grid schedules reach 90% of the best gain".format(
        near, len(scores)))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《弃单挽回动力学、沉没数据续费棘轮与高客单顾问筛选机制》第 1 章「弃单跟进的时序与次数」(版本 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}
}

本书其他章节结论