What does Private-Channel Rate Shaping conclude, in numbers, about “Pulling Up Shoots and Telephone Traffic: Mencius's Parable and Erlang's Paper of 1909”?

Answer: Chapter 7 examines Mencius's parable of pulling up shoots and Erlang's Poisson paper of 1909; in the illustrative model the frequency with the most useful contacts is 2.25 messages per person a week.

Scope of the numbers: An illustrative plan averaging 10.0 messages a minute still has 420 refused when sent in batches, and none once a token bucket of depth 20 shapes it. Parameters are illustrative, platform figures carry the document and the date read, and all numbers come from the book's programs, which read and write no file and use no network.

中文版

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: 2.25

m/weekuseful contactsobjectionslist after a year
0.00019800
0.51870029818608
1.03002675116797
2.038805189212233
3.03726329817876
5.02563642302881
7.01646346101361
best m on a 0.05 grid: 2.25, useful 39085
Show the full program
# Chapter 7. p72: neither leave the field unweeded nor pull the shoots.
# Model (illustrative): 12,000 consented contacts, 150 opt-ins a week,
# 52 weeks, m messages per contact per week. Per message a contact
# leaves (unsubscribe 0.003 or objection 0.001) with chance
# 0.004 (1 + 0.5 (m - 1)), and is usefully engaged (reads and acts)
# with chance 0.04 / (1 + 0.3 (m - 1)). The year's useful contacts are
# the fsum over weeks of list x m x engagement. m = 0 is Mencius's
# "not weeding"; a large m is "pulling the shoots". Deterministic.
import math


def year(m):
    n, useful, objections = 12000.0, [], []
    bump = 1 + 0.5 * (m - 1)
    eng = 0.04 / (1 + 0.3 * (m - 1))
    for _ in range(52):
        sends = n * m
        useful.append(sends * eng)
        objections.append(sends * 0.001 * bump)
        n = n - sends * 0.004 * bump + 150
        n = max(n, 0.0)
    return math.fsum(useful), math.fsum(objections), n


print("m/week  useful contacts  objections  list after a year")
for m in (0, 0.5, 1, 2, 3, 5, 7):
    u, o, n = year(m)
    print("%6.1f  %15.0f  %10.0f  %16.0f" % (m, u, o, n))
grid = [k / 20 for k in range(0, 141)]
best = max(grid, key=lambda m: year(m)[0])
print("best m on a 0.05 grid: %.2f, useful %.0f" % (best, year(best)[0]))

Single source and citation

Fan, Y. (2026). Rate Control for Private Messaging Channels without Account Bans: Token-Bucket Shaping, Platform-Published Limits and Consent-Based Reach Throughput (Version 1.0.0), Chapter 7: Pulling Up Shoots and Telephone Traffic: Mencius's Parable and Erlang's Paper of 1909. 5D Library. DOI pending

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

BibTeX
@book{fan2026271,
  author    = {Fan, Yafu},
  title     = {Rate Control for Private Messaging Channels without Account Bans: Token-Bucket Shaping, Platform-Published Limits and Consent-Based Reach Throughput},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book