关于「原典考辨:范仲淹之义庄规矩与高尔顿、沃森之断嗣问题」,《族谱合龙与义庄永续》给出的定量结论是什么?
结论:C 段:平均恰好一子时,断绝必然,但很慢。传到第十代,仍有 0.1582 之机会未断,渐近式给出 0.2000;第五十代,0.0376 对 0.0400;第一百代,0.0194 对 0.0200;第二百代,0.0098 对 0.0100。临界情形,断绝是必然,可要很多代。
数据口径:按字辈起名,同代人只剩一字可变,示意参数下一代 11 人就有一半机会撞名;两本 60 人对 40 人之支谱按全名硬接,接对者只占 0.208。 书中数据全为合成或示意,不含任何真实在世者资料;全部计算由书中程序生成;本书是非个人化分析,不构成法律、理财或经营建议,也不做任何血统高下或族群比较。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.0098, 0.0100, 0.0194, 0.0200, 0.0376, 0.0400
| A. Lotka fit: masses sum to 1.00015 | |
| roots of f(s) = s | 0.8193 and 0.9994 |
| iterating from 0 after 5, 20, 60 steps | 0.7560 0.8177 0.8193 |
| B. of 100 surnames, expected number still borne | |
| generation | 1 3 5 10 20 60 |
| surnames | 51.8 30.7 24.4 19.7 18.2 18.1 |
| limit | 18.1 by the smallest root, 0 by Watson's reading |
| C. critical Poisson line (mean 1): survive to generation n | |
| n | 10: 0.1582 2 / n = 0.2000 |
| n | 50: 0.0376 2 / n = 0.0400 |
| n | 100: 0.0194 2 / n = 0.0200 |
| n | 200: 0.0098 2 / n = 0.0100 |
查看完整验算程序
# Chapter 7. p72: the root Watson chose, and the root that is right.
# Model: Watson (1875) noted that s = 1 always solves f(s) = s and
# concluded that every surname dies out. The extinction probability is
# the smallest root in [0, 1], reached by iterating s <- f(s) from 0
# (Bienayme 1845 had the correct statement; see Heyde and Seneta 1972).
# Lotka's (1931) fit f(s) = 0.4825 + 0.2126 s / (1 - 0.5893 s) turns
# f(s) = s into C s^2 - (1 + P0 C - B) s + P0 = 0. The fit's masses sum
# to slightly more than 1, so its upper root sits just below 1. For a
# critical Poisson law (mean 1) extinction is certain but slow; the
# survival chance to generation n is compared with Kolmogorov's 2 / n.
import math
B, C, P0 = 0.2126, 0.5893, 0.4825
def f(s):
return P0 + B * s / (1.0 - C * s)
if __name__ == "__main__":
a, b, c = C, -(1.0 + P0 * C - B), P0
disc = math.sqrt(b * b - 4.0 * a * c)
roots = sorted(((-b - disc) / (2 * a), (-b + disc) / (2 * a)))
print("A. Lotka fit: masses sum to {:.5f}".format(P0 + B / (1 - C)))
print(" roots of f(s) = s: {:.4f} and {:.4f}".format(*roots))
s, path = 0.0, []
for _ in range(60):
s = f(s)
path.append(s)
print(" iterating from 0 after 5, 20, 60 steps: {:.4f} {:.4f} {:.4f}"
.format(path[4], path[19], path[59]))
print("B. of 100 surnames, expected number still borne")
print(" generation:", " ".join("{:>5}".format(n)
for n in (1, 3, 5, 10, 20, 60)))
print(" surnames: ", " ".join("{:>5.1f}".format(
100 * (1.0 - path[n - 1])) for n in (1, 3, 5, 10, 20, 60)))
print(" limit: {:.1f} by the smallest root, 0 by Watson's reading"
.format(100 * (1.0 - roots[0])))
print("C. critical Poisson line (mean 1): survive to generation n")
s = 0.0
surv = {}
for n in range(1, 201):
s = math.exp(s - 1.0)
surv[n] = 1.0 - s
for n in (10, 50, 100, 200):
print(" n = {:>3}: {:.4f} 2 / n = {:.4f}".format(
n, surv[n], 2.0 / n))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《宗族世系有向无环图合龙算法、字辈同余编码与范氏义庄跨代治理母典》第 7 章「原典考辨:范仲淹之义庄规矩与高尔顿、沃森之断嗣问题」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-334 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026334,
author = {Fan, Yafu},
title = {Genealogical DAG Merge Algorithms, Generation-Poem Congruence Coding and the Institutional Economics of the Fan Clan Charitable Estate},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}