What does Simpson's Paradox and Back-Door Adjustment conclude, in numbers, about “Classics East and West: the Lüshi Chunqiu on Examining Hearsay, and Yule 1903”?
Answer: Chapter 7 examines the Lüshi Chunqiu line that many words seem wrong but are right, and many seem right but are wrong, together with Yule's paper of 1903.
Scope of the numbers: Branches, plans and conversions are illustrative; all calculations are generated by the book's programs. This is general analysis, not individualised business advice.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python only
| (a) flip chance per retelling q | 0.1 |
| after | 1 retellings P(wrong) = 0.1000 |
| after | 2 retellings P(wrong) = 0.1800 |
| after | 3 retellings P(wrong) = 0.2440 |
| after | 5 retellings P(wrong) = 0.3362 |
| after 10 retellings P(wrong) | 0.4463 |
| after 20 retellings P(wrong) | 0.4942 |
| (b) h looks-right-is-wrong looks-wrong-is-right total | |
| 0.10 | 0.0600 0.0585 0.1185 |
| 0.25 | 0.1244 0.1183 0.2427 |
| 0.40 | 0.1559 0.1553 0.3113 |
| 0.49 | 0.1736 0.1747 0.3483 |
Show the full program
# Chapter 7. p71: "white becomes black after several retellings" and
# "seems right but is wrong", written as two checkable quantities.
# (a) Each retelling flips a yes/no claim with probability q; after n
# retellings P(wrong) = (1 - (1 - 2q)^n) / 2, exact Fraction.
# (b) Random three-branch worlds (no sampling noise): branch weights
# uniform on the simplex, B rates uniform in [0.05, 0.85], branch
# effects uniform in [-0.1, 0.1], P(A | branch) uniform in
# [0.5 - h, 0.5 + h]. How often does the pooled gap carry the
# wrong sign relative to the back-door average effect?
# Fixed seed; parameters illustrative.
import math
import random
from fractions import Fraction as F
WORLDS = 20000
def world(rng, h):
g = [rng.expovariate(1.0) for _ in range(3)]
t = math.fsum(g)
pz = [x / t for x in g]
pb = [rng.uniform(0.05, 0.85) for _ in range(3)]
ef = [rng.uniform(-0.1, 0.1) for _ in range(3)]
pa = [rng.uniform(0.5 - h, 0.5 + h) for _ in range(3)]
ate = math.fsum(pz[s] * ef[s] for s in range(3))
ma = math.fsum(pz[s] * pa[s] for s in range(3))
ya = math.fsum(pz[s] * pa[s] * (pb[s] + ef[s]) for s in range(3))
yb = math.fsum(pz[s] * (1 - pa[s]) * pb[s] for s in range(3))
pooled = ya / ma - yb / (1 - ma)
return ate, pooled
def main():
q = F(1, 10)
print("(a) flip chance per retelling q = {}".format(float(q)))
for n in (1, 2, 3, 5, 10, 20):
p = (1 - (1 - 2 * q) ** n) / 2
print(" after {:2d} retellings P(wrong) = {:.4f}".format(
n, float(p)))
rng = random.Random(20261113)
print("(b) h looks-right-is-wrong looks-wrong-is-right total")
for h in (0.1, 0.25, 0.4, 0.49):
a = b = 0
for _ in range(WORLDS):
ate, pooled = world(rng, h)
if pooled > 0 and ate < 0:
a = a + 1
elif pooled < 0 and ate > 0:
b = b + 1
print(" {:5.2f} {:15.4f} {:21.4f} {:12.4f}".format(
h, a / WORLDS, b / WORLDS, (a + b) / WORLDS))
if __name__ == "__main__":
main()Single source and citation
Fan, Y. (2026). Simpson's Paradox and the Back-Door Criterion: Reversals When Branch Data Are Pooled and De-Confounding with Causal Graphs (Version 1.0.0), Chapter 7: Classics East and West: the Lüshi Chunqiu on Examining Hearsay, and Yule 1903. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-302 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026302,
author = {Fan, Yafu},
title = {Simpson's Paradox and the Back-Door Criterion: Reversals When Branch Data Are Pooled and De-Confounding with Causal Graphs},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Every Branch Wins, the Total Loses: the Reversal Condition for 2 x 2 x k Tables
- Chapter 2 · How Common Are Reversals? The Smallest Example, Random Tables and Sampling Noise
- Chapter 3 · The Back-Door Adjustment Formula: Standardisation, Inverse Probability Weighting and a Structural Model with a Known Answer
- Chapter 4 · One Table, Three Causal Graphs: Confounder, Mediator and Collider
- Chapter 5 · Enumerating Back-Door Sets: d-Separation, M-Bias and Counting Causal Graphs
- Chapter 6 · Sampling Error in Stratified Estimates: Intervals, Power and Sparse Strata
- Chapter 8 · Forced Stratification and Adjustment of Multi-Branch Reports: the Closed Loop, the Tool and a Pre-Registered Test