What does Interoceptive Decoupling and Autonomic Restoration conclude, in numbers, about “Switching Between Networks: Dwell Time and Its Cost”?

Answer: Three networks can be separated in resting-state data and their temporal organisation can be characterised with state-sequence models; both are supported. Once "inner events no longer recruit the salience network" is written as a fall in a transition probability, three things happen together: default-mode occupancy rises from 0.285 to 0.596 and dwell time from 1.44 to 5.54 s, while the entropy rate falls from 1.8348 to 1.2472 bits per second and first passage to the executive state lengthens from 4.47 to 6.66 s. The first two are what the claim wants; the last two are its cost, and that cost is an arithmetic necessity rather than an empirical finding. The phrase "soothes the default mode network" needs correction in both direction and level: raising default-mode dwell time and lowering default-mode activity are different descriptions, and identifying "higher-order awareness" with the precision modulation of some network is not yet supported. Finally, entropy-rate estimates on short state sequences are systematically biased and are unsuitable as a primary outcome.

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.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.
Show the full program
# 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.")

Single source and citation

Fan, Y. (2026). Interoceptive Decoupling, Salience-Network Switching and Autonomic Visceral Restoration (Version 1.0.0), Chapter 2: Switching Between Networks: Dwell Time and Its Cost. 5D Library. https://doi.org/10.5281/zenodo.24020418

DOI: 10.5281/zenodo.24020418 · Read the monograph · 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}
}

Other chapter answers in this book