关于「跨板块转移矩阵:估计、蚕食与异质性」,《回溯信念与升单自动机》给出的定量结论是什么?

结论:第六章显示稀有的跨板块转移在 1,000 位用户时区间宽度仍为真值的 0.74 倍;「自己学会算」蚕食的测算收入小于学费;两类用户合成一条链会严重低估长尾留存。

数据口径:第一章证明「信任雪崩」是感受上的相变而不是证据上的:泛泛的回溯断言真实似然比只有 1.19,怀疑者需要 27 次命中才半信,但若把基率 0.80 误判为 0.20,3 次就够;在 20,000 位模拟用户中,一位没有任何洞察力的测算师在 6 条泛泛断言之内使 0.5263 的用户确信,而按真实似然比更新的用户几乎无人确信。 第六章显示稀有的跨板块转移在 1,000 位用户时区间宽度仍为真值的 0.74 倍;「自己学会算」蚕食的测算收入小于学费;两类用户合成一条链会严重低估长尾留存。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.74, 1000

users estimate A->B90% bootstrap interval rel. width
1000.0050 [0.0000, 0.0142] 1.42
1,0000.0101 [0.0066, 0.0140] 0.74
10,0000.0099 [0.0086, 0.0110] 0.23
true A->B0.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.
查看完整验算程序
# 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.")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《回溯信念锁定、序贯痛点唤醒与马尔可夫升单自动机》第 6 章「跨板块转移矩阵:估计、蚕食与异质性」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090186

DOI: 10.5281/zenodo.24090186 · 阅读本章所在专著 · 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}
}

本书其他章节结论