What does Five-Node Networks and Solar Ephemeris conclude, in numbers, about “The Limit Cycle: Travelling Wave, Drifting Period and Amplitude Envelope”?
Answer: Chapter 3 shows the limit cycle to be a wave travelling in the direction of generation, whose amplitude envelope does not depend on the start in a dissipative ring (0.3149) and is set by the initial weights only in the zero-sum ring.
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.3149
A. period and travelling wave
mu_c - mu simulated period linear 2*pi*5/|Im l1|
0.01 49.60 47.81
0.05 56.91 47.81
0.20 84.52 47.81
peak order (mu_c - mu = 0.2): nodes [0, 1, 2, 3, 4]
successive lags as fractions of the period: [0.201, 0.2, 0.2, 0.2, 0.2]
B. range of x over the cycle, by starting weights
start dissipative (mu_c - 0.05) zero-sum ring
near uniform 0.3149 0.0200
lopsided 0.3149 0.3198
one dominant 0.3149 0.7607
Reading: the cycle is a travelling wave - each node peaks a
fifth of a period after the last - with a period the linear
spectrum predicts near threshold and that drifts away from it
further out. With dissipation every start ends on the same
envelope; in the zero-sum ring the starting weights fix the
envelope for ever.Show the full program
# Chapter 3. p06: Period, travelling wave and envelope of the ring's cycle.
# Same replicator ring as p05 (c1 = 1, c2 = 0.5, mu_c = 0.7135), RK4 in
# log coordinates, step 0.05.
# A. Period from upward crossings of x_0 through its mean, against the
# linear prediction 2 pi 5 / |Im lambda_1| at the same mu, and the
# order and spacing of the five nodes' peaks.
# B. Envelope: the range of x over the cycle from different starting
# weights, including lopsided ones, for the dissipative ring (mu < mu_c)
# and for the zero-sum (antisymmetric) ring of p05.
import cmath
import math
W = cmath.exp(2j * math.pi / 5)
C1, C2 = 1.0, 0.5
MUC = C1 * math.cos(math.radians(72)) + C2 * math.cos(math.radians(36))
def soft(u):
m = max(u)
e = [math.exp(a - m) for a in u]
s = sum(e)
return [a / s for a in e]
def ring(mu, anti=False):
a = [[0.0] * 5 for _ in range(5)]
for i in range(5):
a[i][(i - 1) % 5] += C1
a[i][(i - 2) % 5] -= C2
a[i][i] -= mu
if anti:
a[i][(i + 1) % 5] -= C1
a[i][(i + 2) % 5] += C2
return a
def step(u, a, h):
def f(v):
x = soft(v)
ax = [sum(a[i][j] * x[j] for j in range(5)) for i in range(5)]
m = sum(p * q for p, q in zip(ax, x))
return [w - m for w in ax]
k1 = f(u)
k2 = f([p + h / 2 * q for p, q in zip(u, k1)])
k3 = f([p + h / 2 * q for p, q in zip(u, k2)])
k4 = f([p + h * q for p, q in zip(u, k3)])
return [p + h / 6 * (q + 2 * r + 2 * s + t)
for p, q, r, s, t in zip(u, k1, k2, k3, k4)]
def trace(a, x0, burn, look, h=0.05):
u = [math.log(v) for v in x0]
for _ in range(int(burn / h)):
u = step(u, a, h)
out = []
for n in range(int(look / h)):
u = step(u, a, h)
out.append((n * h, soft(u)))
return out
if __name__ == "__main__":
print("A. period and travelling wave")
print(" mu_c - mu simulated period linear 2*pi*5/|Im l1|")
for d in (0.01, 0.05, 0.2):
mu = MUC - d
tr = trace(ring(mu), [0.2 + 0.01 * (i == 0) for i in range(5)],
3000, 600)
mean = sum(x[0] for _, x in tr) / len(tr)
ups = [t for (t, x), (_, y) in zip(tr, tr[1:])
if x[0] < mean <= y[0]]
per = (ups[-1] - ups[0]) / (len(ups) - 1)
lin = 2 * math.pi * 5 / abs((C1 * W ** -1 - C2 * W ** -2 - mu).imag)
print(" {:8.2f} {:8.2f} {:8.2f}".format(
d, per, lin))
first = []
for i in range(5):
seg = [(t, x[i]) for t, x in tr if ups[0] <= t < ups[0] + per]
first.append(max(seg, key=lambda r: r[1])[0])
order = sorted(range(5), key=lambda i: first[i])
lags = [(first[order[(k + 1) % 5]] - first[order[k]]) % per / per
for k in range(5)]
print(" peak order (mu_c - mu = 0.2): nodes {}".format(order))
print(" successive lags as fractions of the period: {}".format(
[round(v, 3) for v in lags]))
print("\nB. range of x over the cycle, by starting weights")
starts = (("near uniform", [0.21, 0.2, 0.2, 0.2, 0.19]),
("lopsided", [0.4, 0.1, 0.2, 0.2, 0.1]),
("one dominant", [0.8, 0.05, 0.05, 0.05, 0.05]))
print(" start dissipative (mu_c - 0.05) zero-sum ring")
for name, x0 in starts:
r1 = trace(ring(MUC - 0.05), x0, 3000, 300)
r2 = trace(ring(0.0, True), x0, 0, 300)
g1 = max(max(x) - min(x) for _, x in r1)
g2 = max(max(x) - min(x) for _, x in r2)
print(" {:<14} {:7.4f} {:7.4f}".format(
name, g1, g2))
print("\nReading: the cycle is a travelling wave - each node peaks a")
print("fifth of a period after the last - with a period the linear")
print("spectrum predicts near threshold and that drifts away from it")
print("further out. With dissipation every start ends on the same")
print("envelope; in the zero-sum ring the starting weights fix the")
print("envelope for ever.")Single source and citation
Fan, Y. (2026). Five-Node Cyclic Network Dynamics, Solar-Longitude Ephemeris and Multi-Scale Oscillator Perturbations (Version 1.0.0), Chapter 3: The Limit Cycle: Travelling Wave, Drifting Period and Amplitude Envelope. 5D Library. https://doi.org/10.5281/zenodo.24090168
DOI: 10.5281/zenodo.24090168 · Read the monograph · 5DL-B-060 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026060,
author = {Fan, Yafu},
title = {Five-Node Cyclic Network Dynamics, Solar-Longitude Ephemeris and Multi-Scale Oscillator Perturbations},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.24090168},
url = {https://doi.org/10.5281/zenodo.24090168}
}Other chapter answers in this book
- Chapter 1 · Kepler's Equation and the Equation of Time: Clock Time, Solar Time and the Dates of the Solar Terms
- Chapter 2 · The Five-Node Cyclic Digraph: Circulant Spectrum, Hopf Bifurcation and the Log-Sum
- Chapter 4 · Two-Scale Forcing: Resonant Gain, Peaks and Troughs, and the Jacobian's Condition Number
- Chapter 5 · A Finite Record: Identifiability, the Golden-Ratio Direction and Forecasting the Dates of Extremes
- Chapter 6 · Mean and True Solar Terms, Unequal-Interval Interpolation and the Drift of Calendar Constants
- Chapter 7 · "Fifteen Days Make One Node": the Huainanzi's Counting Rule and the Long Coexistence of Mean and True Terms
- Chapter 8 · Four Questions and Two Software-Only Pre-Registered Tests