关于「三网络的切换:驻留时间与它的代价」,《内感受解离与自主神经修复》给出的定量结论是什么?
结论:三个网络在静息态数据中可以分离,它们的时间组织可以用状态序列模型刻画,这些都有证据。把「内部事件不再招募突显网络」写成转移概率的下降之后,结果是三件事同时发生:默认模式占位从 0.285 升到 0.596、驻留时间从 1.44 升到 5.54 秒,而熵率从 1.8348 降到 1.2472 比特/秒、到执行状态的首达时间从 4.47 升到 6.66 秒。前两项是原说法想要的,后两项是它的代价,且这个代价是算术必然,不是经验发现。「安抚默认模式网络」这句话在方向与层次上都需要修正:提高默认模式驻留与降低默认模式活动是两个不同的描述,而把「高阶觉知」指认为某个网络的精度调节还缺证据。最后,状态序列上的熵率估计在短序列上有系统偏差,不宜作主要结局。
数据口径:把注意力放到身体内部而不去解释它,能不能解除交感防御、让内脏与盆腔的微循环自行恢复?本书是教学与研究用的数学模型与方法学讨论,不是医疗建议。 第五,RMSSD 与高频功率随呼吸方式大幅改变:在平均心搏间期完全不变的合成记录中,RMSSD 从 18.4 变到 31.4 毫秒,而 6 次/分时高频指标反而塌陷,因为呼吸峰已移出频带。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.285, 0.596, 1.2472, 1.44, 1.8348, 4.47
schematic transition matrix (rows sum to 1), sampling step 0.72 s
D S E
D 0.65 0.25 0.10
S 0.22 0.55 0.23
E 0.18 0.12 0.70
stationary occupancy: D 0.362 S 0.293 E 0.345
expected dwell (s): D 2.06 S 1.60 E 2.40
entropy rate: 1.2747 bits/step = 1.7704 bits/s
mean first passage D -> E: 6.83 steps = 4.92 s
varying only D -> S (D -> E fixed at 0.10):
p(D->S) occ D occ S occ E dwell D (s) H (bits/s) MFPT D->E (s)
0.40 0.285 0.351 0.364 1.44 1.8348 4.47
0.30 0.332 0.315 0.353 1.80 1.8035 4.74
0.25 0.362 0.293 0.345 2.06 1.7704 4.92
0.15 0.440 0.234 0.326 2.88 1.6437 5.43
0.08 0.519 0.174 0.307 4.00 1.4673 6.02
0.03 0.596 0.116 0.288 5.54 1.2472 6.66
Lowering D -> S raises default-mode occupancy and lengthens its dwell
time; it also LOWERS the entropy rate and LENGTHENS the path to the
executive state. A model in which inner events stop recruiting salience
is therefore also a model of becoming slower to engage a task. That is
a cost, not a side effect.查看完整验算程序
# Chapter 2. The triple network as a three-state Markov chain over dominant
# states (D = default mode, S = salience, E = central executive), fitted to
# nothing: the transition matrix is a schematic the author chooses. What the
# program computes is what follows FROM a transition matrix, which is exact:
# the stationary distribution (power iteration), expected dwell time
# 1/(1-p_ii) in units of the sampling step, the entropy rate, and mean first
# passage time from D to E. It then varies one entry, the D->S probability,
# which is the author's reading of "the salience network stops being recruited
# by inner events", and shows what that does to the rest.
import math
STEP = 0.72 # s per TR, a common resting-state fMRI sampling interval
STATES = ("D", "S", "E")
def stationary(P, iters=20000):
v = [1.0 / len(P)] * len(P)
for _ in range(iters):
v = [
math.fsum(v[i] * P[i][j] for i in range(len(P)))
for j in range(len(P))
]
s = math.fsum(v)
v = [x / s for x in v]
return v
def entropy_rate(P, pi):
h = 0.0
for i, row in enumerate(P):
for p in row:
if p > 0:
h -= pi[i] * p * math.log(p, 2)
return h
def mfpt(P, src, dst):
"""Mean first passage time src -> dst, in steps, by solving (I-Q) t =
1."""
idx = [i for i in range(len(P)) if i != dst]
Q = [[P[i][j] for j in idx] for i in idx]
n = len(idx)
A = [
[(1.0 if i == j else 0.0) - Q[i][j] for j in range(n)] + [1.0]
for i in range(n)
]
for c in range(n): # Gauss-Jordan
p = max(range(c, n), key=lambda r: abs(A[r][c]))
A[c], A[p] = A[p], A[c]
d = A[c][c]
A[c] = [v / d for v in A[c]]
for r in range(n):
if r != c and A[r][c] != 0.0:
f = A[r][c]
A[r] = [a - f * b for a, b in zip(A[r], A[c])]
return A[idx.index(src)][n]
def build(p_ds):
"""Schematic chain; the D row is renormalised so only D->S is varied
against D->D."""
rest = 0.10 # D -> E held fixed
return [[1.0 - p_ds - rest, p_ds, rest],
[0.22, 0.55, 0.23],
[0.18, 0.12, 0.70]]
if __name__ == "__main__":
print(
"schematic transition matrix (rows sum to 1), sampling step {:.2f} s"
.format(STEP)
)
P0 = build(0.25)
print(" " + "".join("{:>8s}".format(s) for s in STATES))
for s, row in zip(STATES, P0):
print(
" {:5s}".format(s) + "".join("{:8.2f}".format(v) for v in row)
)
pi = stationary(P0)
print("\nstationary occupancy: " +
" ".join("{} {:.3f}".format(s, v) for s, v in zip(STATES, pi)))
print("expected dwell (s): " +
" ".join("{} {:.2f}".format(s, STEP / (1 - P0[i][i]))
for i, s in enumerate(STATES)))
print("entropy rate: {:.4f} bits/step = {:.4f} bits/s"
.format(entropy_rate(P0, pi), entropy_rate(P0, pi) / STEP))
print("mean first passage D -> E: {:.2f} steps = {:.2f} s"
.format(mfpt(P0, 0, 2), mfpt(P0, 0, 2) * STEP))
print("\nvarying only D -> S (D -> E fixed at 0.10):")
print(
" p(D->S) occ D occ S occ E dwell D (s) H (bits/s) MFPT"
" D->E (s)"
)
for p_ds in (0.40, 0.30, 0.25, 0.15, 0.08, 0.03):
P = build(p_ds)
q = stationary(P)
print(" {:7.2f} {:7.3f} {:7.3f} {:7.3f} {:12.2f} {:11.4f} {:14.2f}"
.format(p_ds, q[0], q[1], q[2], STEP / (1 - P[0][0]),
entropy_rate(P, q) / STEP, mfpt(P, 0, 2) * STEP))
print(
"\nLowering D -> S raises default-mode occupancy and lengthens its"
" dwell"
)
print(
"time; it also LOWERS the entropy rate and LENGTHENS the path to the"
)
print(
"executive state. A model in which inner events stop recruiting"
" salience"
)
print(
"is therefore also a model of becoming slower to engage a task."
" That is"
)
print("a cost, not a side effect.")唯一数据源与引用
范雅福(Fan, Y.). (2026). 《内感受解离、突显网络切换与内脏自主神经修复》第 2 章「三网络的切换:驻留时间与它的代价」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24020418
DOI: 10.5281/zenodo.24020418 · 阅读本章所在专著 · 5DL-B-053 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026053,
author = {Fan, Yafu},
title = {Interoceptive Decoupling, Salience-Network Switching and Autonomic Visceral Restoration},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.24020418},
url = {https://doi.org/10.5281/zenodo.24020418}
}