What does Live Locks, Bank Matching and Styling CRM conclude, in numbers, about “Waking the Pool: Blasts, Targets and the Right Day”?

Answer: Chapter 6 shows a blast lifting the returning share from 0.2100 to 0.3848 while 2308 customers block the shop, and targeting twice a month reaching 0.4240 with 849 blocked; the best day to write is about day 103 after a purchase.

Scope of the numbers: Its customers, delays, rates and parameters are illustrative models; all calculations are generated by its programs; the book is not legal, financial, banking or data-protection 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. printed values that match the answer: 0.2100, 0.3848, 0.4240, 2308, 849

baseline: 945 returning purchases, share 0.2100
policyextra buysblockedreachableshare
blast 4/month12792308126920.3848
targeted 1/month848431145690.3353
targeted 2/month1672849141510.4240
targeted 2, r 0.602184669143310.4681
share 0.42 needs 1629 extra returning purchases a year
Show the full program
# Chapter 6. p11: Blast or target? A private pool of 15000 past buyers,
# of whom 0.063 buy in a year on their own (945 a year), while 3555 new
# customers a year make returning buyers 0.21 of all purchases. Each
# month the shop sends messages. A message is relevant to the reader
# with chance r; she buys after a relevant one with chance 0.010 and
# after an irrelevant one with 0.0005; she blocks the shop after an
# irrelevant one with chance 0.004 and after a relevant one with
# 0.0005. Blast: 4 messages a month to all, r = 0.15. Targeted: 1 a
# month, r = 0.45 (a top-3 match as in p09), or 2 a month. Expected
# values over twelve months; no sampling.
NEW = 3555.0

def year(per_month, r, months=12):
    reach, bought, blocked = 15000.0, 0.0, 0.0
    for _ in range(months):
        for _ in range(per_month):
            buy = reach * (r * 0.010 + (1 - r) * 0.0005)
            blk = reach * (r * 0.0005 + (1 - r) * 0.004)
            bought += buy
            blocked += blk
            reach -= blk
    return bought, blocked, reach

if __name__ == "__main__":
    base = 15000 * 0.063
    print("   baseline: {:.0f} returning purchases, share {:.4f}".format(
        base, base / (base + NEW)))
    print("     policy              extra buys   blocked   reachable"
          "   share")
    for name, k, r in (("blast 4/month", 4, 0.15),
                       ("targeted 1/month", 1, 0.45),
                       ("targeted 2/month", 2, 0.45),
                       ("targeted 2, r 0.60", 2, 0.60)):
        b, x, left = year(k, r)
        old = base + b
        print("     {:18s}  {:10.0f}   {:7.0f}   {:9.0f}   {:6.4f}".format(
            name, b, x, left, old / (old + NEW)))
    need = 0.42 / 0.58 * NEW - base
    print("   share 0.42 needs {:.0f} extra returning purchases a year"
          .format(need))

Single source and citation

Fan, Y. (2026). Live-Shopping Flash Inventory Locks, Bayesian Bank-Feed Reconciliation and Personalized Styling CRM (Version 1.0.0), Chapter 6: Waking the Pool: Blasts, Targets and the Right Day. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-112 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026112,
  author    = {Fan, Yafu},
  title     = {Live-Shopping Flash Inventory Locks, Bayesian Bank-Feed Reconciliation and Personalized Styling CRM},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book