What does Regression to the Mean and the Cover Jinx conclude, in numbers, about “The Cover Jinx: Select at the Peak and You Will See a Fall”?

Answer: Chapter 5 shows that the cover jinx is a product of selecting at the peak: a winner chosen from a hundred gets worse in the next period with probability 0.918 even when the cover does nothing, and offers a residual test that can detect a real side effect.

Scope of the numbers: Marked boxes separate published evidence, runnable Python calculations (22 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: 0.918

rhowhothis periodnext periodshare worse
0.3cover star+2.503+0.8140.962
0.3runner-up+2.154+0.6420.942
0.5cover star+2.501+1.2480.918
0.5runner-up+2.142+1.1220.875
0.8cover star+2.498+2.0340.785
0.8runner-up+2.153+1.7190.770
expected next = rho x this period in every row
Show the full program
# Chapter 5. p51: A magazine that puts the best performer on its cover.
# Each issue looks at 100 performers whose score this period is skill
# plus luck (scaled so the period-to-period correlation is rho) and puts
# the top one on the cover. The cover does nothing. We follow the cover
# star and the runner-up (never on a cover) into the next period, over
# 600 issues. Fixed seed; field size and rho illustrative.
# 封面只选当期第一名;封面本身没有任何作用,看下一期发生什么。
import math
import random

rng = random.Random(1954)
FIELD, ISSUES = 100, 600


def run(rho):
    a, b = math.sqrt(rho), math.sqrt(1.0 - rho)
    rows = []
    for _ in range(ISSUES):
        skill = [rng.gauss(0.0, 1.0) for _ in range(FIELD)]
        now = [a * s + b * rng.gauss(0.0, 1.0) for s in skill]
        nxt = [a * s + b * rng.gauss(0.0, 1.0) for s in skill]
        order = sorted(range(FIELD), key=lambda i: (-now[i], i))
        rows.append([(now[i], nxt[i]) for i in order[:2]])
    out = []
    for pos in (0, 1):
        x = [r[pos][0] for r in rows]
        y = [r[pos][1] for r in rows]
        worse = len([1 for u, v in zip(x, y) if v < u]) / ISSUES
        out.append((math.fsum(x) / ISSUES, math.fsum(y) / ISSUES, worse))
    return out


if __name__ == "__main__":
    print("rho  who         this period  next period  share worse")
    for rho in (0.3, 0.5, 0.8):
        for name, (m1, m2, w) in zip(("cover star", "runner-up"),
                                    run(rho)):
            print("{:.1f}  {:<10}    {:+.3f}       {:+.3f}       {:.3f}"
                  .format(rho, name, m1, m2, w))
    print("expected next = rho x this period in every row")

Single source and citation

Fan, Y. (2026). Regression to the Mean and the Cover Jinx: Posterior Calibration of Fortune Reports and Serial Independence in the Tale of the Lost Horse (Version 1.0.0), Chapter 5: The Cover Jinx: Select at the Peak and You Will See a Fall. 5D Library. DOI pending

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

BibTeX
@book{fan2026202,
  author    = {Fan, Yafu},
  title     = {Regression to the Mean and the Cover Jinx: Posterior Calibration of Fortune Reports and Serial Independence in the Tale of the Lost Horse},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book