关于「竞争相图:两个站的四种结局与立项命题的修正」,《站群竞争相图》给出的定量结论是什么?

结论:第一章画出两站的四种结局,并说明运营成本占四分之一时,第二个站只有在系数低于 0.600 时才划算。

数据口径:立项命题经核对后修正:系数大于一时,只有被经营者撑住的内部平衡点低于单站,自由竞争的结局是只剩一个站;两个系数之积小于一只是共存的必要条件,示意网格中满足它的格子仍有 0.627 以一方出局告终。 书中站、账号、访客、成本与经营者均为示意;全部计算由书中程序生成;本书是非个人化经营建议,只讨论以真实主体运营、彼此关系公开的合规品牌矩阵,不涉及马甲账号与刷量。

English version

对照数据表

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

aheld T/Kfree T/Kgain heldgain free
0.02.0002.000+1.000+1.000
0.21.6671.667+0.667+0.667
0.41.4291.429+0.429+0.429
0.61.2501.250+0.250+0.250
0.81.1111.111+0.111+0.111
1.01.0001.000+0.000+0.000 neutral
1.20.9091.000-0.091+0.000
1.40.8331.000-0.167+0.000
1.60.7691.000-0.231+0.000
1.80.7141.000-0.286+0.000
2.00.6671.000-0.333+0.000
break-even overlap for a second site that costs c:
c = 0.10->a must stay below 0.818
c = 0.25->a must stay below 0.600
c = 0.50->a must stay below 0.333

核心公式

\[\frac{dN_1}{dt} = r_1 N_1 \left(1 - \frac{N_1 + a_{12} N_2}{K_1}\right), \qquad \frac{dN_2}{dt} = r_2 N_2 \left(1 - \frac{N_2 + a_{21} N_1}{K_2}\right).\]
查看完整验算程序
# Chapter 1. p12: dose-response of matrix traffic to the overlap a.
# Symmetric pair, K1 = K2 = K, a12 = a21 = a (illustrative). If both
# sites are kept alive at the interior point, total traffic is
#   T(a) = 2 K / (1 + a),
# which is below one site alone exactly when a > 1. Free competition
# settles at T(a) for a < 1 and at K (one survivor) for a > 1.
# A second site costs c, expressed as a share of the value of K;
# it pays only if T / K - 1 > c, that is a < (1 - c) / (1 + c).
from fractions import Fraction as Fr

print("   a   held T/K  free T/K  gain held  gain free")
for k in range(0, 11):
    a = Fr(k, 5)
    held = 2 / (1 + a)
    if a < 1:
        free, tag = held, ""
    elif a == 1:
        free, tag = Fr(1), " neutral"
    else:
        free, tag = Fr(1), ""
    print("%4.1f   %7.3f  %8.3f  %+9.3f  %+9.3f%s"
          % (float(a), float(held), float(free), float(held - 1),
             float(free - 1), tag))
print("break-even overlap for a second site that costs c:")
for c in (Fr(1, 10), Fr(1, 4), Fr(1, 2)):
    print("  c = %.2f  ->  a must stay below %.3f"
          % (float(c), float((1 - c) / (1 + c))))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《洛特卡沃尔泰拉竞争相图、多子站多账号矩阵内耗与共生壁垒判定母典》第 1 章「竞争相图:两个站的四种结局与立项命题的修正」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-251 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026251,
  author    = {Fan, Yafu},
  title     = {Lotka-Volterra Competition Phase Portraits: Cannibalisation within Multi-Site, Multi-Account Matrices versus Symbiotic Barriers},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论