What does Spectral Gaps and Bottleneck Cuts conclude, in numbers, about “Multi-Agent Workflows: Consensus Speed, the Orchestrating Hub and Single Points of Hand-off”?
Answer: Once a workflow is drawn as a graph of hand-off channels, the speed of consensus is set jointly by the algebraic connectivity and the maximum degree. Program p41 shows that the chain pipeline is slowest and that the orchestrating hub, despite a respectable algebraic connectivity, is slower than a ring because its tempo is capped by the hub's load; p42 finds two bridges, three cut vertices and the seam between thinking and making in a twelve-agent workflow, and shows that the link suggestion with the largest gain need not remove cut vertices. The next chapter carries the same tools into cross-border supply chains, where links carry not only messages but capacity.
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 only
| plan | links dmax | lambda2 | rho | pred | sim | |
| hub orchestrator | 9 | 9 | 1.0000 | 0.9000 | 66 | 65 |
| chain pipeline | 9 | 2 | 0.0979 | 0.9674 | 209 | 209 |
| two teams, 1 liaison | 21 | 5 | 0.2984 | 0.9503 | 136 | 134 |
| ring | 10 | 2 | 0.3820 | 0.8727 | 51 | 50 |
| ring + 2 chords | 12 | 3 | 0.6972 | 0.8257 | 37 | 33 |
| everyone to everyone | 45 | 9 | 10.0000 | 0.0000 | 1 | 1 |
Show the full program
# Chapter 4. p41: how fast ten agents agree. Linear consensus
# x <- x - eps L x (Olfati-Saber and Murray 2004) on six wiring plans.
# Model: eps = 1 / (dmax + 1) keeps every step stable; the disagreement
# shrinks per round by rho = max(|1 - eps lambda2|, |1 - eps lambda_n|),
# so the rounds needed to cut it a thousandfold are about
# ln(1000) / -ln(rho). Simulation starts from opinions 0 through 9.
# Wiring plans are illustrative, not measured systems.
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 rounds_sim(n, edges, eps, factor=1000.0):
lap = laplacian(n, edges)
x = [float(i) for i in range(n)]
def spread(v):
m = math.fsum(v) / n
return math.sqrt(math.fsum((a - m) ** 2 for a in v))
d0, k = spread(x), 0
while spread(x) > d0 / factor:
lx = [math.fsum(lap[i][j] * x[j] for j in range(n))
for i in range(n)]
x = [x[i] - eps * lx[i] for i in range(n)]
k += 1
return k
n = 10
plans = [
("hub orchestrator", [(0, j) for j in range(1, n)]),
("chain pipeline", [(i, i + 1) for i in range(n - 1)]),
("two teams, 1 liaison",
[(a, b) for a in range(5) for b in range(a + 1, 5)]
+ [(a + 5, b + 5) for a in range(5) for b in range(a + 1, 5)]
+ [(4, 5)]),
("ring", [(i, (i + 1) % n) for i in range(n)]),
("ring + 2 chords", [(i, (i + 1) % n) for i in range(n)]
+ [(0, 5), (2, 7)]),
("everyone to everyone",
[(a, b) for a in range(n) for b in range(a + 1, n)]),
]
print("plan links dmax lambda2 rho pred sim")
for name, es in plans:
deg = [0] * n
for i, j in es:
deg[i] += 1
deg[j] += 1
vals = jacobi(laplacian(n, es))[0]
eps = 1.0 / (max(deg) + 1)
rho = max(abs(1 - eps * vals[1]), abs(1 - eps * vals[-1]))
pred = math.ceil(math.log(1000.0) / -math.log(rho)) if rho > 0 else 1
print("%-21s %5d %4d %7.4f %6.4f %4d %4d"
% (name, len(es), max(deg), vals[1], rho, pred,
rounds_sim(n, es, eps)))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 4: Multi-Agent Workflows: Consensus Speed, the Orchestrating Hub and Single Points of Hand-off. 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 5 · Cross-Border Supply Chains: Effective Resistance, Maximum Flow and the Weight of One Port
- 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