关于「三级火箭:测算、学堂与牌照的吸收马尔可夫链」,《回溯信念与升单自动机》给出的定量结论是什么?

结论:第五章把「测算、学堂、牌照」写成吸收马尔可夫链:测算用户成为牌照持有者的概率为 0.0267,LTV 为首单的 4.35 倍,约四分之三来自牌照之路。

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

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 与结论吻合的打印值: 0.0267, 4.35

   from  P(licence)  P(lapse)  months to absorption  LTV
   V         0.0030    0.9970                  2.67     46.77
   T         0.0267    0.9733                  4.00    430.41
   C         0.1500    0.8500                  5.00   2078.60
   expected months as reader / student, from T: 3.33 / 0.67
   LTV from T = readings 81.43 + course 37.21 + licence 311.77
   LTV multiplier on a first reading of 99: 4.35
Reading: a reader becomes a licensee with probability of
under three in a hundred here, yet that path carries most of
her lifetime value; the repeat readings carry the rest.

核心公式

\[N = (I - Q)^{-1}\]
查看完整验算程序
# Chapter 5. [p09] Reading -> academy course -> licence as an absorbing
# Markov chain (one step = one month). Transient states: V visitor,
# T reader (has paid for a reading), C student (in the academy course).
# Absorbing states: L licensee, X lapsed. Rewards: 25 a month in T
# (repeat readings), 60 a month in C (course instalments), 12,537 on
# entering L (the licence price of Vol. 68). Monthly discount 0.99.
# Fundamental matrix N = (I - 0.99 Q)^-1 for discounted values and
# (I - Q)^-1 for counts.
STATES = ("V", "T", "C")
Q = ((0.55, 0.05, 0.00),
     (0.00, 0.70, 0.04),
     (0.00, 0.00, 0.80))
R = ((0.000, 0.40),          # to L, to X
     (0.002, 0.258),
     (0.030, 0.17))
STAY = (0.0, 25.0, 60.0)
ENTRY_L = 12537.0

def inverse(m):
    n = len(m)
    a = [list(row) + [1.0 if i == j else 0.0 for j in range(n)]
         for i, row in enumerate(m)]
    for c in range(n):
        piv = max(range(c, n), key=lambda r: abs(a[r][c]))
        a[c], a[piv] = a[piv], a[c]
        f = a[c][c]
        a[c] = [x / f for x in a[c]]
        for r in range(n):
            if r != c:
                g = a[r][c]
                a[r] = [x - g * y for x, y in zip(a[r], a[c])]
    return [row[n:] for row in a]

def fundamental(delta):
    return inverse([[(1.0 if i == j else 0.0) - delta * Q[i][j]
                     for j in range(3)] for i in range(3)])

def mul(a, b):
    return [[sum(a[i][k] * b[k][j] for k in range(len(b)))
             for j in range(len(b[0]))] for i in range(len(a))]

if __name__ == "__main__":
    n = fundamental(1.0)
    b = mul(n, R)
    nd = fundamental(0.99)
    bd = mul(nd, [[0.99 * r[0]] for r in R])
    print("   from  P(licence)  P(lapse)  months to absorption  LTV")
    for i, s in enumerate(STATES):
        months = sum(n[i])
        ltv = sum(nd[i][j] * STAY[j] for j in range(3)) + \
            bd[i][0] * ENTRY_L
        print("   {:4s} {:11.4f} {:9.4f} {:21.2f} {:9.2f}".format(
            s, b[i][0], b[i][1], months, ltv))
    print("   expected months as reader / student, from T: {:.2f} / {:.2f}"
          .format(n[1][1], n[1][2]))
    parts = (nd[1][1] * STAY[1], nd[1][2] * STAY[2], bd[1][0] * ENTRY_L)
    print("   LTV from T = readings {:.2f} + course {:.2f} + licence {:.2f}"
          .format(*parts))
    print("   LTV multiplier on a first reading of 99: {:.2f}".format(
        sum(parts) / 99))
    print("\nReading: a reader becomes a licensee with probability of")
    print("under three in a hundred here, yet that path carries most of")
    print("her lifetime value; the repeat readings carry the rest.")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《回溯信念锁定、序贯痛点唤醒与马尔可夫升单自动机》第 5 章「三级火箭:测算、学堂与牌照的吸收马尔可夫链」(版本 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}
}

本书其他章节结论