What does Five-Minute Leads and Leakage Audits conclude, in numbers, about “Fast Teams Are Better Teams: Confounding, Randomised Delays and a Shift Boundary”?

Answer: Fast teams are better teams, so comparing fast teams with slow teams inflates the effect of delay. In the known world of program p21 the pooled comparison gives 3.206, the true multiple over the same bins is 1.441, and stratifying within teams brings the estimate back to 1.417. Randomising three thousand leads gives a multiple of 1.235, with an interval that covers the truth and excludes the pooled figure. The handover discontinuity is nearly unbiased over repeated samples, though any single estimate is noisy.

Scope of the numbers: Parameters are illustrative and all calculations are generated by the book's programs. This is general analysis of law, tax, investment and business operations, not personalised advice.

中文版

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: 1.417, 1.441, 3.206

leads simulated20,000 in 40 teams
fast leads (t <5 min): 4,269, contact 0.5020
slow leads (t >30 min): 5,339, contact 0.1566
naive pooled multiple 5 v 30 min3.206
true causal multiple at t5 v t = 30: 1.195
true multiple for the same two bins1.441
within-team (Mantel-Haenszel) estimate1.417
share of the naive multiple that is confounding0.686
Show the full program
# Chapter 2. p21: fast teams are better teams; the naive multiple lies.
# Model (illustrative, seed fixed): 40 sales teams with quality q drawn
# from N(0, 1). A team's typical first-touch delay is 12 exp(-1.1 q)
# minutes; each lead's delay is that times a lognormal draw. Contact
# probability is c(q) * (w + (1 - w) exp(-t / tau)) with c(q) = 0.75
# / (1 + exp(-1.2 q)), w = 0.5 and tau = 60 minutes: the true causal
# effect of delay is mild. The naive comparison pools all teams; the
# stratified estimate compares fast and slow leads inside each team
# (Mantel-Haenszel risk ratio) and so holds team quality fixed.
import math
import random

TEAMS = 40
LEADS_PER_TEAM = 500
W, TAU = 0.5, 60.0


def contact_p(q, t):
    c = 0.75 / (1.0 + math.exp(-1.2 * q))
    return c * (W + (1.0 - W) * math.exp(-t / TAU))


def simulate(rng):
    rows = []
    for team in range(TEAMS):
        q = rng.gauss(0.0, 1.0)
        typical = 12.0 * math.exp(-1.1 * q)
        for _ in range(LEADS_PER_TEAM):
            t = typical * math.exp(rng.gauss(0.0, 0.9))
            y = 1 if rng.random() < contact_p(q, t) else 0
            rows.append((team, t, y))
    return rows


def rate(rows):
    n = len(rows)
    k = 0
    for r in rows:
        k += r[2]
    return k / n if n else float("nan"), n


def mantel_haenszel(rows, fast, slow):
    num, den = [], []
    for team in range(TEAMS):
        a = [r for r in rows if r[0] == team and fast(r[1])]
        b = [r for r in rows if r[0] == team and slow(r[1])]
        if not a or not b:
            continue
        ya = 0
        for r in a:
            ya += r[2]
        yb = 0
        for r in b:
            yb += r[2]
        n = len(a) + len(b)
        num.append(ya * len(b) / n)
        den.append(yb * len(a) / n)
    return math.fsum(num) / math.fsum(den)


if __name__ == "__main__":
    rng = random.Random(20261120)
    rows = simulate(rng)
    fast = lambda t: t <= 5.0
    slow = lambda t: t >= 30.0
    pf, nf = rate([r for r in rows if fast(r[1])])
    ps, ns = rate([r for r in rows if slow(r[1])])
    true_ratio = (W + (1 - W) * math.exp(-5 / TAU)) / (
        W + (1 - W) * math.exp(-30 / TAU))
    print("leads simulated: {:,} in {} teams".format(len(rows), TEAMS))
    print("fast leads (t <= 5 min): {:,}, contact {:.4f}".format(nf, pf))
    print("slow leads (t >= 30 min): {:,}, contact {:.4f}".format(ns, ps))
    print("naive pooled multiple 5 v 30 min: {:.3f}".format(pf / ps))
    print("true causal multiple at t = 5 v t = 30: {:.3f}".format(
        true_ratio))
    dec = lambda t: W + (1 - W) * math.exp(-t / TAU)
    bf = math.fsum(dec(r[1]) for r in rows if fast(r[1])) / nf
    bs = math.fsum(dec(r[1]) for r in rows if slow(r[1])) / ns
    print("true multiple for the same two bins: {:.3f}".format(bf / bs))
    print("within-team (Mantel-Haenszel) estimate: {:.3f}".format(
        mantel_haenszel(rows, fast, slow)))
    print("share of the naive multiple that is confounding: {:.3f}".format(
        1.0 - math.log(bf / bs) / math.log(pf / ps)))

Single source and citation

Fan, Y. (2026). Five-Minute High-Intent Lead Conversion, Offline Deal-Leakage Auditing and Referral Commission Lock-In (Version 1.0.0), Chapter 2: Fast Teams Are Better Teams: Confounding, Randomised Delays and a Shift Boundary. 5D Library. DOI pending

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

BibTeX
@book{fan2026348,
  author    = {Fan, Yafu},
  title     = {Five-Minute High-Intent Lead Conversion, Offline Deal-Leakage Auditing and Referral Commission Lock-In},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book