What does Private-Message Patience, Handoff and Complaint Blocking conclude, in numbers, about “The Shape of Patience: Exponential, Weibull and Lognormal Hazards, and Estimating Patience under Censoring”?
Answer: Chapter 1 shows that with the same mean patience the hazard can rise, fall, or rise and then fall; under exponential patience a buyer who has waited any length of time leaves within the next 30 seconds with probability 0.221; a falling population hazard may be nothing but the impatient leaving first, and censoring makes simple averages of chat logs wrong.
Scope of the numbers: Its parameters are illustrative; all calculations are generated by its programs; it is not personalised legal, financial or business advice. Marked boxes separate published evidence, runnable Python calculations (18 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.221, 30
| still waiting S(t), mean patience 120 s in every law | ||||
| t (s) | EXP | W1.6 | W0.6 | LN1.0 |
| 0 | 1.000 | 1.000 | 1.000 | 1.000 |
| 15 | 0.882 | 0.970 | 0.693 | 0.943 |
| 30 | 0.779 | 0.913 | 0.573 | 0.812 |
| 60 | 0.607 | 0.758 | 0.430 | 0.577 |
| 120 | 0.368 | 0.432 | 0.279 | 0.309 |
| 240 | 0.135 | 0.078 | 0.144 | 0.116 |
| 480 | 0.018 | 0.000 | 0.053 | 0.030 |
| P(leave within next 30 s | waited t) | ||||
| 0 | 0.221 | 0.087 | 0.427 | 0.188 |
| 15 | 0.221 | 0.135 | 0.290 | 0.274 |
| 30 | 0.221 | 0.169 | 0.249 | 0.290 |
| 60 | 0.221 | 0.223 | 0.207 | 0.279 |
| 120 | 0.221 | 0.303 | 0.167 | 0.239 |
| 240 | 0.221 | 0.410 | 0.132 | 0.184 |
| 480 | 0.221 | 0.544 | 0.103 | 0.130 |
| median | 83.2 | 106.4 | 43.3 | 72.8 |
Show the full program
# Chapter 1. p11: three patience laws with the same mean, three hazards.
# Model (illustrative parameters, not data): a buyer who sends a private
# message waits a random "patience" T seconds and leaves if no reply has
# come. All four laws below have mean patience 120 s:
# EXP exponential, constant hazard
# W1.6 Weibull shape 1.6, rising hazard ("the longer, the likelier
# to leave")
# W0.6 Weibull shape 0.6, falling hazard ("survive the start, stay")
# LN1.0 lognormal, log-sd 1.0, hazard rises then falls
# For each law the program prints the share still waiting S(t) and the
# chance of leaving within the next 30 s for a buyer who has waited t.
import math
MEAN = 120.0
def weib(k):
lam = MEAN / math.gamma(1.0 + 1.0 / k)
return lambda t: math.exp(-(t / lam) ** k)
def lognorm(sd):
mu = math.log(MEAN) - sd * sd / 2.0
def s(t):
if t <= 0.0:
return 1.0
z = (math.log(t) - mu) / sd
return 0.5 * math.erfc(z / math.sqrt(2.0))
return s
LAWS = (("EXP", lambda t: math.exp(-t / MEAN)), ("W1.6", weib(1.6)),
("W0.6", weib(0.6)), ("LN1.0", lognorm(1.0)))
TS = (0, 15, 30, 60, 120, 240, 480)
def median(s):
lo, hi = 0.0, 1.0e5
for _ in range(80):
mid = (lo + hi) / 2.0
if s(mid) > 0.5:
lo = mid
else:
hi = mid
return lo
print("still waiting S(t), mean patience {:.0f} s in every law".format(
MEAN))
print("t (s) " + "".join("{:>8}".format(n) for n, _ in LAWS))
for t in TS:
print("{:5d} ".format(t) + "".join(
"{:8.3f}".format(s(t)) for _, s in LAWS))
print("P(leave within next 30 s | waited t)")
for t in TS:
print("{:5d} ".format(t) + "".join(
"{:8.3f}".format(1.0 - s(t + 30) / s(t)) for _, s in LAWS))
print("median " + "".join("{:8.1f}".format(median(s)) for _, s in LAWS))Single source and citation
Fan, Y. (2026). Patience-Decay Distributions in Private-Message Queues, Red-Amber-Green Human-AI Handoff Thresholds and Markov Blocking of Complaint Escalation (Version 1.0.0), Chapter 1: The Shape of Patience: Exponential, Weibull and Lognormal Hazards, and Estimating Patience under Censoring. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-175 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026175,
author = {Fan, Yafu},
title = {Patience-Decay Distributions in Private-Message Queues, Red-Amber-Green Human-AI Handoff Thresholds and Markov Blocking of Complaint Escalation},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 2 · Queues that Give Up: Erlang C, Erlang-A and Square-Root Staffing
- Chapter 3 · The Handoff Cutoff in Seconds: Expected Lost Value, Human Cost and Queue Feedback
- Chapter 4 · Red, Amber, Green: Cost-Sensitive Handoff Thresholds on the ROC Curve
- Chapter 5 · A Markov Chain of Complaint Escalation: Absorption Probabilities and the Cheapest Point of Blocking
- Chapter 6 · The Mental Accounting of Waiting: the Peak-End Rule, Eight Propositions on Waiting, and the Fairness Cost of Priority
- Chapter 7 · The Classics Examined: the Nine Postures of the Guiguzi's "Fu Yan" and Erlang's Telephone Exchange
- Chapter 8 · Practice and Falsification: a Closing-Skills Kit for Private-Message Service, Pre-Registered Tests and Refutation Conditions