关于「信息缺口、购买风险率与「说得准」的感觉」,《裂变、好奇心与付费墙》给出的定量结论是什么?

结论:第四章把信息缺口写成购买风险率:揭示一半时购买概率 0.451 最高,延迟一天降到 0.078;通用解读被认为的准确度 0.838 接近有信息的解读,却在调包检验中只有随机水平 0.333,身份标签使转发率从 0.583 升到 0.745。

数据口径:本书不是经营、法律或投资建议;全部数据为程序生成的合成数据。 书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。

English version

对照数据表

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

   reader     accuracy own   own wins swap test   share no tag   share tag
   generic       0.838             0.333            0.583        0.745
   informed      0.939             0.653            0.676        0.819
Reading: the generic reading feels almost as accurate as the
informed one - both pick statements with high base rates - yet
it fails the swap test exactly at chance (1/3). Adding an
identity label raises sharing more than real information does.
Share rates measure how a reading feels, not whether it is right.
查看完整验算程序
# Chapter 4. "It describes me exactly": perceived accuracy without signal.
# 40 statements; statement j is true of a random person with base rate
# b_j, drawn uniform on [0.2, 0.9]. 5,000 people; truth is independent
# across statements and people. A reading consists of 6 statements.
#   generic    the same 6 statements for everyone: those with the highest
#              base rates (a "Barnum" reading; no information about anyone)
#   informed   a reader who knows each truth value with accuracy 0.8 and
#              picks 6 statements it believes true of THIS person
# Perceived accuracy = share of the 6 statements true of the person.
# Swap test (as in Carlson's double-blind test): shown their own reading
# and two readings made for others, how often does a person's own reading
# score highest (ties split)? Chance is 1/3.
# Sharing is modelled as P(share) = 1 / (1 + exp(3 - 4 acc - 0.8 tag)),
# tag = 1 if the reading carries an identity label ("you are the kind of
# person who..."); the coefficients are assumptions.
import math
import random

def make(rng):
    base = [rng.uniform(0.2, 0.9) for _ in range(40)]
    people = [[rng.random() < b for b in base] for _ in range(5000)]
    return base, people

def generic(base):
    top = sorted(range(40), key=lambda j: -base[j])[:6]
    return lambda person, rng: top

def informed(base):
    def pick(person, rng):
        belief = [t if rng.random() < 0.8 else (not t) for t in person]
        cand = [j for j in range(40) if belief[j]]
        rng.shuffle(cand)
        cand.sort(key=lambda j: -base[j])
        return (cand + list(range(40)))[:6]
    return pick

def acc(person, stmts):
    return sum(person[j] for j in stmts) / len(stmts)

def share(a, tag):
    return 1 / (1 + math.exp(3 - 4 * a - 0.8 * tag))

if __name__ == "__main__":
    rng = random.Random(63008)
    base, people = make(rng)
    print("   reader     accuracy own   own wins swap test   share no tag"
          "   share tag")
    for name, maker in (("generic", generic), ("informed", informed)):
        pick = maker(base)
        readings = [pick(p, rng) for p in people]
        own = [acc(p, r) for p, r in zip(people, readings)]
        wins = 0.0
        for i, p in enumerate(people):
            others = [readings[(i + 1) % 5000], readings[(i + 2) % 5000]]
            scores = [own[i]] + [acc(p, o) for o in others]
            best = max(scores)
            if scores[0] == best:
                wins += 1 / scores.count(best)
        m = sum(own) / len(own)
        print("   {:8s}      {:5.3f}             {:5.3f}"
              "            {:5.3f}        {:5.3f}".format(
                  name, m, wins / len(people),
                  sum(share(a, 0) for a in own) / len(own),
                  sum(share(a, 1) for a in own) / len(own)))
    print("\nReading: the generic reading feels almost as accurate as the")
    print("informed one - both pick statements with high base rates - yet")
    print("it fails the swap test exactly at chance (1/3). Adding an")
    print("identity label raises sharing more than real information does.")
    print("Share rates measure how a reading feels, not whether it is right.")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《超临界病毒级联、信息缺口风险率与多层付费墙优化》第 4 章「信息缺口、购买风险率与「说得准」的感觉」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090174

DOI: 10.5281/zenodo.24090174 · 阅读本章所在专著 · 5DL-B-063 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026063,
  author    = {Fan, Yafu},
  title     = {Supercritical Viral Cascades, Information-Gap Hazard Rates and Multi-Tier Paywall Optimization},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090174},
  url       = {https://doi.org/10.5281/zenodo.24090174}
}

本书其他章节结论