What does Spectral Gaps and Bottleneck Cuts conclude, in numbers, about “The Cheeger Constant: How Narrow the Neck Is, Clamped from Both Sides by the Spectrum”?

Answer: Chapter 2 carries the main argument: the Cheeger constant is clamped from both sides by the spectrum, and in a dose-response scan, links added inside clusters raise the mean degree while the algebraic connectivity falls from 0.4384 to 0.2042.

Scope of the numbers: The parameters are illustrative; all calculations are generated by the book's programs; the book is not individual business advice, and any change to a production system or a real supply chain must be reviewed and released by hand by the person in charge. Marked boxes separate published evidence, runnable Python calculations (18 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.2042, 0.4384

Scan A: one bridge, clique size k grows (degree up)
k n edges mean deg lambda2 h exact cut share
36 7 2.333 0.4384 0.3333 0.1429
48 13 3.250 0.3542 0.2500 0.0769
510 21 4.200 0.2984 0.2000 0.0476
612 31 5.167 0.2583 0.1667 0.0323
714 43 6.143 0.2280 0.1429 0.0233
816 57 7.125 0.2042 0.1250 0.0175
Scan B: k8 fixed, bridges b grow (edges at the bottleneck)
b edges mean deg lambda2 h exact lambda2 gain per edge
157 7.125 0.2042 0.1250 0.0000
258 7.250 0.4174 0.2500 0.2133
359 7.375 0.6411 0.3750 0.2185
460 7.500 0.8769 0.5000 0.2242
561 7.625 1.1270 0.6250 0.2307
662 7.750 1.3944 0.7500 0.2381
763 7.875 1.6834 0.8750 0.2465
864 8.000 2.0000 1.0000 0.2565
Show the full program
# Chapter 2. p22: dose-response scan of the main claim on dumbbells:
# two cliques K_k joined by b disjoint bridges. Raising k raises every
# degree; raising b adds edges only where the bottleneck is.
# Model: lambda2 by Jacobi rotation; exact Cheeger constant h by subset
# enumeration (n <= 16); cut share = edges whose removal splits the
# network into halves, divided by all edges. Graph sizes are illustrative.
import math


def laplacian(n, edges):
    lap = [[0.0] * n for _ in range(n)]
    for i, j in edges:
        lap[i][j] -= 1.0
        lap[j][i] -= 1.0
        lap[i][i] += 1.0
        lap[j][j] += 1.0
    return lap


def jacobi(mat, tol=1e-22):
    n = len(mat)
    a = [row[:] for row in mat]
    v = [[1.0 if i == j else 0.0 for j in range(n)] for i in range(n)]
    sweeps = 0
    while True:
        off = math.fsum(a[i][j] ** 2 for i in range(n)
                        for j in range(i + 1, n))
        if off < tol or sweeps > 60:
            break
        sweeps += 1
        for p in range(n - 1):
            for q in range(p + 1, n):
                if abs(a[p][q]) < 1e-300:
                    continue
                th = (a[q][q] - a[p][p]) / (2.0 * a[p][q])
                t = math.copysign(1.0, th) / (abs(th) + math.hypot(th, 1.0))
                c = 1.0 / math.sqrt(t * t + 1.0)
                s = t * c
                for k in range(n):
                    akp, akq = a[k][p], a[k][q]
                    a[k][p] = c * akp - s * akq
                    a[k][q] = s * akp + c * akq
                for k in range(n):
                    apk, aqk = a[p][k], a[q][k]
                    a[p][k] = c * apk - s * aqk
                    a[q][k] = s * apk + c * aqk
                for k in range(n):
                    vkp, vkq = v[k][p], v[k][q]
                    v[k][p] = c * vkp - s * vkq
                    v[k][q] = s * vkp + c * vkq
    order = sorted(range(n), key=lambda i: a[i][i])
    vals = [a[i][i] for i in order]
    vecs = [[v[k][i] for k in range(n)] for i in order]
    return vals, vecs, sweeps


def cheeger_exact(n, edges):
    nbr = [0] * n
    for i, j in edges:
        nbr[i] |= 1 << j
        nbr[j] |= 1 << i
    deg = [bin(x).count("1") for x in nbr]
    bnd = [0] * (1 << n)
    best = None
    for mask in range(1, 1 << n):
        low = mask & -mask
        v = low.bit_length() - 1
        rest = mask ^ low
        bnd[mask] = bnd[rest] + deg[v] - 2 * bin(nbr[v] & rest).count("1")
        k = bin(mask).count("1")
        if 2 * k <= n:
            r = bnd[mask] / k
            if best is None or r < best:
                best = r
    return best


def dumbbell(k, b):
    left = [(a, c) for a in range(k) for c in range(a + 1, k)]
    right = [(a + k, c + k) for a, c in left]
    return left + right + [(k - 1 - i, k + i) for i in range(b)]


print("Scan A: one bridge, clique size k grows (degree up)")
print(" k   n   edges  mean deg  lambda2   h exact  cut share")
for k in range(3, 9):
    es = dumbbell(k, 1)
    n = 2 * k
    lam = jacobi(laplacian(n, es))[0][1]
    print("%2d  %2d   %4d    %6.3f   %7.4f   %7.4f   %7.4f"
          % (k, n, len(es), 2 * len(es) / n, lam, cheeger_exact(n, es),
             1 / len(es)))
print()
print("Scan B: k = 8 fixed, bridges b grow (edges at the bottleneck)")
print(" b   edges  mean deg  lambda2   h exact  lambda2 gain per edge")
base = None
for b in range(1, 9):
    es = dumbbell(8, b)
    lam = jacobi(laplacian(16, es))[0][1]
    gain = 0.0 if base is None else (lam - base) / (b - 1)
    if base is None:
        base = lam
    print("%2d   %4d    %6.3f   %7.4f   %7.4f   %7.4f"
          % (b, len(es), 2 * len(es) / 16, lam, cheeger_exact(16, es),
             gain))

Single source and citation

Fan, Y. (2026). Graph-Laplacian Spectral Gaps and Cheeger Constants: Single-Point Bottleneck Cuts in Multi-Agent Workflows and Cross-Border Supply Chains (Version 1.0.0), Chapter 2: The Cheeger Constant: How Narrow the Neck Is, Clamped from Both Sides by the Spectrum. 5D Library. DOI pending

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

BibTeX
@book{fan2026243,
  author    = {Fan, Yafu},
  title     = {Graph-Laplacian Spectral Gaps and Cheeger Constants: Single-Point Bottleneck Cuts in Multi-Agent Workflows and Cross-Border Supply Chains},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book