What does Retrodiction and Upsell Automata conclude, in numbers, about “Cross-Module Transition Matrices: Estimation, Cannibalization and Heterogeneity”?
Answer: Chapter 6 shows that a rare cross-module transition estimated from 1,000 users still has an interval 0.74 times as wide as the true value, that the reading income cannibalized by "learning to read it yourself" is smaller than the course fee, and that pooling two kinds of user into one chain badly underestimates long-tail retention.
Scope of the numbers: Marked boxes separate evidence, 16 runnable Python programs, classical sources and 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.74, 1000
| users estimate A->B | 90% bootstrap interval rel. width |
| 100 | 0.0050 [0.0000, 0.0142] 1.42 |
| 1,000 | 0.0101 [0.0066, 0.0140] 0.74 |
| 10,000 | 0.0099 [0.0086, 0.0110] 0.23 |
| true A->B | 0.0100 |
| Reading: a rare cross-module link cannot be read off a few | |
| hundred users: at 1,000 users its interval is still three | |
| quarters as wide as the value itself. |
Show the full program
# Chapter 6. [p11] How many users does it take to estimate a cross-module
# transition? Monthly moves among modules C, A, M, B and X (stopped).
# The true matrix below has one rare but valuable link, A -> B (0.01).
# For panels of n users followed 12 months from module C or A (seed
# 69), the maximum-likelihood estimate (row-normalised counts) of
# A -> B and its bootstrap 90% interval (200 resamples of users).
import random
S = ("C", "A", "M", "B", "X")
P = {"C": (0.60, 0.10, 0.08, 0.02, 0.20),
"A": (0.08, 0.62, 0.08, 0.01, 0.21),
"M": (0.06, 0.06, 0.66, 0.02, 0.20),
"B": (0.02, 0.02, 0.02, 0.84, 0.10)}
def step(s, rng):
u, acc = rng.random(), 0.0
for t, p in zip(S, P[s]):
acc += p
if u < acc:
return t
return "X"
def path(rng):
s = rng.choice(("C", "A"))
out = []
for _ in range(12):
if s == "X":
break
t = step(s, rng)
out.append((s, t))
s = t
return out
def est(paths):
n_a = sum(1 for p in paths for s, t in p if s == "A")
n_ab = sum(1 for p in paths for s, t in p if s == "A" and t == "B")
return n_ab / n_a if n_a else 0.0
if __name__ == "__main__":
rng = random.Random(69)
print(" users estimate A->B 90% bootstrap interval rel. width")
for n in (100, 1000, 10000):
paths = [path(rng) for _ in range(n)]
e = est(paths)
boots = sorted(est([paths[rng.randrange(n)] for _ in range(n)])
for _ in range(200))
lo, hi = boots[10], boots[189]
print(" {:6,d} {:13.4f} [{:.4f}, {:.4f}] {:16.2f}".format(
n, e, lo, hi, (hi - lo) / 0.01))
print(" true A->B = 0.0100")
print("\nReading: a rare cross-module link cannot be read off a few")
print("hundred users: at 1,000 users its interval is still three")
print("quarters as wide as the value itself.")Single source and citation
Fan, Y. (2026). Retrodictive Belief Locking, Sequential Pain-Point Agitation and Markovian Upsell Automata (Version 1.0.0), Chapter 6: Cross-Module Transition Matrices: Estimation, Cannibalization and Heterogeneity. 5D Library. https://doi.org/10.5281/zenodo.24090186
DOI: 10.5281/zenodo.24090186 · Read the monograph · 5DL-B-069 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026069,
author = {Fan, Yafu},
title = {Retrodictive Belief Locking, Sequential Pain-Point Agitation and Markovian Upsell Automata},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.24090186},
url = {https://doi.org/10.5281/zenodo.24090186}
}Other chapter answers in this book
- Chapter 1 · Retrodictive Statements and the "Trust Avalanche"
- Chapter 2 · Testing Retrodiction Fairly: Sequential Tests and Selective Recall
- Chapter 3 · The Commitment Ratchet: Price Ratios and Upsell Timing
- Chapter 4 · What Pain-Point Agitation Buys and Costs, and Two Guardrails
- Chapter 5 · The Three-Stage Rocket: an Absorbing Markov Chain of Reading, Academy and Licence
- Chapter 7 · "Probing" and "Flying and Clamping" in the *Guiguzi*, "The Difficulties of Persuasion" in the *Han Feizi*
- Chapter 8 · A Calculator for the User and a Pre-Registered Blinded Test