关于「冲突对数的平方律:n 选 2、固定审计预算与积压」,《母机收敛判据》给出的定量结论是什么?

结论:\(q\) 取 0.001,也就是一千对里只有一对冲突,听上去已经很干净。可是三百条规则时预期冲突是 44.85 个,两千四百条规则时是 2878.8 个。一百条规则时,\(q\) 为 0.0001 的规则库仍有 0.6096 的机会完全无冲突;\(q\) 一旦升到 0.001,这个概率就跌到 0.0071。

数据口径:书中母机参数均为示意,不涉及任何服务器、域名、密钥或生产信息;全部计算由书中程序生成;本书是非个人化的经营分析,不构成经营建议。 第四章用卡恩算法排序、用强连通分量查环修环,三百卷合成引用图中可比对为 18,828 对,占 0.420。

English version

对照数据表

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

A. expected conflicts q*C(n,2) and P(no conflict)
q n100 n=300 n=1000 n=2400 P0(n=100)
0.00010.50 4.49 50.0 287.9 0.6096
0.0014.95 44.85 499.5 2878.8 0.0071
0.00524.75 224.25 2497.5 14394.0 0.0000
B. first n with P(no conflict) < 0.5
q0.0001 n_half = 119 (sqrt rule 117.7)
q0.001 n_half = 38 (sqrt rule 37.2)
q0.005 n_half = 18 (sqrt rule 16.7)
C. expected conflicts per rule = q (n - 1) / 2
q0.001, n = 300: 0.149 per rule
q0.001, n = 1,200: 0.600 per rule
q0.001, n = 2,400: 1.200 per rule
查看完整验算程序
# Chapter 1. p13: realised conflicts when each pair clashes with prob q.
# Model: pairs clash independently with probability q (illustrative),
# so realised conflicts ~ Binomial(C(n,2), q) with mean
# q C(n,2) and P(no conflict) = (1 - q)^C(n,2). The size n_half at
# which P(no conflict) first drops below one half is the analogue of
# the birthday bound: about sqrt(2 ln 2 / q).
import math


def p_clean(n, q):
    return math.exp(math.comb(n, 2) * math.log1p(-q))


def n_half(q):
    n = 2
    while p_clean(n, q) >= 0.5:
        n += 1
    return n


if __name__ == "__main__":
    print("A. expected conflicts q*C(n,2) and P(no conflict)")
    print("    q        n=100     n=300    n=1000    n=2400  P0(n=100)")
    for q in (0.0001, 0.001, 0.005):
        row = [q * math.comb(n, 2) for n in (100, 300, 1000, 2400)]
        print("  {:<7}{:>9.2f}{:>10.2f}{:>10.1f}{:>10.1f}{:>11.4f}".format(
            q, row[0], row[1], row[2], row[3], p_clean(100, q)))
    print("B. first n with P(no conflict) < 0.5")
    for q in (0.0001, 0.001, 0.005):
        est = math.sqrt(2 * math.log(2) / q)
        print("  q = {:<7} n_half = {:>4}  (sqrt rule {:.1f})".format(
            q, n_half(q), est))
    print("C. expected conflicts per rule = q (n - 1) / 2")
    q = 0.001
    for n in (300, 1200, 2400):
        print("  q = {}, n = {:>5,}: {:.3f} per rule".format(
            q, n, q * (n - 1) / 2))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《三百卷定理依赖图拓扑排序与母机收敛判据、立项噪音与剪枝增益的闭环停机条件母典》第 1 章「冲突对数的平方律:n 选 2、固定审计预算与积压」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-332 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026332,
  author    = {Fan, Yafu},
  title     = {Topological Ordering of the Theorem-Dependency Graph of Three Hundred Volumes and a Convergence Criterion for the Self-Evolving Engine: Halting Conditions between Proposal Noise and Pruning Gain},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论