What does Discrete Cyclical Networks and Occupancy Entropy conclude, in numbers, about “Cleaning Out Counterexamples and Spurious Correlations: The Barnum Effect, Multiple Testing and Data Snooping”?

Answer: The Barnum effect shows that "feeling accurate" is not evidence: Forer's students gave a description identical for all of them a mean of about 4.3 out of 5. In Carlson's 1985 double-blind test the astrologers' first choices were right about 34 % of the time, no different from the chance one-third; Ertel's reanalysis is disputed, and Dean and Kelly's review and the time-twins study are likewise negative; for stem-and-branch fate calculation the author found no comparable test. In pure noise without any effect, 176 tests yield on average 8.8 "significant" patterns and every history has a "discovery"; the most significant pattern of the first half has a mean \(t\) of 0.00 in the second. Data snooping must be corrected against a null distribution over "all models considered", and the null distribution must also respect time structure, or else for contiguous labels the false-positive rate can double. The next chapter returns to the documentary sources of these rules.

Scope of the numbers: The book presents mathematical models for teaching and research; it is not investment, trading, tax or legal advice. Marked boxes separate published evidence, runnable Python calculations (17 programs, all checked), 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.00, 176, 8.8

tests per history176; histories: 2000
mean 'significant' patterns at p < 0.05, uncorrected8.8
share of histories with at least one discovery:
uncorrected 100%, Bonferroni 3.6%, Benjamini-Hochberg 3.7%
best pattern in the first 48 years: mean |t|2.85
same pattern in the last 48 years: mean t = +0.00; still t > 1.96 in 2.5%
Show the full program
# Pattern mining on PURE NOISE: 96 x 12 = 1,152 independent N(0, 1) months. Every value
# of seven calendar labels is tested against all other months (normal-approximation
# t test): 176 tests per history.
import math, random
from statistics import NormalDist
YEARS, Y0 = 96, 6                       # first year = index 6 in the cycle (Geng-Wu)
PHI = NormalDist().cdf

def labels(T):
    y, m = divmod(T, 12)
    yk = (y + Y0) % 60; mk = (12 * (y + Y0) + m + 2) % 60
    return {"year stem": yk % 10, "year branch": yk % 12, "year cycle no.": yk,
            "month stem": mk % 10, "month branch": mk % 12, "month cycle no.": mk,
            "offset d": (mk % 12 - yk % 12) % 12}

LAB = [labels(T) for T in range(12 * YEARS)]

def tests(x, idx):
    """Return list of (name, t, p) for every class of every label over months idx."""
    out = []
    for fam in LAB[0]:
        groups = {}
        for i in idx:
            groups.setdefault(LAB[i][fam], []).append(x[i])
        tot, n = sum(x[i] for i in idx), len(idx)
        ss = sum(x[i] ** 2 for i in idx)
        for c, g in groups.items():
            k = len(g); m1 = sum(g) / k; m0 = (tot - sum(g)) / (n - k)
            var = (ss - tot * tot / n) / (n - 1)
            t = (m1 - m0) / math.sqrt(var * (1 / k + 1 / (n - k)))
            out.append((f"{fam} {c}", t, 2 * (1 - PHI(abs(t)))))
    return out

def bh(ps, q=0.05):
    s = sorted(ps); m = len(ps)
    k = max([i + 1 for i, p in enumerate(s) if p <= q * (i + 1) / m], default=0)
    return k

def experiment(H=2000, seed=1995):
    """H pure-noise histories: discoveries per history and the best in-sample pattern."""
    rng = random.Random(seed); counts, best_in, best_out = [], [], []
    fw_bonf = fw_bh = 0
    for h in range(H):
        x = [rng.gauss(0, 1) for _ in range(12 * YEARS)]
        res = tests(x, range(12 * YEARS)); ps = [p for _, _, p in res]; m = len(ps)
        counts.append(sum(p < 0.05 for p in ps))
        fw_bonf += any(p < 0.05 / m for p in ps); fw_bh += bh(ps) > 0
        half = 12 * YEARS // 2
        second = {nm: t for nm, t, _ in tests(x, range(half, 12 * YEARS))}
        first = [r for r in tests(x, range(half)) if r[0] in second]
        name, t1, _ = max(first, key=lambda r: abs(r[1])); t2 = second[name]
        best_in.append(abs(t1)); best_out.append(t2 * (1 if t1 > 0 else -1))
    return m, counts, fw_bonf, fw_bh, best_in, best_out

if __name__ == "__main__":
    H = 2000
    m, counts, fw_bonf, fw_bh, best_in, best_out = experiment(H)
    raw = sum(counts); fw_raw = sum(c > 0 for c in counts)
    print(f"tests per history: {m}; histories: {H}")
    print(f"mean 'significant' patterns at p < 0.05, uncorrected: {raw / H:.1f}")
    print("share of histories with at least one discovery:")
    print(f"   uncorrected {fw_raw / H:.0%}, Bonferroni {fw_bonf / H:.1%},"
          f" Benjamini-Hochberg {fw_bh / H:.1%}")
    print(f"best pattern in the first 48 years: mean |t| = {sum(best_in) / H:.2f}")
    print(f"same pattern in the last 48 years:  mean t = {sum(best_out) / H:+.2f};"
          f" still t > 1.96 in {sum(t > 1.96 for t in best_out) / H:.1%}")

Single source and citation

Fan, Y. (2026). Two-Scale Renormalization, Occupancy Entropy and Thrust-Wave Superposition in Discrete Cyclical Networks (Version 1.0.0), Chapter 6: Cleaning Out Counterexamples and Spurious Correlations: The Barnum Effect, Multiple Testing and Data Snooping. 5D Library. https://doi.org/10.5281/zenodo.23796761

DOI: 10.5281/zenodo.23796761 · Read the monograph · 5DL-B-037 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026037,
  author    = {Fan, Yafu},
  title     = {Two-Scale Renormalization, Occupancy Entropy and Thrust-Wave Superposition in Discrete Cyclical Networks},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.23796761},
  url       = {https://doi.org/10.5281/zenodo.23796761}
}

Other chapter answers in this book