关于「从反刍到当下:三网络模型与突显网络的切换」,《仪式神经学与空间切换》给出的定量结论是什么?
结论:梅农的三网络模型是一个整合性的框架;斯里达兰等人从有效连接分析推断右侧额—岛叶在网络切换中起作用,汉密尔顿等人综述了反刍与 DMN 连接增强的相关证据。作者的威尔逊—考恩型模型显示,在本模型中突显输入需要超过门槛(\(D\) 主导态在 \(I_S\) 超过约 0.312 时消失;慢斜坡扫描测得 0.324)才能切换状态,切换能否保持取决于之后的任务驱动,噪声使输入的作用表现为缩短停留时间。「最小具身在场」不在模型之中,是作者的解释。第 8 本与第 24 本讨论过的 DMN 与注意网络只作回顾。
数据口径:仪式能不能降低焦虑?走过一道门能不能「清空」压力?慢呼吸能不能经迷走神经修复内分泌与免疫?本书是教学与研究用的数学模型与文献评述,不是医疗建议,书中的练习都不是疾病的治疗方案,任何症状都应先由医生评估。 书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的模型和假说;书中数据除注明的文献数据外均为合成数据。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 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 |
核心公式
\[\tau\frac{dx}{dt} = -x + F(u_x), \qquad F(u) = \frac{1}{1 + e^{-(u-0.5)/0.08}},\]
查看完整验算程序
# 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 ""))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《仪式神经学、空间边界切换与自我转移的计算生物医学》第 4 章「从反刍到当下:三网络模型与突显网络的切换」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.23839910
DOI: 10.5281/zenodo.23839910 · 阅读本章所在专著 · 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}
}