What does Turing Patterns and Outpost Spacing conclude, in numbers, about “The Diffusion-Ratio Condition for Regional Dominance: Concentrated Share, Ambient Demand and a Drifting Threshold”?
Answer: Chapter 5 shows that past the threshold the hottest fifth of the corridor holds 0.493 of activity, while existing category demand pushes the threshold up to 6.464 and eventually rules out any pattern.
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: 0.493
| lh/la | total | top20% | Gini | peaks | HHI | eff. count | largest |
| 2.0 | 80.00 | 0.200 | 0.000 | 0 | 1.000 | 1.00 | 1.000 |
| 2.6 | 66.71 | 0.362 | 0.323 | 7 | 0.148 | 6.76 | 0.154 |
| 3.0 | 66.22 | 0.397 | 0.375 | 7 | 0.148 | 6.76 | 0.154 |
| 4.0 | 63.67 | 0.493 | 0.500 | 6 | 0.174 | 5.74 | 0.186 |
| 5.0 | 67.29 | 0.511 | 0.518 | 6 | 0.175 | 5.72 | 0.190 |
| 6.0 | 60.71 | 0.654 | 0.649 | 4 | 0.251 | 3.99 | 0.265 |
| (no peaks: the whole corridor is one uniform catchment) |
Key formula
Show the full program
# Chapter 5. p51: regional dominance as concentration of activity.
# "Dominance" here means only that the brand's activity, and with it
# its local share, is concentrated in a few catchments; no coordination
# between firms is modelled or implied. Model: the corridor of p12
# (40 km, la = 0.6 km, mu = 1, nu = 2, illustrative), run 400 time
# units from the uniform state plus 1 per cent noise, for six reach
# ratios. Read-outs: total activity (uniform state = 80), share held by
# the top 20 per cent of the corridor, Gini coefficient over cells, and
# the Herfindahl-style index of catchment shares (catchments split at
# midpoints between peaks) with its inverse, the effective count.
import math
import random
MU, NU, LA = 1.0, 2.0, 0.6
LENGTH, DX, DT, T_END = 40.0, 0.2, 0.05, 400.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 simulate(lh):
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)
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)
return a
def gini(v):
s = sorted(v)
n = len(s)
w = math.fsum((2 * (i + 1) - n - 1) * x for i, x in enumerate(s))
return w / (n * math.fsum(s))
def catchments(a):
n = len(a)
lo, hi = min(a), max(a)
if hi - lo < 0.01 * hi:
return [1.0]
cut = lo + 0.5 * (hi - lo)
pk = [i 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])]
edges = [0] + [(pk[i] + pk[i + 1]) // 2 + 1
for i in range(len(pk) - 1)] + [n]
tot = math.fsum(a)
return [math.fsum(a[edges[i]:edges[i + 1]]) / tot
for i in range(len(pk))]
print("lh/la total top20% Gini peaks HHI eff. count largest")
for ratio in (2.0, 2.6, 3.0, 4.0, 5.0, 6.0):
a = simulate(ratio * LA)
s = sorted(a, reverse=True)
top = math.fsum(s[:len(s) // 5]) / math.fsum(s)
sh = catchments(a)
hhi = math.fsum(x * x for x in sh)
npk = len(sh) if max(a) > 1.01 * min(a) else 0
print("%5.1f %6.2f %6.3f %5.3f %5d %5.3f %10.2f %7.3f"
% (ratio, DX * math.fsum(a), top, gini(a), npk, hhi,
1.0 / hhi, max(sh)))
print("(no peaks: the whole corridor is one uniform catchment)")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 5: The Diffusion-Ratio Condition for Regional Dominance: Concentrated Share, Ambient Demand and a Drifting Threshold. 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 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