What does Concurrent Coupling and Blackboard Reuse conclude, in numbers, about “Coupling Topology and Search: Isolation, Ring, Small World and Full Connection on NK Landscapes”?
Answer: Chapter 5 compares four topologies on NK landscapes: full connection starts fastest, but by round 80 the ring reaches 0.9280 against 0.9150; semi-isolated subgroups peak at 0.9259 with moderate cross-group links.
Scope of the numbers: Parameters are illustrative, data are synthetic, and every figure is generated by the book's programs; the book is not individual business advice and promises no speed-up. Chapter 1 shows where the peak comes from, near 6.78 windows under illustrative parameters.
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.9150, 0.9259, 0.9280, 80
| A. mean agent score / global best, 60 landscapes | ||||
| round | isolated | ring | small | full |
| 2 | 0.7065 | 0.7787 | 0.7864 | 0.8435 |
| 5 | 0.7605 | 0.8588 | 0.8707 | 0.9003 |
| 10 | 0.8060 | 0.9131 | 0.9203 | 0.9132 |
| 20 | 0.8488 | 0.9277 | 0.9259 | 0.9150 |
| 40 | 0.8751 | 0.9280 | 0.9259 | 0.9150 |
| 80 | 0.8856 | 0.9280 | 0.9259 | 0.9150 |
Show the full program
# Chapter 5. p51: search on NK landscapes over four network topologies.
# NK model (Kauffman and Levin 1987): N = 12 bits, each bit's payoff
# depends on itself and K = 5 other bits, payoffs uniform on [0, 1];
# score = mean payoff / best possible score (all 4096 states scored).
# 16 agents start at random states. Each round, in step: if a
# neighbour scores higher, copy the best neighbour; else flip one
# random bit and keep it if better (the Lazer-Friedman rule).
# Topologies: isolated, ring, small world (ring + 3 random chords),
# full. 60 landscapes; mean agent score at several rounds.
import math
import random
NB, KK, AGENTS, LANDS = 12, 5, 16, 60
CHECK = (2, 5, 10, 20, 40, 80)
def landscape(rng):
deps = []
for i in range(NB):
others = [j for j in range(NB) if j != i]
rng.shuffle(others)
deps.append([i] + sorted(others[:KK]))
tables = [[rng.random() for _ in range(2 ** (KK + 1))]
for _ in range(NB)]
score = []
for s in range(2 ** NB):
parts = []
for i in range(NB):
idx = 0
for j in deps[i]:
idx = idx * 2 + ((s >> j) & 1)
parts.append(tables[i][idx])
score.append(math.fsum(parts) / NB)
top = max(score)
return [v / top for v in score]
def graph(kind, rng):
nb = {i: set() for i in range(AGENTS)}
if kind in ("ring", "small"):
for i in range(AGENTS):
nb[i].add((i + 1) % AGENTS)
nb[(i + 1) % AGENTS].add(i)
if kind == "small":
added = 0
while added < 3:
a, b = rng.randrange(AGENTS), rng.randrange(AGENTS)
if a != b and b not in nb[a]:
nb[a].add(b)
nb[b].add(a)
added += 1
if kind == "full":
for i in range(AGENTS):
nb[i] = set(range(AGENTS)) - {i}
return {i: sorted(nb[i]) for i in nb}
def run(score, nb, rng):
pos = [rng.randrange(2 ** NB) for _ in range(AGENTS)]
out = {}
for t in range(1, CHECK[-1] + 1):
new = []
for i in range(AGENTS):
best = max(nb[i], key=lambda j: score[pos[j]], default=None)
if best is not None and score[pos[best]] > score[pos[i]]:
new.append(pos[best])
else:
trial = pos[i] ^ (1 << rng.randrange(NB))
new.append(trial if score[trial] > score[pos[i]]
else pos[i])
pos = new
if t in CHECK:
out[t] = math.fsum(score[p] for p in pos) / AGENTS
return out
if __name__ == "__main__":
rng = random.Random(41151)
kinds = ("isolated", "ring", "small", "full")
acc = {k: {t: [] for t in CHECK} for k in kinds}
for _ in range(LANDS):
score = landscape(rng)
for k in kinds:
res = run(score, graph(k, rng), rng)
for t in CHECK:
acc[k][t].append(res[t])
print("A. mean agent score / global best, {} landscapes".format(
LANDS))
print(" round " + "".join("{:>9}".format(k) for k in kinds))
for t in CHECK:
print(" {:>5} ".format(t) + "".join(
"{:>9.4f}".format(math.fsum(acc[k][t]) / LANDS)
for k in kinds))Single source and citation
Fan, Y. (2026). Topological Coupling of Concurrent Multi-Core Operations: Lock-Free Blackboard Signalling and Cross-Node Emergent Gains (Version 1.0.0), Chapter 5: Coupling Topology and Search: Isolation, Ring, Small World and Full Connection on NK Landscapes. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-411 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026411,
author = {Fan, Yafu},
title = {Topological Coupling of Concurrent Multi-Core Operations: Lock-Free Blackboard Signalling and Cross-Node Emergent Gains},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Serial Fraction and Coherence Overhead: Why Throughput Has a Peak
- Chapter 2 · Fitting σ and κ from Throughput Records: Least Squares, Bootstrap Intervals and Design
- Chapter 3 · Exclusive-Create Locks: Conflict Rates, the Cost of Moving On, and Lost Updates
- Chapter 4 · The Append-Only Blackboard: Lock-Free Reads, Hash De-duplication and the Cost of Subscribing
- Chapter 6 · Emergence as Measurable Reuse: Hypergraph Incidence and the Net Gain of Coupling
- Chapter 7 · Eastern and Western Sources Examined: Sunzi on Division, the Analects on Harmony, Windowless Monads and Smith's Division of Labour
- Chapter 8 · Field Tools and Checker Specifications: the Concurrency Ledger, Four-Kit Clauses and a Pre-Registered Test