What does Private-Message Patience, Handoff and Complaint Blocking conclude, in numbers, about “The Classics Examined: the Nine Postures of the Guiguzi's "Fu Yan" and Erlang's Telephone Exchange”?
Answer: Chapter 7 examines the nine postures of the Guiguzi's "Fu Yan" and Erlang's telephone-exchange papers of 1909 and 1917, finding that push notices raise the variance-to-mean ratio of message arrivals to 1.992 and break the Poisson premise.
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: 1.992
| count | Poisson | calm audience | audience with pushes |
|---|---|---|---|
| 0 | 0.3679 | 0.3756 | 0.3289 |
| 1 | 0.3679 | 0.3661 | 0.3363 |
| 2 | 0.1839 | 0.1781 | 0.1742 |
| 3 | 0.0613 | 0.0613 | 0.0687 |
| 4 | 0.0153 | 0.0151 | 0.0336 |
| 5+ | 0.0037 | 0.0038 | 0.0583 |
| calm | : mean 0.987, variance / mean 1.020 | ||
| pushes: mean 1.401, variance / mean 1.992 |
Show the full program
# Chapter 7. p71: Erlang's 1909 premise, checked on a private-message
# audience. Model (illustrative parameters, fixed-seed Monte Carlo):
# FANS followers each send a message in a 10 s slot with chance P,
# independently: the count per slot is Binomial(FANS, P), which Erlang
# approximated by Poisson(FANS P). A second audience gets a push
# notice in a share BURST of slots, during which P is five times
# higher. Counts are drawn by inverting the exact binomial CDF.
# Printed: observed versus Poisson frequencies and the dispersion
# index variance / mean (1 for Poisson).
import bisect
import math
import random
import statistics
FANS, P, SLOTS, BURST = 2000, 0.0005, 20000, 0.1
rng = random.Random(20261112)
def cdf(p):
pmf = [math.comb(FANS, k) * p ** k * (1.0 - p) ** (FANS - k)
for k in range(60)]
return [math.fsum(pmf[:k + 1]) for k in range(60)]
CALM, PUSH = cdf(P), cdf(5 * P)
def draw(table):
return min(bisect.bisect_left(table, rng.random()), len(table) - 1)
calm = [draw(CALM) for _ in range(SLOTS)]
mixed = [draw(PUSH if rng.random() < BURST else CALM)
for _ in range(SLOTS)]
m = FANS * P
print("count Poisson calm audience audience with pushes")
for k in range(6):
po = math.exp(-m) * m ** k / math.factorial(k)
if k == 5:
po = 1.0 - math.fsum(math.exp(-m) * m ** j / math.factorial(j)
for j in range(5))
a = len([x for x in calm if (x >= 5 if k == 5 else x == k)]) / SLOTS
b = len([x for x in mixed if (x >= 5 if k == 5 else x == k)]) / SLOTS
print("{:>5} {:7.4f} {:13.4f} {:20.4f}".format(
str(k) if k < 5 else "5+", po, a, b))
for name, xs in (("calm", calm), ("pushes", mixed)):
mu = statistics.fmean(xs)
print("{:6}: mean {:.3f}, variance / mean {:.3f}".format(
name, mu, statistics.pvariance(xs) / mu))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 7: The Classics Examined: the Nine Postures of the Guiguzi's "Fu Yan" and Erlang's Telephone Exchange. 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 1 · The Shape of Patience: Exponential, Weibull and Lognormal Hazards, and Estimating Patience under Censoring
- 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 8 · Practice and Falsification: a Closing-Skills Kit for Private-Message Service, Pre-Registered Tests and Refutation Conditions