What does Elasticities across Scale conclude, in numbers, about “Finite-Size Scaling: How a Small Matrix Smears the Threshold of a Referral Network”?

Answer: Chapter 5 uses finite-size scaling for the threshold of a referral network between sites; after rescaling, the largest difference among sizes falls from 3.949 times to 1.297 times.

Scope of the numbers: Marked boxes separate published evidence, runnable Python calculations (21 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: 1.297, 3.949

x = (c-1)N^(1/3)-1.0 +0.0 +1.0 +2.0
raw S/N, N125 0.1043 0.1756 0.3006 0.4902
raw S/N, N1000 0.0505 0.0923 0.1647 0.2832
raw S/N, N8000 0.0264 0.0450 0.0889 0.1590
S/N^(2/3), N125 0.522 0.878 1.503 2.451
S/N^(2/3), N1000 0.505 0.923 1.647 2.832
S/N^(2/3), N8000 0.528 0.901 1.779 3.180
largest max/min ratio across N: raw 3.949, rescaled 1.297
Show the full program
# Chapter 5. p52: finite-size scaling collapse of the referral cluster.
# Model as in p51 (random referral links, mean degree c). Near c = 1
# finite-size scaling predicts S_max = N^(2/3) f(x) with the scaling
# variable x = (c - 1) N^(1/3) (critical window of the random graph).
# For each x we set c = 1 + x N^(-1/3) and average 300 seeded graphs,
# seed 20261119. Raw shares S/N differ by N; the rescaled S/N^(2/3)
# should agree across N if the scaling form holds.
import math
import random

rng = random.Random(20261119)


def largest(n, m):
    parent = list(range(n))
    size = [1] * n

    def find(x):
        while parent[x] != x:
            parent[x] = parent[parent[x]]
            x = parent[x]
        return x

    for _ in range(m):
        a, b = rng.randrange(n), rng.randrange(n - 1)
        if b >= a:
            b += 1
        ra, rb = find(a), find(b)
        if ra != rb:
            if size[ra] < size[rb]:
                ra, rb = rb, ra
            parent[rb] = ra
            size[ra] += size[rb]
    return max(size[find(i)] for i in range(n))


XS = (-1.0, 0.0, 1.0, 2.0)
NS = (125, 1000, 8000)
raw, res = {}, {}
for n in NS:
    for x in XS:
        c = 1 + x * n ** (-1 / 3)
        v = [largest(n, round(c * n / 2)) for _ in range(300)]
        s = math.fsum(v) / len(v)
        raw[n, x], res[n, x] = s / n, s / n ** (2 / 3)
print("x = (c-1)N^(1/3):     " + "    ".join("%+5.1f" % x for x in XS))
for n in NS:
    print("raw S/N,  N = %4d   " % n
          + "   ".join("%6.4f" % raw[n, x] for x in XS))
for n in NS:
    print("S/N^(2/3), N = %4d  " % n
          + "   ".join("%6.3f" % res[n, x] for x in XS))


def spread(tab):
    return max(max(tab[n, x] for n in NS) / min(tab[n, x] for n in NS)
               for x in XS)


print("largest max/min ratio across N: raw %.3f, rescaled %.3f"
      % (spread(raw), spread(res)))

Single source and citation

Fan, Y. (2026). Renormalisation Group and Cross-Scale Scaling Laws: Which Conversion Elasticities Survive from a One-Person Workshop to a Hundred-Site Matrix (Version 1.0.0), Chapter 5: Finite-Size Scaling: How a Small Matrix Smears the Threshold of a Referral Network. 5D Library. DOI pending

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

BibTeX
@book{fan2026248,
  author    = {Fan, Yafu},
  title     = {Renormalisation Group and Cross-Scale Scaling Laws: Which Conversion Elasticities Survive from a One-Person Workshop to a Hundred-Site Matrix},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book