关于「受众重叠估竞争系数:重叠公式、切走核心人群的子站与季度样本量」,《站群竞争相图》给出的定量结论是什么?
结论:第二章用麦克阿瑟与莱文斯的重叠公式从受众画像估系数,说明切走主站核心人群的子站会让主站感受到 1.230 的压力而自己仍被挤出。
数据口径:立项命题经核对后修正:系数大于一时,只有被经营者撑住的内部平衡点低于单站,自由竞争的结局是只剩一个站;两个系数之积小于一只是共存的必要条件,示意网格中满足它的格子仍有 0.627 以一方出局告终。 书中站、账号、访客、成本与经营者均为示意;全部计算由书中程序生成;本书是非个人化经营建议,只讨论以真实主体运营、彼此关系公开的合规品牌矩阵,不涉及马甲账号与刷量。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 1.230
| a_ij (row i feels column j) | |
| A B C D | |
| A | 1.000 1.230 0.577 1.010 |
| B | 0.575 1.000 0.056 0.595 |
| C | 0.425 0.087 1.000 0.412 |
| D | 0.987 1.245 0.548 1.000 |
| pair a_ij a_ji Pianka K_i/K_j verdict | |
| A-B | 1.230 0.575 0.841 2.400 A excludes B |
| A-C | 0.577 0.425 0.495 2.000 coexist |
| A-D | 1.010 0.987 0.998 1.500 A excludes D |
| B-C | 0.056 0.087 0.070 0.833 coexist |
| B-D | 0.595 1.245 0.861 0.625 coexist |
| C-D | 0.412 0.548 0.475 0.750 coexist |
核心公式
\[a_{ij} = \frac{\sum_k p_{ik}\, p_{jk}}{\sum_k p_{ik}^2} .\]
查看完整验算程序
# Chapter 2. p21: competition coefficients from audience overlap.
# MacArthur and Levins (1967): with p_ik the share of site i's audience
# that sits in segment k (a keyword cluster, a topic, a buyer type),
# a_ij = sum_k p_ik p_jk / sum_k p_ik^2 (pressure of j on i),
# and Pianka's (1973) symmetric index
# O_ij = sum_k p_ik p_jk / sqrt(sum p_ik^2 sum p_jk^2).
# Four illustrative sites over eight segments (percent of audience):
# A broad main site, B a narrow sub-site inside A's top segments,
# C a site aimed at A's thin tail, D a near copy of A.
# Pairwise verdict with illustrative capacities K (visitors a month):
# coexist iff a_ij < K_i / K_j and a_ji < K_j / K_i.
import math
P = {"A": (20, 18, 16, 14, 12, 10, 6, 4),
"B": (40, 35, 15, 10, 0, 0, 0, 0),
"C": (0, 0, 5, 10, 15, 20, 25, 25),
"D": (22, 18, 15, 14, 12, 9, 6, 4)}
K = {"A": 12000, "B": 5000, "C": 6000, "D": 8000}
NAMES = ("A", "B", "C", "D")
def dot(u, v):
return math.fsum(x * y for x, y in zip(u, v))
def alpha(i, j):
return dot(P[i], P[j]) / dot(P[i], P[i])
def pianka(i, j):
return dot(P[i], P[j]) / math.sqrt(dot(P[i], P[i]) * dot(P[j], P[j]))
print("a_ij (row i feels column j)")
print(" " + "".join("%8s" % n for n in NAMES))
for i in NAMES:
print(" %s " % i + "".join("%8.3f" % alpha(i, j) for j in NAMES))
print("pair a_ij a_ji Pianka K_i/K_j verdict")
for x in range(4):
for y in range(x + 1, 4):
i, j = NAMES[x], NAMES[y]
aij, aji = alpha(i, j), alpha(j, i)
q = K[i] / K[j]
hold_i, hold_j = aji > 1 / q, aij > q
if hold_i and hold_j:
v = "bistable"
elif hold_i:
v = i + " excludes " + j
elif hold_j:
v = j + " excludes " + i
else:
v = "coexist"
print(" %s-%s %5.3f %5.3f %6.3f %7.3f %s"
% (i, j, aij, aji, pianka(i, j), q, v))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《洛特卡沃尔泰拉竞争相图、多子站多账号矩阵内耗与共生壁垒判定母典》第 2 章「受众重叠估竞争系数:重叠公式、切走核心人群的子站与季度样本量」(版本 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}
}