What does Ritual, Space and the Self conclude, in numbers, about “From Rumination to the Present: the Triple-Network Model and Salience-Network Switching”?
Answer: Menon's triple-network model is an integrative framework; Sridharan and colleagues inferred from effective-connectivity analysis that the right fronto-insular cortex plays a part in network switching, and Hamilton and colleagues reviewed correlational evidence linking rumination to increased DMN connectivity. The author's Wilson–Cowan-type model shows that, in this model, salient input must exceed a threshold (the \(D\)-dominated state disappears above about 0.312; the slow ramp scan gives 0.324) to switch states, that whether the switch lasts depends on later task drive, and that with noise the input acts by shortening dwell times. "Minimal embodied presence" is not in the model; it is the author's interpretation. The DMN and attention networks discussed in Books 8 and 24 are only recalled.
Scope of the numbers: Marked boxes separate published evidence, runnable Python calculations (16 programs), classical sources and the author's models and hypotheses; apart from cited literature data, all data in the book are synthetic.
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.312, 0.324
| A pulse of salient input I_S between t | 20 and t = 40 (units of tau) |
| I_C 0.1, I_S 0.2: t | 19 D 1.00 C 0.00 t=39 D 1.00 C 0.00 t=79 D 1.00 C 0.00 |
| I_C 0.1, I_S 0.4: t | 19 D 1.00 C 0.00 t=39 D 0.00 C 1.00 t=79 D 1.00 C 0.00 |
| I_C 0.2, I_S 0.2: t | 19 D 1.00 C 0.00 t=39 D 1.00 C 0.00 t=79 D 1.00 C 0.00 |
| I_C 0.2, I_S 0.4: t | 19 D 1.00 C 0.00 t=39 D 0.00 C 1.00 t=79 D 0.00 C 0.97 |
| B slow ramp of I_S (0 | 0.8 -> 0): switching points seen by the scan (they |
| include sweep lag); bisection with long settling gives the state edges | |
| I_C 0.1: ramp D -> C at I_S | 0.324; C -> D at I_S = 0.226 |
| edges: D state lost above I_S | 0.312; C state exists from I_S = 0.241 |
| I_C 0.2: ramp D -> C at I_S | 0.324; C -> D at I_S = never (C persists at I_S = 0) |
| edges: D state lost above I_S | 0.312; C state exists already at I_S = 0 |
| C noise sd 0.22, I_C 0.1: mean time (tau) before the D state is left, 40 runs; | |
| runs stopped at the 300-tau cap make the mean a lower bound | |
| I_S | 0.00: 104.0 lower bound: 4 of 40 runs stopped at the cap |
| I_S | 0.10: 86.1 lower bound: 3 of 40 runs stopped at the cap |
| I_S | 0.20: 55.8 |
| I_S | 0.25: 29.6 |
| I_S | 0.30: 11.3 |
Key formula
Show the full program
# Wilson-Cowan-type rate model of the triple network (Chapter 4). The author's model.
# Three populations: D (default mode), S (salience), C (central executive). Each obeys
# tau dx/dt = -x + F(u_x), F(u) = 1 / (1 + exp(-(u - 0.5) / 0.08))
# u_D = 0.6 D - 0.8 C - 0.8 S + I_D (self-referential drive I_D = 0.4)
# u_C = 0.6 C - 0.8 D + 0.6 S + I_C (task drive I_C)
# u_S = 0.4 S + I_S (salient, multisensory input I_S)
# S inhibits D and excites C, so it can switch the D-C competition (Menon's proposal).
# A: a 20-tau pulse of I_S, starting in the D-dominant state, for two task drives.
# B: a slow ramp of I_S up and down (hysteresis). C: with noise, the mean time before the
# D state is left, against I_S.
import math, random
ID, TAU, DT = 0.4, 1.0, 0.1
def F(u):
return 1 / (1 + math.exp(-(u - 0.5) / 0.08))
def step(x, i_s, ic, rng=None, sig=0.0):
d, s, c = x
ud = 0.6 * d - 0.8 * c - 0.8 * s + ID
uc = 0.6 * c - 0.8 * d + 0.6 * s + ic
us = 0.4 * s + i_s
n = [rng.gauss(0, sig * math.sqrt(DT)) for _ in range(3)] if rng else (0, 0, 0)
return (d + DT / TAU * (F(ud) - d) + n[0], s + DT / TAU * (F(us) - s) + n[1],
c + DT / TAU * (F(uc) - c) + n[2])
def run(amp, ic, t_end=80.0):
x, k, out = (0.9, 0.05, 0.05), 0, {}
while k * DT < t_end:
t = k * DT
x = step(x, amp if 20 <= t < 40 else 0.0, ic); k += 1
out[k] = x
return out
print("A pulse of salient input I_S between t = 20 and t = 40 (units of tau)")
for ic in (0.1, 0.2):
for amp in (0.2, 0.4):
tr = run(amp, ic)
cells = " ".join(f"t={t:2d} D {tr[t * 10][0]:.2f} C {tr[t * 10][2]:.2f}"
for t in (19, 39, 79))
print(f" I_C {ic:.1f}, I_S {amp:.1f}: {cells}")
def ramp(ic):
x, up, down = (0.9, 0.05, 0.05), None, None
for k in range(401):
i_s = 0.8 * k / 400
for _ in range(30):
x = step(x, i_s, ic)
if up is None and x[2] > x[0]:
up = i_s
for k in range(401):
i_s = 0.8 * (1 - k / 400)
for _ in range(30):
x = step(x, i_s, ic)
if down is None and x[0] > x[2]:
down = i_s
return up, down
def survives(x, i_s, ic, which, n=3000): # does the state stay D (0) or C (2)?
for _ in range(n):
x = step(x, i_s, ic)
return x[which] > x[2 - which]
def edge(ic, which, lo=0.0, hi=0.8): # bisection for where a state ends
start = (0.9, 0.05, 0.05) if which == 0 else (0.05, 0.95, 0.95)
if which == 2 and survives(start, lo, ic, 2):
return None # C exists even at I_S = 0
for _ in range(18):
mid = (lo + hi) / 2
ok = survives(start, mid, ic, which)
if (which == 0) == ok:
lo = mid
else:
hi = mid
return (lo + hi) / 2
print("B slow ramp of I_S (0 -> 0.8 -> 0): switching points seen by the scan (they")
print(" include sweep lag); bisection with long settling gives the state edges")
for ic in (0.1, 0.2):
up, down = ramp(ic)
back = f"{down:.3f}" if down is not None else "never (C persists at I_S = 0)"
print(f" I_C {ic:.1f}: ramp D -> C at I_S = {up:.3f}; C -> D at I_S = {back}")
d_end, c_start = edge(ic, 0), edge(ic, 2)
cs = f"from I_S = {c_start:.3f}" if c_start is not None else "already at I_S = 0"
print(f" edges: D state lost above I_S = {d_end:.3f}; C state exists {cs}")
print("C noise sd 0.22, I_C 0.1: mean time (tau) before the D state is left, 40 runs;")
print(" runs stopped at the 300-tau cap make the mean a lower bound")
for i_s in (0.0, 0.1, 0.2, 0.25, 0.3):
rng = random.Random(24); dwell = []
for _ in range(40):
x, k = (0.9, 0.05, 0.05), 0
while x[0] > x[2] and k < 3000:
x = step(x, i_s, 0.1, rng, 0.22); k += 1
dwell.append(k * DT)
cap = sum(1 for d in dwell if d >= 300)
print(f" I_S = {i_s:.2f}: {math.fsum(dwell) / len(dwell):6.1f}"
+ (f" lower bound: {cap} of 40 runs stopped at the cap" if cap else ""))Single source and citation
Fan, Y. (2026). Neurobiology of Ritual, Spatial Boundary Transitions and Computational Biomedicine of Self-Transcendence (Version 1.0.0), Chapter 4: From Rumination to the Present: the Triple-Network Model and Salience-Network Switching. 5D Library. https://doi.org/10.5281/zenodo.23839910
DOI: 10.5281/zenodo.23839910 · Read the monograph · 5DL-B-051 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026051,
author = {Fan, Yafu},
title = {Neurobiology of Ritual, Spatial Boundary Transitions and Computational Biomedicine of Self-Transcendence},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.23839910},
url = {https://doi.org/10.5281/zenodo.23839910}
}Other chapter answers in this book
- Chapter 1 · More Than Superstition, Less Than a Cure-All: Anxiety, Rigid Action and Precision Weighting
- Chapter 2 · Stress Axis, Breathing and Inflammation: Which Parts Are Equations and Which Are Evidence
- Chapter 3 · Walking Through a Door: the Doorway Effect, Event Boundaries and the Maps of the Hippocampus
- Chapter 5 · Expectation and Learning: Open and Hidden Administration, Placebo and Conditioned Immunity
- Chapter 6 · Incense, Sound and Cost: Multisensory Integration, Breathing Rhythms and Costly Signals
- Chapter 8 · Practice and a Pre-Registered Test