What does The Four-Hundred-Volume Self-Sustaining Loop conclude, in numbers, about “A Sparse Network of Axioms: Degree Distribution, Clustering, Connected Pieces and Modularity”?

Answer: Lower the rate of new words to 0.800 and differences begin to show. Under cumulative advantage the number of distinct words falls to 1,064.4, the most-used word appears 9.4 times, and 8.6 words appear five times or more. Lower the rate to 0.500 and cumulative advantage produces clear hubs: the most-used word appears 58.2 times on average and 44.9 words appear five times or more, while under uniform reuse the most-used word appears only 10.7 times. The tail exponent of Simon's model says the same thing. At a new-word rate of 0.933 the exponent is 15.93, so steep that there is practically no tail. At 0.800 it is 6.00. Only at 0.500 does it fall to 3.00, close to the order of magnitude usual for citation networks.

Scope of the numbers: The library is an archipelago, not a hologram; a synthetic model shows that if half of new volumes each make one bridging citation, most new volumes join one giant component. Under an illustrative baseline g is 0.018, the critical scale is 55.6 and the feasible reinvestment band runs from 0.294 to 0.529; only 0.231 of the phase diagram meets both the growth and the personal-draw conditions.

中文版

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.500, 0.800, 0.933, 10.7, 1064.4, 15.93

real: distinct 1,241 hist [1167, 64, 6, 3, 1]
p_new mode distinct once twice3x 4x 5+ top
0.933 pref1,241.1 1,163 68.4 7.7 1.2 0.3 4.1
0.933 unif1,240.0 1,156 77.8 5.4 0.4 0.0 3.4
0.800 pref1,064.4 887 126.8 31.4 10.6 8.6 9.4
0.800 unif1,064.4 851 171.5 33.7 6.7 1.6 5.2
0.500 pref665.6 445 109.6 44.6 21.8 44.9 58.2
0.500 unif663.9 331 165.4 83.7 41.5 41.8 10.7
Simon tail exponent at p_new 0.93315.93
Simon tail exponent at p_new 0.8006.00
Simon tail exponent at p_new 0.5003.00
Show the full program
# Chapter 2. p22: cumulative advantage in keyword reuse (Simon / Price)
# A stream of 1,330 keyword tokens (the size of the real B-001..B-332
# list). Each token is a new keyword with probability p_new; otherwise
# it reuses an old one, chosen in proportion to past use (cumulative
# advantage) or uniformly (no advantage). Real count-of-counts from the
# public index: 1,167 keywords used once, 64 twice, 6 three times,
# 3 four times, 1 five times. Fixed seed, 200 replicates per setting.
import math
import random

TOKENS = 1330
REAL = [1167, 64, 6, 3, 1]          # used 1, 2, 3, 4, 5+ times
rng = random.Random(40822)


def stream(p_new, pref):
    toks, counts = [], []
    for _ in range(TOKENS):
        if not toks or rng.random() < p_new:
            counts.append(1)
            toks.append(len(counts) - 1)
        else:
            if pref:
                j = toks[rng.randrange(len(toks))]
            else:
                j = rng.randrange(len(counts))
            counts[j] += 1
            toks.append(j)
    return counts


def profile(p_new, pref, reps=200):
    hist = [0.0] * 5
    tops = []
    for _ in range(reps):
        c = stream(p_new, pref)
        for v in c:
            hist[min(v, 5) - 1] += 1
        tops.append(max(c))
    return [h / reps for h in hist], math.fsum(tops) / reps


def main():
    real_d = int(math.fsum(REAL))
    print("real: distinct {:,}  hist {}".format(real_d, REAL))
    print("p_new  mode  distinct  once  twice  3x   4x   5+  top")
    for p_new in (0.933, 0.80, 0.50):
        for pref in (True, False):
            h, top = profile(p_new, pref)
            d = math.fsum(h)
            print("{:.3f} {:>5} {:>8,.1f} {:>5,.0f} {:>6.1f} {:>4.1f}"
                  " {:>4.1f} {:>4.1f} {:>4.1f}".format(
                      p_new, "pref" if pref else "unif", d, h[0], h[1],
                      h[2], h[3], h[4], top))
    for p_new in (0.933, 0.80, 0.50):
        print("Simon tail exponent at p_new {:.3f}: {:.2f}".format(
            p_new, 1 + 1 / (1 - p_new)))


main()

Single source and citation

Fan, Y. (2026). The Four-Hundred-Volume Holographic Knowledge Commonwealth: Self-Sustaining Cashflow-Compute Loops and Unbounded Creative Sovereignty (Version 1.0.0), Chapter 2: A Sparse Network of Axioms: Degree Distribution, Clustering, Connected Pieces and Modularity. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-408 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026408,
  author    = {Fan, Yafu},
  title     = {The Four-Hundred-Volume Holographic Knowledge Commonwealth: Self-Sustaining Cashflow-Compute Loops and Unbounded Creative Sovereignty},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book