关于「首批据点的播种:过密会塌缩,过疏不会自补」,《图灵斑图与据点间距》给出的定量结论是什么?

结论:第六章把门店作为固定种子放进模型:间距缩到 4.44 公里时格局塌缩,过疏的空档在没有环境需求时不会自补。

数据口径:书中半径、衰减率、城市长度与数据均为示意;全部计算由书中程序生成;本书属非个人化经营方法,不构成投资、法律或选址决策建议。 书中以标注框区分已发表的证据、可运行的 Python 计算(17 段程序)、原典与作者的假说。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 4.44

opengap kmpeakssurvivetotalper outpostprofit F6F10
220.002227.4713.7415.477.47
313.333340.6113.5422.6110.61
410.004451.8012.9527.8011.80
58.005560.3512.0730.3510.35
66.676666.5811.1030.586.58
75.717771.1810.1729.181.18
85.008874.739.3426.73-5.27
94.445560.3412.076.34-29.66
104.006666.5811.106.58-33.42
113.645560.3512.07-5.65-49.65
查看完整验算程序
# 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))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《图灵反应扩散斑图、小众口碑品牌陌生城市据点涌现与区域垄断扩散比条件母典》第 6 章「首批据点的播种:过密会塌缩,过疏不会自补」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 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}
}

本书其他章节结论