What does Turing Patterns and Outpost Spacing conclude, in numbers, about “One-Dimensional Finite Differences: How Even Activity Breaks into Equally Spaced Peaks”?
Answer: The implicit-explicit finite-difference scheme solves diffusion and decay at the next time level, keeps production at the current one and solves the tridiagonal systems with the Thomas algorithm, so that pure Python integrates a 40 km corridor in a second. Program p21 shows that, starting from even activity, the layout passes through linear amplification, nonlinear sharpening and the merging of peaks, and with the default parameters comes to rest at 6 peaks with a mean gap of 7.20 km, while total activity falls from 80.00 to 63.67. Program p22 shows that when cell width and time step vary within a sensible range the number of peaks stays fixed and the spacing moves by less than one per cent, whereas a different draw of initial noise can move the spacing by a tenth. What, then, sets the spacing? And why can the same equations come to rest at different spacings? The next chapter returns to the dispersion relation to answer both questions.
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: 40, 63.67, 7.20, 80.00
| t | peaks | contrast | max a | total activity (a dx) |
|---|---|---|---|---|
| 0 | 0 | 1.010 | 2.01 | 80.00 |
| 10 | 7 | 1.112 | 2.11 | 79.99 |
| 20 | 7 | 8.872 | 3.75 | 75.75 |
| 30 | 6 | 34.673 | 4.38 | 64.18 |
| 40 | 6 | 196.809 | 4.44 | 63.09 |
| 60 | 6 | 121.263 | 4.42 | 63.31 |
| 100 | 6 | 71.495 | 4.39 | 63.49 |
| 200 | 6 | 47.826 | 4.35 | 63.60 |
| 400 | 6 | 44.306 | 4.32 | 63.67 |
| peak positions km: 3.9 11.5 18.9 26.1 33.1 39.9 | ||||
| gaps km: 7.6 7.4 7.2 7.0 6.8 | edge margins 3.9 and 0.1 | |||
| mean gap 7.20 km; onset scale 2 pi sqrt(la lh) = 7.54 km |
Show the full program
# Chapter 2. p21: how evenly spread outposts break into regular peaks.
# Model: Gierer-Meinhardt with mu = 1, nu = 2, la = 0.6 km, lh = 2.4 km
# (reach ratio 4, illustrative) on a 40 km corridor, no-flux ends.
# Scheme: cell width 0.2 km, step 0.05; decay and diffusion implicit
# (Thomas algorithm), production a^2 / h and a^2 explicit. Start from
# the uniform state with 1 per cent seeded noise; print snapshots of
# peak count, contrast and the largest activity, then the final gaps.
import math
import random
MU, NU, LA, LH = 1.0, 2.0, 0.6, 2.4
LENGTH, DX, DT = 40.0, 0.2, 0.05
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 peaks(a):
lo, hi = min(a), max(a)
if hi - lo < 0.01 * hi:
return []
cut, n = lo + 0.5 * (hi - lo), len(a)
return [(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])]
n = int(round(LENGTH / DX))
rng = random.Random(20261113)
a = [2.0 * (1.0 + 0.01 * (rng.random() - 0.5)) for _ 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)
marks = (0, 10, 20, 30, 40, 60, 100, 200, 400)
print(" t peaks contrast max a total activity (a dx)")
step = 0
for t_mark in marks:
while step * DT < t_mark - 1e-9:
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)
step += 1
print("%4d %5d %8.3f %5.2f %8.2f"
% (t_mark, len(peaks(a)), max(a) / min(a), max(a),
DX * math.fsum(a)))
p = peaks(a)
gaps = [p[i + 1] - p[i] for i in range(len(p) - 1)]
print("peak positions km: " + " ".join("%.1f" % x for x in p))
print("gaps km: " + " ".join("%.1f" % g for g in gaps)
+ " edge margins %.1f and %.1f" % (p[0], LENGTH - p[-1]))
print("mean gap %.2f km; onset scale 2 pi sqrt(la lh) = %.2f km"
% (math.fsum(gaps) / len(gaps), 2 * math.pi * math.sqrt(LA * LH)))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 2: One-Dimensional Finite Differences: How Even Activity Breaks into Equally Spaced Peaks. 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 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 6 · Seeding the First Outposts: Too Dense Collapses, Too Sparse Does Not Fill Itself
- 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