What does Turing Patterns and Outpost Spacing conclude, in numbers, about “Seeding the First Outposts: Too Dense Collapses, Too Sparse Does Not Fill Itself”?
Answer: Chapter 6 places shops in the model as fixed seeds: the layout collapses when the gap shrinks to 4.44 km, and gaps that are too wide do not fill themselves without ambient demand.
Scope of the numbers: The book's reaches, decay rates, city lengths and data are illustrative; every calculation is generated by its programs; it offers general business method, not investment, legal or site-selection advice. Marked boxes separate published evidence, runnable Python calculations (17 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: 4.44
| open | gap km | peaks | survive | total | per outpost | profit F6 | F10 |
| 2 | 20.00 | 2 | 2 | 27.47 | 13.74 | 15.47 | 7.47 |
| 3 | 13.33 | 3 | 3 | 40.61 | 13.54 | 22.61 | 10.61 |
| 4 | 10.00 | 4 | 4 | 51.80 | 12.95 | 27.80 | 11.80 |
| 5 | 8.00 | 5 | 5 | 60.35 | 12.07 | 30.35 | 10.35 |
| 6 | 6.67 | 6 | 6 | 66.58 | 11.10 | 30.58 | 6.58 |
| 7 | 5.71 | 7 | 7 | 71.18 | 10.17 | 29.18 | 1.18 |
| 8 | 5.00 | 8 | 8 | 74.73 | 9.34 | 26.73 | -5.27 |
| 9 | 4.44 | 5 | 5 | 60.34 | 12.07 | 6.34 | -29.66 |
| 10 | 4.00 | 6 | 6 | 66.58 | 11.10 | 6.58 | -33.42 |
| 11 | 3.64 | 5 | 5 | 60.35 | 12.07 | -5.65 | -49.65 |
Show the full program
# Chapter 6. p61: how many first outposts, and what happens when the
# plan is denser than the pattern allows.
# Model: Gierer-Meinhardt as in p21 (la = 0.6 km, lh = 2.4 km, mu = 1,
# nu = 2), 40 km corridor, but the city starts empty: a = 0 except k
# opening bumps (height 4, width 0.6 km) spaced 40 / k apart; h starts
# at the uniform level 2. After 300 time units count surviving
# outposts (a peak within 2 km of an opening), total activity and
# activity per surviving outpost. Profit index = total activity minus
# a fixed cost per opening (6 or 10 activity units): illustrative.
import math
MU, NU, LA, LH = 1.0, 2.0, 0.6, 2.4
LENGTH, DX, DT, T_END = 40.0, 0.2, 0.05, 300.0
def factor(n, r, c):
di = [1.0 + c + 2.0 * r] * n
di[0] = di[-1] = 1.0 + c + r
cp, den = [0.0] * n, [0.0] * n
den[0] = di[0]
cp[0] = -r / den[0]
for i in range(1, n):
den[i] = di[i] + r * cp[i - 1]
cp[i] = -r / den[i]
return cp, den, r
def solve(f, rhs):
cp, den, r = f
n = len(rhs)
y = [0.0] * n
y[0] = rhs[0] / den[0]
for i in range(1, n):
y[i] = (rhs[i] + r * y[i - 1]) / den[i]
for i in range(n - 2, -1, -1):
y[i] -= cp[i] * y[i + 1]
return y
def run_seeded(pos):
n = int(round(LENGTH / DX))
a = [math.fsum(4.0 * math.exp(-(((i + 0.5) * DX - p) / 0.6) ** 2)
for p in pos) for i in range(n)]
h = [2.0] * n
fa = factor(n, DT * MU * LA * LA / DX ** 2, DT * MU)
fh = factor(n, DT * NU * LH * LH / DX ** 2, DT * NU)
for _ in range(int(round(T_END / DT))):
ra = [a[i] + DT * a[i] * a[i] / h[i] for i in range(n)]
rh = [h[i] + DT * a[i] * a[i] for i in range(n)]
a, h = solve(fa, ra), solve(fh, rh)
lo, hi = min(a), max(a)
cut = lo + 0.5 * (hi - lo)
pk = [(i + 0.5) * DX for i in range(n) if a[i] > cut
and (i == 0 or a[i] >= a[i - 1])
and (i == n - 1 or a[i] > a[i + 1])]
return pk, DX * math.fsum(a)
print("open gap km peaks survive total per outpost profit F6 F10")
for k in range(2, 12):
gap = LENGTH / k
pos = [gap / 2 + i * gap for i in range(k)]
pk, tot = run_seeded(pos)
surv = len([p for p in pos if any(abs(p - q) < 2.0 for q in pk)])
print("%4d %6.2f %5d %7d %6.2f %11.2f %9.2f %5.2f"
% (k, gap, len(pk), surv, tot, tot / len(pk), tot - 6 * k,
tot - 10 * k))Single source and citation
Fan, Y. (2026). Turing Reaction-Diffusion Patterns: How the Outposts of a Niche Word-of-Mouth Brand Emerge in a New City, and the Diffusion-Ratio Condition for Regional Dominance (Version 1.0.0), Chapter 6: Seeding the First Outposts: Too Dense Collapses, Too Sparse Does Not Fill Itself. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-247 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026247,
author = {Fan, Yafu},
title = {Turing Reaction-Diffusion Patterns: How the Outposts of a Niche Word-of-Mouth Brand Emerge in a New City, and the Diffusion-Ratio Condition for Regional Dominance},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Why Evenness Breaks: the Turing Condition and the Threshold on the Diffusion Ratio
- Chapter 2 · One-Dimensional Finite Differences: How Even Activity Breaks into Equally Spaced Peaks
- Chapter 3 · The Dispersion Relation and the Characteristic Wavelength: Spacing Set Jointly by Two Reaches
- Chapter 4 · Estimating the Two Reaches from a Shop's Own Records: Referral Distances and Cannibalisation
- Chapter 5 · The Diffusion-Ratio Condition for Regional Dominance: Concentrated Share, Ambient Demand and a Drifting Threshold
- Chapter 7 · Classical Sources East and West: Sunzi on Concentrating and Dividing, and von Thunen's Isolated State
- Chapter 8 · Closing the Empirical Loop: Planning the Spacing of First Outposts in a New City, and a Pre-Registered Test