What does Discrete Cyclical Networks and Occupancy Entropy conclude, in numbers, about “The Zero-Thrust State and Felt Resistance: The Weber–Fechner Law, Adaptation Level and Habituation (Analogy and Hypothesis)”?
Answer: The Weber–Fechner law by itself says only that sensation is related to the logarithm of the stimulus and gives no "negative sensation" below threshold, so it does not imply that the zero-thrust state brings felt resistance. Helson's adaptation level and the reference point of prospect theory supply the missing mechanism: feeling depends on the gap between a stimulus and the recent level. Research on habituation shows that responses to repeated stimuli weaken and recover when the stimulus stops. Written as an illustrative model, Wave-Rider gives higher mean excitation than Fixed-Mode (1.59 against 1.17) yet a lower mean feeling (−0.595 against −0.023), with about 44 % of steps at "strong resistance"; but the result comes mainly from the concavity of the logarithm and an arbitrary floor, and raising the floor from 0.1 to 1.0 moves the mean feeling from −0.937 to −0.215. The next chapter discusses the author's four cross-domain applications and asks what is missing before a formal resemblance becomes a testable hypothesis.
Scope of the numbers: The book presents mathematical models for teaching and research; it is not investment, trading, tax or legal advice. Marked boxes separate published evidence, runnable Python calculations (17 programs, all checked), classical sources and the author's hypotheses.
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: 1.17, 1.59
| regime lam mean F SD F P(F | 0) mean psi P(psi < -1) mean psi | F=0 |
| fixed | 0.05 1.17 0.37 0.000 -0.026 0.000 - |
| fixed | 0.20 1.16 0.37 0.000 -0.023 0.000 - |
| fixed | 0.50 1.17 0.37 0.000 -0.017 0.000 - |
| wave | 0.05 1.59 1.81 0.431 -0.638 0.436 -1.98 |
| wave | 0.20 1.58 1.81 0.434 -0.595 0.438 -1.94 |
| wave | 0.50 1.59 1.81 0.430 -0.464 0.389 -1.80 |
| time course, lam 0.2: run of 2s, steps 6, 10, 20 -> +0.59, +0.20, +0.02 | |
| zeros, steps 21, 25, 30 | -2.18, -1.44, -0.72 | back to 1, step 31 -> +1.00 |
| wave, lam 0.2, floor e | 0.10: mean psi -0.937, P(psi < -1) 0.446 |
| wave, lam 0.2, floor e | 0.25: mean psi -0.595, P(psi < -1) 0.435 |
| wave, lam 0.2, floor e | 1.00: mean psi -0.215, P(psi < -1) 0.172 |
Key formula
Show the full program
# Chapter 4 ANALOGY as a model (illustrative parameters): one node feels its excitation F
# as psi = ln((F + e) / (A + e)) against an adaptation level A <- A + lam (F - A).
# fixed: ten 1s and two 2s placed at random; wave: 14 particles into 4 random cells.
import math, random
N, K, C, E = 14, 12, 0.5, 0.25
def node_excitation(n, i=0):
return n[i] if n[i] else C * n[(i + 6) % K]
def fixed_state(rng):
n = [1] * K
for j in rng.sample(range(K), 2): n[j] = 2
return n
def wave_state(rng):
cells = rng.sample(range(K), 4); n = [0] * K
for _ in range(N): n[rng.choice(cells)] += 1
return n
def run(make, lam, steps, rng, e=E):
fs = [node_excitation(make(rng)) for _ in range(steps)]
a = sum(fs) / len(fs); psis = []
for f in fs:
psis.append(math.log((f + e) / (a + e))); a += lam * (f - a)
return fs, psis
if __name__ == "__main__":
rng = random.Random(1860)
print("regime lam mean F SD F P(F=0) mean psi P(psi < -1) mean psi | F=0")
for name, make in (("fixed", fixed_state), ("wave", wave_state)):
for lam in (0.05, 0.2, 0.5):
fs, ps = run(make, lam, 20000, rng)
mf = sum(fs) / len(fs)
sd = math.sqrt(sum((f - mf) ** 2 for f in fs) / len(fs))
zero = [p for f, p in zip(fs, ps) if f == 0]
mz = f"{sum(zero) / len(zero):+.2f}" if zero else " -"
neg = sum(p < -1 for p in ps) / len(ps)
print(f"{name:6s} {lam:.2f} {mf:5.2f} {sd:5.2f} {len(zero) / len(fs):.3f}"
f" {sum(ps) / len(ps):+.3f} {neg:.3f} {mz}")
# Habituation-like time course: baseline 1, then a run of 2s, then withdrawal to 0.
lam, a = 0.2, 1.0; course = [1] * 5 + [2] * 15 + [0] * 10 + [1] * 10; out = []
for f in course:
out.append(math.log((f + E) / (a + E))); a += lam * (f - a)
print("time course, lam 0.2: run of 2s, steps 6, 10, 20 ->",
", ".join(f"{out[t - 1]:+.2f}" for t in (6, 10, 20)))
print(" zeros, steps 21, 25, 30 ->",
", ".join(f"{out[t - 1]:+.2f}" for t in (21, 25, 30)),
"| back to 1, step 31 ->", f"{out[30]:+.2f}")
# The floor e (an arbitrary "threshold") drives much of the result for F = 0.
for e in (0.1, 0.25, 1.0):
fs, ps = run(wave_state, 0.2, 20000, rng, e)
print(f"wave, lam 0.2, floor e = {e:4.2f}: mean psi {sum(ps) / len(ps):+.3f},"
f" P(psi < -1) {sum(p < -1 for p in ps) / len(ps):.3f}")Single source and citation
Fan, Y. (2026). Two-Scale Renormalization, Occupancy Entropy and Thrust-Wave Superposition in Discrete Cyclical Networks (Version 1.0.0), Chapter 4: The Zero-Thrust State and Felt Resistance: The Weber–Fechner Law, Adaptation Level and Habituation (Analogy and Hypothesis). 5D Library. https://doi.org/10.5281/zenodo.23796761
DOI: 10.5281/zenodo.23796761 · Read the monograph · 5DL-B-037 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026037,
author = {Fan, Yafu},
title = {Two-Scale Renormalization, Occupancy Entropy and Thrust-Wave Superposition in Discrete Cyclical Networks},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.23796761},
url = {https://doi.org/10.5281/zenodo.23796761}
}Other chapter answers in this book
- Chapter 1 · The Mod-12 Ring Lattice and the Five-Tigers Map: Two-to-One, the Chinese Remainder Theorem and Block Maps
- Chapter 2 · Shannon Entropy and Peak of an Occupancy Distribution: The Entropy–Peak Bound Theorem
- Chapter 3 · The Four-State Excitation Map, Antipodal Half-Wave Coupling and the Decomposition of Thrust
- Chapter 5 · Cross-Domain "Structural Isomorphism" Hypotheses: Sector Rotation, Flexible Vacancies, Twelve-Tone Equal Temperament and Periodic Staking
- Chapter 6 · Cleaning Out Counterexamples and Spurious Correlations: The Barnum Effect, Multiple Testing and Data Snooping
- Chapter 8 · Practice and a Pre-Registered Test: A Four-Step Checklist and a Blind Permutation Backtest