What does CUSUM Alarms conclude, in numbers, about “Siegmund's Approximation and Lorden's Bound: Detection Delay Grows Only with the Logarithm of the False-Alarm Interval”?

Answer: The information per reading is 0.125. With each tenfold increase in the false-alarm interval, the CUSUM's delay rises by 16.2, then 18.1, then 18.4 days, approaching the slope of the bound, the natural logarithm of ten divided by the information, which is 18.4 days. The fixed threshold grows in an entirely different way: each tenfold increase in the false-alarm interval multiplies its delay by 7.1, 7.5 and 7.7. With a false-alarm interval of a hundred thousand days, the CUSUM raises its alarm after 67.5 days on average and the fixed threshold after 12003.2 days.

Scope of the numbers: Parameters are illustrative; all calculations are generated by the book's programs; the book is general business analysis, not individualised business advice, and Chapter 8 is an offline model that reads no server. Marked boxes separate published evidence, runnable Python calculations (23 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: 0.125, 12003.2, 16.2, 18.1, 18.4, 67.5

ARL0 h CUSUM ARL1 fixed ARL1 log(ARL0)/I
1004.415 14.8 29.5 36.8
10008.582 31.1 208.5 55.3
1000013.109 49.1 1554.8 73.7
10000017.703 67.5 12003.2 92.1
information per reading I0.125
CUSUM delay added per tenfold ARL016.2, 18.1, 18.4
slope of the bound, ln(10) / I18.4
fixed threshold delay ratio per tenfold ARL07.1, 7.5, 7.7
Show the full program
# Chapter 4. p43: delay grows with the log of the false-alarm interval.
# Model: for a shift of delta = 0.5 the CUSUM uses k = delta / 2 = 0.25,
# h from Siegmund's formula (p41) for each ARL0; its ARL1 is then taken
# from the Brook and Evans chain (m = 80). The fixed threshold uses L
# with P(Z > L) = 1 / ARL0. Lorden's (1971) asymptote for the best
# possible delay is log(ARL0) / I, with I = delta^2 / 2 the information
# per reading (illustrative).
import math


def cdf(x):
    return 0.5 * math.erfc(-x / math.sqrt(2.0))


def upper(x):
    return 0.5 * math.erfc(x / math.sqrt(2.0))


def solve(a, b):
    # Gaussian elimination with partial pivoting; back substitution
    # adds its terms with math.fsum
    n = len(b)
    m = [list(row) + [b[i]] for i, row in enumerate(a)]
    for p in range(n):
        q = max(range(p, n), key=lambda r: abs(m[r][p]))
        m[p], m[q] = m[q], m[p]
        piv = m[p]
        for r in range(p + 1, n):
            f = m[r][p] / piv[p]
            if f != 0.0:
                m[r] = m[r][:p] + [x - f * y for x, y in
                                   zip(m[r][p:], piv[p:])]
    x = [0.0] * n
    for i in range(n - 1, -1, -1):
        s = math.fsum(m[i][j] * x[j] for j in range(i + 1, n))
        x[i] = (m[i][n] - s) / m[i][i]
    return x


def arl(k, h, delta, m=80):
    w = 2.0 * h / (2 * m - 1)
    a = []
    for i in range(m):
        c = i * w - k + delta
        row = [-cdf(w / 2.0 - c)]
        for j in range(1, m):
            row.append(cdf(j * w - w / 2.0 - c)
                       - cdf(j * w + w / 2.0 - c))
        row[i] = row[i] + 1.0
        a.append(row)
    return solve(a, [1.0] * m)[0]


def siegmund(k, h, delta):
    # Siegmund (1985): b = h + 1.166, D = delta - k
    b = h + 1.166
    d = delta - k
    if abs(d) < 1e-12:
        return b * b
    return (math.exp(-2.0 * d * b) + 2.0 * d * b - 1.0) / (2.0 * d * d)


def limit_for(arl0):
    lo, hi = 0.0, 10.0
    for _ in range(200):
        mid = 0.5 * (lo + hi)
        if upper(mid) > 1.0 / arl0:
            lo = mid
        else:
            hi = mid
    return 0.5 * (lo + hi)


def h_siegmund(k, target):
    lo, hi = 0.0, 60.0
    for _ in range(100):
        mid = 0.5 * (lo + hi)
        if siegmund(k, mid, 0.0) < target:
            lo = mid
        else:
            hi = mid
    return 0.5 * (lo + hi)


if __name__ == "__main__":
    d = 0.5
    k = d / 2.0
    info = d * d / 2.0
    print("  ARL0     h    CUSUM ARL1  fixed ARL1  log(ARL0)/I")
    cs = []
    for a0 in (100.0, 1000.0, 10000.0, 100000.0):
        h = h_siegmund(k, a0)
        c = arl(k, h, d)
        f = 1.0 / upper(limit_for(a0) - d)
        cs.append((c, f))
        print(" {:6.0f}  {:6.3f}  {:9.1f}  {:10.1f}  {:10.1f}".format(
            a0, h, c, f, math.log(a0) / info))
    print("information per reading I = {:.3f}".format(info))
    steps = [b[0] - a[0] for a, b in zip(cs, cs[1:])]
    print("CUSUM delay added per tenfold ARL0: " + ", ".join(
        "{:.1f}".format(x) for x in steps))
    print("slope of the bound, ln(10) / I = {:.1f}".format(
        math.log(10.0) / info))
    print("fixed threshold delay ratio per tenfold ARL0: " + ", ".join(
        "{:.1f}".format(b[1] / a[1]) for a, b in zip(cs, cs[1:])))

Single source and citation

Fan, Y. (2026). CUSUM Control Charts and Average Run Length: the Fastest Alarm within a False-Alarm Budget for Latency Drift and Silent Conversion Drops (Version 1.0.0), Chapter 4: Siegmund's Approximation and Lorden's Bound: Detection Delay Grows Only with the Logarithm of the False-Alarm Interval. 5D Library. DOI pending

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

BibTeX
@book{fan2026305,
  author    = {Fan, Yafu},
  title     = {CUSUM Control Charts and Average Run Length: the Fastest Alarm within a False-Alarm Budget for Latency Drift and Silent Conversion Drops},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book