What does Competition Portraits for Site Matrices conclude, in numbers, about “Symbiotic Barriers: Disclosed Cross-Referral, Negative Coefficients and the Entry Threshold for Outside Rivals”?
Answer: Coefficients can be negative: disclosed cross-referral can make one site's growth lift another. Program p51 shows that in the symbiotic case a product of coefficients below one is exactly the condition for bounded traffic, so the product rule of the founding claim finds its proper place here; it also shows that the linear model exaggerates to absurdity once negative coefficients grow, reaching 20.000 times one site at a product of 0.81, so it should be used only when they are small. Program p52 shows that the entry threshold is proportional to the total traffic the matrix keeps, and that a symbiotic pair's threshold of 12500 exceeds the 10526 of four competing sites. Sign and size both have to be measured, yet the chapters so far have taken the coefficients as known. The next chapter faces the hardest question: with only a few years of monthly traffic, can the coefficients be read at all?
Scope of the numbers: Sites, accounts, visitors, costs and owners are illustrative, and all calculations are generated by the book's programs. It is not individual business advice and covers only compliant brand matrices run under a real identity with public links between sites, never sockpuppet accounts or bought traffic.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. printed values that match the answer: 0.81, 12500, 20.000
| a12 | a21 | a12*a21 | mode | N1 | N2 | T/K |
| 0.3 | 0.3 | 0.09 | competition | 7692 | 7692 | 1.538 |
| -0.2 | -0.2 | 0.04 | symbiosis | 12500 | 12500 | 2.500 |
| -0.5 | -0.5 | 0.25 | symbiosis | 20000 | 20000 | 4.000 |
| -0.5 | -1.5 | 0.75 | symbiosis | 60000 | 100000 | 16.000 |
| -0.9 | -0.9 | 0.81 | symbiosis | 100000 | 100000 | 20.000 |
| -1.0 | -1.2 | 1.20 | symbiosis | unbounded by month 15.2 | ||
| 0.6 | -0.4 | -0.24 | pred-prey | 3226 | 11290 | 1.452 |
Key formula
Show the full program
# 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))Single source and citation
Fan, Y. (2026). Lotka-Volterra Competition Phase Portraits: Cannibalisation within Multi-Site, Multi-Account Matrices versus Symbiotic Barriers (Version 1.0.0), Chapter 5: Symbiotic Barriers: Disclosed Cross-Referral, Negative Coefficients and the Entry Threshold for Outside Rivals. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 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}
}Other chapter answers in this book
- Chapter 1 · The Competition Portrait: Four Outcomes for Two Sites and a Corrected Founding Claim
- Chapter 2 · Competition Coefficients from Audience Overlap: the Overlap Formula, Sub-Sites Cut from the Core, and Quarterly Sample Sizes
- Chapter 3 · Stability of Equilibria: Jacobian Eigenvalues, the Advantage of an Early Start, and Critical Slowing Down
- Chapter 4 · From Two Sites to Many: the Traffic Ceiling, the Best Number of Sites, and Pruning a Five-Site Matrix
- Chapter 6 · Reading Coefficients from Traffic Series: Shared Swings, Pause Tests and the Accuracy of Pairwise Verdicts
- Chapter 7 · Classical Sources East and West: the Stranded Fish of the Zhuangzi and Darwin's Struggle for Existence
- Chapter 8 · Closing the Loop: a Quarterly Audit of Audience Overlap, Merge and Split Decisions, and a Falsification Protocol