关于「共生壁垒:公开互导、负系数与外来竞争者的进入门槛」,《站群竞争相图》给出的定量结论是什么?

结论:系数可以为负:公开的互导使一个站的访客增长反而带动另一个站。程序 p51 说明,在共生情形里两个系数之积小于一正是总流量有界的条件,立项命题里的乘积条件在这里找到了准确的位置;同时线性模型在负系数稍大时会夸大到荒唐,乘积 0.81 时总流量已是 20.000 倍,所以只宜在负系数绝对值不大时使用。程序 p52 说明,进入门槛与矩阵留住的总流量成正比,两个共生站的门槛 12500 高于四个竞争站的 10526。系数的正负与大小都靠测量,而前面几章一直假定系数已知。下一章面对最难的问题:只有几年的月度流量,系数到底能不能读出来?

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

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 与结论吻合的打印值: 0.81, 12500, 20.000

a12a21a12*a21modeN1N2T/K
0.30.30.09competition769276921.538
-0.2-0.20.04symbiosis12500125002.500
-0.5-0.50.25symbiosis20000200004.000
-0.5-1.50.75symbiosis6000010000016.000
-0.9-0.90.81symbiosis10000010000020.000
-1.0-1.21.20symbiosisunbounded by month 15.2
0.6-0.4-0.24pred-prey3226112901.452

核心公式

\[K_E > b\,T .\]
查看完整验算程序
# Chapter 5. p51: when one site feeds the other, the signs flip.
# Same equations as p11, K1 = K2 = 10000, r = 0.3 per month; a
# negative a_ij means site j sends site i more visitors than it takes
# (disclosed cross-links, one brand, shared newsletter). Pairs of
# signs follow Pistorius and Utterback (1997): both positive is pure
# competition, both negative is symbiosis, mixed signs is the
# predator-prey mode. RK4 for 600 months from 1000 visitors each;
# "unbounded" if a site passes 100 K, which the model cannot describe.
R, K, H = 0.3, 10000.0, 0.1
PAIRS = ((0.3, 0.3), (-0.2, -0.2), (-0.5, -0.5), (-0.5, -1.5),
         (-0.9, -0.9), (-1.0, -1.2), (0.6, -0.4))


def rhs(n1, n2, a12, a21):
    return (R * n1 * (1 - (n1 + a12 * n2) / K),
            R * n2 * (1 - (n2 + a21 * n1) / K))


def run(a12, a21):
    n1 = n2 = 1000.0
    for step in range(6000):
        k1 = rhs(n1, n2, a12, a21)
        k2 = rhs(n1 + H / 2 * k1[0], n2 + H / 2 * k1[1], a12, a21)
        k3 = rhs(n1 + H / 2 * k2[0], n2 + H / 2 * k2[1], a12, a21)
        k4 = rhs(n1 + H * k3[0], n2 + H * k3[1], a12, a21)
        n1 += H / 6 * (k1[0] + 2 * k2[0] + 2 * k3[0] + k4[0])
        n2 += H / 6 * (k1[1] + 2 * k2[1] + 2 * k3[1] + k4[1])
        if n1 > 100 * K or n2 > 100 * K:
            return None, (step + 1) * H
    return (n1, n2), 600.0


print("  a12   a21  a12*a21  mode         N1       N2     T/K")
for a12, a21 in PAIRS:
    if a12 > 0 and a21 > 0:
        mode = "competition"
    elif a12 < 0 and a21 < 0:
        mode = "symbiosis"
    else:
        mode = "pred-prey"
    res, t = run(a12, a21)
    if res is None:
        print("%5.1f %5.1f  %7.2f  %-11s  unbounded by month %.1f"
              % (a12, a21, a12 * a21, mode, t))
    else:
        print("%5.1f %5.1f  %7.2f  %-11s %7.0f  %7.0f  %6.3f"
              % (a12, a21, a12 * a21, mode, res[0], res[1],
                 (res[0] + res[1]) / K))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《洛特卡沃尔泰拉竞争相图、多子站多账号矩阵内耗与共生壁垒判定母典》第 5 章「共生壁垒:公开互导、负系数与外来竞争者的进入门槛」(版本 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}
}

本书其他章节结论