What does Competition Portraits for Site Matrices conclude, in numbers, about “Stability of Equilibria: Jacobian Eigenvalues, the Advantage of an Early Start, and Critical Slowing Down”?
Answer: Chapter 3 covers Jacobian eigenvalues, the advantage of an early start in the bistable case and critical slowing down; at a coefficient of 0.80 the split of traffic needs about 30.2 quarters to return to equilibrium.
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. standard-library Python onlyprinted values that match the answer: 0.80, 30.2
| a | tau (months) | 5% time (months) | RK4 check | quarters |
| 0.20 | 5.0 | 15.0 | 15.2 | 5.1 |
| 0.50 | 10.0 | 30.0 | 30.3 | 10.1 |
| 0.80 | 30.0 | 89.9 | 90.6 | 30.2 |
| 0.90 | 63.3 | 189.7 | 191.1 | 63.7 |
| 0.95 | 130.0 | 389.4 | 392.2 | 130.7 |
Key formula
Show the full program
# Chapter 3. p33: near a = 1 the matrix takes years to settle.
# Symmetric pair, r = 0.3 per month, K = 10000 (illustrative). At the
# interior point the Jacobian has eigenvalues -r (total traffic) and
# -r (1 - a) / (1 + a) (the split between the two sites),
# so a disturbance of the split decays with time constant
# tau = (1 + a) / (r (1 - a)) months
# and needs tau ln 20 months to shrink to 5 percent. RK4 check: start
# with the split 20 percent off the interior point, count the months
# until it is within 1 percent (that is, 5 percent of the start).
import math
R, K, H = 0.3, 10000.0, 0.1
def rhs(n1, n2, a):
return (R * n1 * (1 - (n1 + a * n2) / K),
R * n2 * (1 - (n2 + a * n1) / K))
def months(a):
s = K / (1 + a)
n1, n2 = 1.2 * s, 0.8 * s
steps = 0
while abs(n1 - n2) / (n1 + n2) > 0.01 and steps < 30000:
k1 = rhs(n1, n2, a)
k2 = rhs(n1 + H / 2 * k1[0], n2 + H / 2 * k1[1], a)
k3 = rhs(n1 + H / 2 * k2[0], n2 + H / 2 * k2[1], a)
k4 = rhs(n1 + H * k3[0], n2 + H * k3[1], a)
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])
steps += 1
return steps * H
print(" a tau (months) 5% time (months) RK4 check quarters")
for a in (0.2, 0.5, 0.8, 0.9, 0.95):
tau = (1 + a) / (R * (1 - a))
m = months(a)
print("%5.2f %12.1f %16.1f %9.1f %8.1f"
% (a, tau, tau * math.log(20), m, m / 3))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 3: Stability of Equilibria: Jacobian Eigenvalues, the Advantage of an Early Start, and Critical Slowing Down. 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 4 · From Two Sites to Many: the Traffic Ceiling, the Best Number of Sites, and Pruning a Five-Site Matrix
- Chapter 5 · Symbiotic Barriers: Disclosed Cross-Referral, Negative Coefficients and the Entry Threshold for Outside Rivals
- 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