What does Spectral Gaps and Bottleneck Cuts conclude, in numbers, about “Cross-Border Supply Chains: Effective Resistance, Maximum Flow and the Weight of One Port”?
Answer: Chapter 5 compares three supply networks with the same number of lanes by effective resistance and maximum flow; the cross-woven design pushes the probability of a quarter delivering half or less down to 0.0203.
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.0203
| design | nominal | worst link | worst site | mean share | P(<=0.5) |
| A main port | 4 | 0.75 | 0.25 | 0.8709 | 0.0777 |
| B port per country | 4 | 0.75 | 0.50 | 0.8909 | 0.0813 |
| C cross-woven | 4 | 0.75 | 0.75 | 0.9550 | 0.0203 |
Show the full program
# Chapter 5. p52: delivered share of the three supply designs of p51
# under random link failures and site closures, by max flow.
# Model: every link carries one unit (one tenth of nominal volume) in
# either direction; each supplier ships one unit, each market takes one
# unit, nominal flow 4 units. Per quarter each link fails with
# probability 0.05 and each port or factory closes with probability
# 0.02, independently (illustrative rates). Max flow by Edmonds-Karp;
# 4,000 quarters per design with common random numbers, seed fixed.
import collections
import math
import random
SITES = ["S1", "S2", "S3", "S4", "P1", "P2", "F1", "F2", "F3",
"M1", "M2", "M3", "M4"]
IX = {s: k for k, s in enumerate(SITES)}
MARKET = [("F1", "M1"), ("F2", "M1"), ("F1", "M2"), ("F3", "M2"),
("F2", "M3"), ("F3", "M3"), ("F1", "M4"), ("F3", "M4")]
DESIGNS = [
("A main port", [("S1", "P1"), ("S2", "P1"), ("S3", "P1"),
("S4", "P1"), ("S4", "P2"), ("P1", "F1"),
("P1", "F2"), ("P1", "F3"), ("P2", "F3"),
("F1", "F2"), ("F2", "F3"), ("F1", "F3")] + MARKET),
("B port per country", [("S1", "P1"), ("S2", "P1"), ("S3", "P2"),
("S4", "P2"), ("S2", "P2"), ("S3", "P1"),
("P1", "F1"), ("P1", "F2"), ("P2", "F2"),
("P2", "F3"), ("F1", "F2"), ("F2", "F3")]
+ MARKET),
("C cross-woven", [("S1", "P1"), ("S1", "P2"), ("S2", "P1"),
("S3", "P2"), ("S4", "P1"), ("S4", "P2"),
("P1", "F1"), ("P1", "F2"), ("P1", "F3"),
("P2", "F1"), ("P2", "F2"), ("P2", "F3")]
+ MARKET),
]
SRC, SNK = 13, 14
def maxflow(links, closed):
res = collections.defaultdict(int)
adj = collections.defaultdict(list)
def arc(u, w, c):
res[(u, w)] += c
adj[u].append(w)
adj[w].append(u)
for a, b in links:
if a in closed or b in closed:
continue
arc(a, b, 1)
arc(b, a, 1)
for s in range(4):
arc(SRC, s, 1)
for m in range(9, 13):
arc(m, SNK, 1)
flow = 0
while True:
prev = {SRC: None}
dq = collections.deque([SRC])
while dq and SNK not in prev:
u = dq.popleft()
for w in adj[u]:
if w not in prev and res[(u, w)] > 0:
prev[w] = u
dq.append(w)
if SNK not in prev:
return flow
w = SNK
while prev[w] is not None:
u = prev[w]
res[(u, w)] -= 1
res[(w, u)] += 1
w = u
flow += 1
rng = random.Random(20261113)
draws = [([rng.random() for _ in range(20)], [rng.random() for _ in
range(5)])
for _ in range(4000)]
print("design nominal worst link worst site mean share"
" P(<=0.5)")
for name, links in DESIGNS:
es = [(IX[a], IX[b]) for a, b in links]
nom = maxflow(es, set())
wl = min(maxflow([e for e in es if e != x], set()) for x in es)
ws = min(maxflow(es, {v}) for v in range(4, 9))
shares, low = [], 0
for lu, su in draws:
alive = [e for e, u in zip(es, lu) if u >= 0.05]
closed = {4 + k for k, u in enumerate(su) if u < 0.02}
f = maxflow(alive, closed) / nom
shares.append(f)
if f <= 0.5:
low += 1
shares.sort()
mean = math.fsum(shares) / len(shares)
print("%-19s %7d %10.2f %10.2f %10.4f %8.4f"
% (name, nom, wl / nom, ws / nom, mean, low / len(draws)))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 5: Cross-Border Supply Chains: Effective Resistance, Maximum Flow and the Weight of One Port. 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
- Chapter 1 · Algebraic Connectivity: Why a High Degree Is Not Robustness
- Chapter 2 · The Cheeger Constant: How Narrow the Neck Is, Clamped from Both Sides by the Spectrum
- Chapter 3 · Where to Add One Link: Greedy Addition, the Fiedler Score and the Illusion of Quantity
- Chapter 4 · Multi-Agent Workflows: Consensus Speed, the Orchestrating Hub and Single Points of Hand-off
- Chapter 6 · Opposing Evidence and Boundaries: Where the Algebraic Connectivity Misleads
- Chapter 7 · Eastern and Western Sources: the Changshan Snake of Sunzi's "Nine Grounds" and Kirchhoff's Circuit Equations of 1847
- Chapter 8 · The Empirical Loop: a Quarterly Checkup of the Workflow Graph, Link Advice and a Plan for Refutation