What does Joining Genealogies and the Perpetual Clan Estate conclude, in numbers, about “Same Name, Same Generation: Collisions Are Far Commoner Than They Look”?
Answer: Start with panel A. With a Zipf exponent of 0.8, the sum of the squared character probabilities is 0.01520. Its reciprocal, the effective pool of characters, is only 65.8. Four hundred candidates look generous, but fewer than seventy actually do the work. The ten most common characters carry a share of 0.294 between them. With an exponent of 0.6 the effective pool is still only 159.6; with an exponent of 1.0 it shrinks to 26.3.
Scope of the numbers: All data are synthetic or illustrative, all calculations come from its programs, and it is general analysis, not legal, financial or business advice; it compares no lineages or ethnic groups. Marked boxes separate published evidence, runnable Python calculations (20 programs), classical sources and the author's hypotheses.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 0.01520, 0.294, 0.6, 0.8, 1.0, 159.6
| A. one generation, K | 400 free characters |
| Zipf s sum p^2 effective pool top-10 share | |
| 0.6 | 0.00627 159.6 0.174 |
| 0.8 | 0.01520 65.8 0.294 |
| 1.0 | 0.03805 26.3 0.446 |
| B. chance of at least one repeated full name among n men | |
| n uniform s | 0.6 s=0.8 s=1.0 pairs s=0.8 |
| 10 | 0.107 0.238 0.453 0.741 0.68 |
| 20 | 0.383 0.667 0.896 0.991 2.89 |
| 30 | 0.672 0.912 0.991 1.000 6.61 |
| 50 | 0.959 0.999 1.000 1.000 18.62 |
| 80 | 1.000 1.000 1.000 1.000 48.04 |
| C. men needed for a 50% / 90% chance of a repeat | |
| approximation sqrt(2 ln 2 / sum p^2): uniform 23.5, s | 0.8 9.5 |
| uniform | 24 / 43 |
| Zipf s | 0.6: 16 / 30 |
| Zipf s | 0.8: 11 / 21 |
| Zipf s | 1.0: 8 / 14 |
Show the full program
# Chapter 1. p11: same-name collisions inside one generation (birthday).
# Model: men of one surname and one generation share the generation
# character, so a two-character given name differs only in the free
# character. The free character is drawn from K candidates with Zipf
# weights p_i proportional to 1 / i^s. The chance that n men contain at
# least one repeated name is 1 - n! e_n(p), where e_n is the elementary
# symmetric polynomial of the weights (exact dynamic programme). The
# uniform case is 1 - prod(1 - i / K). K = 400 and s = 0.8 are
# illustrative values (s = 0.6 and 1.0 shown as sensitivity), not
# measured from any real genealogy.
import math
K = 400
def zipf(k, s):
raw = [1.0 / (i ** s) for i in range(1, k + 1)]
tot = math.fsum(raw)
return [r / tot for r in raw]
def p_no_repeat(weights, n):
# e[j] = elementary symmetric polynomial of degree j
e = [1.0] + [0.0] * n
for w in weights:
for j in range(n, 0, -1):
e[j] = math.fsum([e[j], w * e[j - 1]])
return math.factorial(n) * e[n]
def p_no_repeat_uniform(k, n):
return math.prod(1.0 - i / k for i in range(n))
def first_n(fun, target=0.5):
n = 1
while 1.0 - fun(n) < target:
n += 1
return n
if __name__ == "__main__":
sets = [(sv, zipf(K, sv)) for sv in (0.6, 0.8, 1.0)]
print("A. one generation, K = {} free characters".format(K))
print(" Zipf s sum p^2 effective pool top-10 share")
for sv, w in sets:
q = math.fsum(x * x for x in w)
print(" {:>6.1f} {:.5f} {:>14.1f} {:>12.3f}".format(
sv, q, 1.0 / q, math.fsum(w[:10])))
print("B. chance of at least one repeated full name among n men")
print(" n uniform s=0.6 s=0.8 s=1.0 pairs s=0.8")
q8 = math.fsum(x * x for x in sets[1][1])
for n in (10, 20, 30, 50, 80):
row = [1.0 - p_no_repeat_uniform(K, n)] + [
1.0 - p_no_repeat(w, n) for _, w in sets]
print(" {:>4} {:>6.3f} {:>6.3f} {:>6.3f} {:>6.3f} {:>8.2f}"
.format(n, *row, math.comb(n, 2) * q8))
print("C. men needed for a 50% / 90% chance of a repeat")
print(" approximation sqrt(2 ln 2 / sum p^2): uniform {:.1f},"
" s=0.8 {:.1f}".format(math.sqrt(2 * math.log(2) * K),
math.sqrt(2 * math.log(2) / q8)))
nu = first_n(lambda n: p_no_repeat_uniform(K, n))
nu9 = first_n(lambda n: p_no_repeat_uniform(K, n), 0.9)
print(" uniform: {} / {}".format(nu, nu9))
for sv, w in sets:
a = first_n(lambda n: p_no_repeat(w, n))
b = first_n(lambda n: p_no_repeat(w, n), 0.9)
print(" Zipf s={:.1f}: {} / {}".format(sv, a, b))Single source and citation
Fan, Y. (2026). Genealogical DAG Merge Algorithms, Generation-Poem Congruence Coding and the Institutional Economics of the Fan Clan Charitable Estate (Version 1.0.0), Chapter 1: Same Name, Same Generation: Collisions Are Far Commoner Than They Look. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 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}
}Other chapter answers in this book
- Chapter 2 · Keeping a Ledger of Likelihood Ratios: Two Thresholds and a Review Zone
- Chapter 3 · A Lineage Is a Directed Acyclic Graph: Topological Sorting and Cycle Detection
- Chapter 4 · The Generation Poem Is a Congruence Code: Dropped Generations, Extra Generations and Collisions Across Cycles
- Chapter 5 · Going to the Southern Seas Was Chain Migration: Branching Processes and the Crowding of Ports
- Chapter 6 · The Perpetual Charitable Estate: Extinction Probabilities, a Ration Ledger and the Risk of Governance
- Chapter 7 · The Classics Examined: Fan Zhongyan's Rules for the Charitable Estate and the Extinction Problem of Galton and Watson
- Chapter 8 · The Quarterly Merge Check-up: Procedure, Distilled Tool and Pre-registered Refutation