What does Community Retention Mechanisms, Weighed conclude, in numbers, about “The First-Week Icebreaking Route: Absorbing Markov Chains, Bottleneck Sensitivity and a Queueing Formula for the First Reply”?
Answer: Chapter 2 writes the first week as an absorbing Markov chain; the icebreak route reaches 3.50 times the day-seven epiphany rate of dumping everything at once, and a queueing formula sizes the hosts behind the first human reply.
Scope of the numbers: Its parameters are illustrative; all calculations are generated by its programs; it is not legal advice and not personalised financial, investment or business advice. Marked boxes separate published evidence, runnable Python calculations (20 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: 3.50
| day dump: epiphany dark icebreak: epiphany dark | |
| 1 | 0.0000 0.2200 0.0000 0.0800 |
| 2 | 0.0180 0.3834 0.0000 0.1536 |
| 3 | 0.0427 0.5044 0.0000 0.2213 |
| 4 | 0.0686 0.5933 0.0973 0.2796 |
| 5 | 0.0930 0.6582 0.2384 0.3237 |
| 6 | 0.1144 0.7051 0.3673 0.3535 |
| 7 | 0.1322 0.7385 0.4623 0.3719 |
| icebreak / dump, epiphany by day 7 | 3.50 |
| move 0.05 from staying to moving on; day-7 epiphany becomes: | |
| J to I | 0.4814 |
| I to C | 0.4743 |
| C to W | 0.4785 |
| W to A | 0.4832 |
Show the full program
# Chapter 2. p21: the first seven days as an absorbing Markov chain.
# States, one step per day: J joined and silent, I posted an introduction,
# C connected (a host or buddy replied), W first small win, A epiphany
# (absorbing), D gone dark (absorbing: stopped opening the community).
# Route "dump" hands every module over on day 1 with no host prompts;
# route "icebreak" adds an introduction prompt, a reply within two hours,
# a buddy pairing and a day-3 small quest. Exact matrix powers.
# Transition probabilities illustrative.
import math
S = ("J", "I", "C", "W", "A", "D")
DUMP = {"J": {"J": 0.62, "I": 0.10, "W": 0.06, "D": 0.22},
"I": {"I": 0.55, "C": 0.15, "W": 0.12, "D": 0.18},
"C": {"C": 0.52, "W": 0.28, "D": 0.20},
"W": {"W": 0.55, "A": 0.30, "D": 0.15}}
ICE = {"J": {"J": 0.40, "I": 0.52, "D": 0.08},
"I": {"I": 0.25, "C": 0.67, "D": 0.08},
"C": {"C": 0.35, "W": 0.57, "D": 0.08},
"W": {"W": 0.45, "A": 0.49, "D": 0.06}}
def step(dist, tr):
parts = {t: [] for t in S}
for s in S:
if s in ("A", "D"):
parts[s].append(dist[s])
continue
for t, p in tr[s].items():
parts[t].append(dist[s] * p)
return {t: math.fsum(parts[t]) for t in S}
def run(tr, days=7):
d = dict.fromkeys(S, 0.0)
d["J"] = 1.0
out = []
for _ in range(days):
d = step(d, tr)
out.append((d["A"], d["D"]))
return out
for tr in (DUMP, ICE):
for s, row in tr.items():
assert abs(math.fsum(row.values()) - 1.0) < 1e-12, s
dump, ice = run(DUMP), run(ICE)
print("day dump: epiphany dark icebreak: epiphany dark")
for k in range(7):
print("{:3d} {:15.4f} {:6.4f} {:19.4f} {:6.4f}".format(
k + 1, dump[k][0], dump[k][1], ice[k][0], ice[k][1]))
print("icebreak / dump, epiphany by day 7: {:.2f}".format(
ice[6][0] / dump[6][0]))
# which single link of the icebreak route is the bottleneck?
print("move 0.05 from staying to moving on; day-7 epiphany becomes:")
for s, nxt in (("J", "I"), ("I", "C"), ("C", "W"), ("W", "A")):
tr = {k: dict(v) for k, v in ICE.items()}
tr[s][s] -= 0.05
tr[s][nxt] += 0.05
print(" {} to {}: {:.4f}".format(s, nxt, run(tr)[6][0]))Single source and citation
Fan, Y. (2026). Identity Ratchets in High-Ticket Communities, Variable-Reward Quest Loops and First-Week Epiphany Retention Engineering (Version 1.0.0), Chapter 2: The First-Week Icebreaking Route: Absorbing Markov Chains, Bottleneck Sensitivity and a Queueing Formula for the First Reply. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-148 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026148,
author = {Fan, Yafu},
title = {Identity Ratchets in High-Ticket Communities, Variable-Reward Quest Loops and First-Week Epiphany Retention Engineering},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · The First-Week Fork: Product-Limit Survival Curves, the Ruse of Heterogeneity and the Price of an Epiphany Rate
- Chapter 3 · Reward Schedules for Quests: the Extinction Resistance of Variable Ratios, the Migration of the Reward-Prediction Error and the Escalating Bill for Surprise
- Chapter 4 · Scheduling Milestone Unlocks: the Goal Gradient, an Exhaustive Optimum that Front-Loads, and How Far an Epiphany Is from a Habit
- Chapter 5 · The Identity Ratchet: Level Inflation, the Completion Condition of the IKEA Effect and Renewals Held by Identity
- Chapter 6 · Excess, Stop Conditions and the Renewal Loop: the Inverted U of Push Dosage, Screening Vulnerable Members, and Low Refunds by Delivery rather than Obstruction
- Chapter 7 · Sources Examined: the Handle of Reward and the Warning against Draining the Pond in the Lüshi Chunqiu, and the Fly-Wheel of Habit in William James's Principles of Psychology
- Chapter 8 · Practice and Refutation: an Owner's Checklist, a Customer-Service Closing Kit and a Pre-Registered Test