What does Abandonment, Renewal and Screening conclude, in numbers, about “The Timing and Number of Follow-Ups after Abandonment”?

Answer: Chapter 1 compares follow-up schedules with an externally excited return-intensity model (not strictly a Hawkes process): "15 minutes, 24 hours, 72 hours" reaches 91% of the best gain on the grid, 33 of 220 schedules reach 90%, and the optimum is flat; net of unsubscribes, messages after the fourth add almost nothing.

Scope of the numbers: Return rates, unsubscribe rates, renewal parameters, client valuations and close rates are illustrative or synthetic; all data are generated by its programs; the book is not legal advice. Marked boxes separate published evidence, runnable Python calculations (16 programs), classical sources and the author's hypotheses.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 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
Show the full program
# 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)))

Single source and citation

Fan, Y. (2026). Cart-Abandonment Recovery Kinetics, Sunk-Data Retention Ratchets and High-Ticket B2B Qualification Mechanisms (Version 1.0.0), Chapter 1: The Timing and Number of Follow-Ups after Abandonment. 5D Library. https://doi.org/10.5281/zenodo.24090209

DOI: 10.5281/zenodo.24090209 · Read the monograph · 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}
}

Other chapter answers in this book