5D Library › Finger–Brain Cortical Magnification, Distal Microneedle Afference and Computational Neurology of Post-Stroke Cognitive Network Reconstruction · 中文

Chapter 1. Acupoint Co-occurrence Networks and Pinning Control of Brain Networks

What the thesis did

Study 1 of Lu Shunkang’s thesis mines the clinical prescriptions used in acupuncture for post-stroke mild cognitive impairment (Lu 2024).

Evidence

The complex-network analysis of the thesis (Chapter 1 of the thesis). CNKI, VIP, Wanfang and PubMed were searched to 31 May 2024 and 172 randomised controlled trials were included (99 Chinese, 73 English), reporting 14,075 cases in total (section 1.1.6). From each paper one prescription was extracted as “one set of main points + one set of supplementary points = one prescription”, 172 in all. The five most frequent points were Baihui (127 times, 73.83 %), Sishencong (68), Shenting (63), Zusanli (51) and Fengchi (47) (Table 1-3). Among high-weight pairs, Baihui–Sishencong had weight 65, Baihui–Shenting 59 and Baihui–Fengchi 44 (Table 1-5). A Gephi network of “172 acupoint nodes and 466 edges” had an average weighted degree of 15.278, an average clustering coefficient of 0.822 and a diameter of 3 (section 1.2.4). Combining the analyses, the thesis named Baihui, Sishencong, Shenting, Fengchi, Yintang, Shuigou, Neiguan, Zusanli and Fenglong as core points (Conclusion 1).

A few textual details need stating first. The thesis gives three node counts: “152 acupoint names” were labelled when building the term-frequency table (section 1.1.7.1), “179 acupoints” entered the association-rule analysis (section 1.2.2), and the Gephi network had “172 acupoint nodes” (section 1.2.4) — and 172 is also the number of papers and of prescriptions. Section 1.2.1 calls the 8 pairs of Table 1-5 “pairs with weight > 200”, but their weights are 31 to 65. In Table 1-3 the 43 uses of Neiguan are printed as 40.03 %, whereas 43/172 is 25.00 %. None of this affects the main argument of this chapter, but it means that only counts printed explicitly in the thesis can be used; other quantities cannot be reconstructed.

This chapter answers two questions. First, what does this network describe? Second, the author’s framework proposes that “adding distal boundary drive at the well points to the head hubs of the Du vessel lowers the minimum control energy by an order of magnitude”: in what sense can that hold?

Where co-occurrence weights come from

Start with a simple fact. Baihui appears in 127 of the 172 prescriptions, 73.8 %. If doctors decided independently for each point whether to use it in each prescription (no pairing rule at all), any point used fjf_j times would be expected to co-occur with Baihui about 127fj/172≈0.74fj127 f_j / 172 \approx 0.74 f_j times. In general, the expected co-occurrence of points ii and jj under independent choice is

Eij=fifjN,N=172,E_{ij} = \frac{f_i f_j}{N}, \qquad N = 172,

and the ratio of observed to expected, Oij/EijO_{ij}/E_{ij}, is called the lift. Given the two frequencies, the co-occurrence count follows a hypergeometric distribution, which gives exact test probabilities. The program below works through the 32 pairs of Table 1-5 whose two points both appear in Table 1-3.

Calculation

# Chapter 1. What an acupoint co-occurrence network can say. Inputs from Lu (2024):
# N = 172 prescriptions, point frequencies (Table 1-3), pair weights (Table 1-5).
# A: expected co-occurrence under independent choice E = f_i f_j / N, lift O/E and an
#    exact hypergeometric test. B: a NULL database in which every point enters every
#    prescription independently with its own frequency, summarised like the thesis.
import math, random

N = 172
F = {"Baihui": 127, "Sishencong": 68, "Shenting": 63, "Zusanli": 51, "Fengchi": 47,
     "Neiguan": 43, "Sanyinjiao": 40, "Taixi": 40, "Shenmen": 38, "Fenglong": 36,
     "Shuigou": 29, "Taichong": 29, "Xuanzhong": 24, "Yintang": 23, "Fengfu": 22}
T15 = """Baihui Sishencong 65|Baihui Shenting 59|Baihui Fengchi 44|Baihui Neiguan 37|
Baihui Zusanli 35|Sishencong Shenting 33|Sishencong Fengchi 32|Baihui Sanyinjiao 31|
Baihui Taixi 30|Baihui Shenmen 30|Baihui Shuigou 27|Baihui Fenglong 26|
Zusanli Sanyinjiao 26|Shenting Fengchi 23|Baihui Yintang 22|Baihui Taichong 22|
Zusanli Fenglong 22|Shenting Neiguan 21|Sishencong Fenglong 21|Zusanli Neiguan 21|
Sishencong Neiguan 21|Shenting Taixi 20|Sishencong Shenmen 20|Sishencong Sanyinjiao 20|
Sishencong Zusanli 20|Fengchi Shenmen 19|Sanyinjiao Taixi 19|Shenting Zusanli 19|
Fengchi Neiguan 19|Baihui Fengfu 18|Baihui Xuanzhong 18|Sishencong Taixi 18"""
PAIRS = [(s.split()[0], s.split()[1], int(s.split()[2]))
         for s in T15.replace("\n", "").split("|")]
HEAD = {"Baihui", "Sishencong", "Shenting", "Fengchi", "Yintang", "Shuigou", "Fengfu"}

def hyper_tail(k, K, n, upper=True):           # P(X >= k) or P(X <= k), exact
    tot = math.comb(N, n)
    ks = range(k, min(K, n) + 1) if upper else range(0, k + 1)
    return sum(math.comb(K, x) * math.comb(N - K, n - x) for x in ks) / tot

def part_a():
    print("A. Reported pair weights (Table 1-5) against independent choice")
    print("   pair                      obs   exp  lift  two-sided p (hypergeometric)")
    rows = []
    for a, b, o in PAIRS:
        e = F[a] * F[b] / N
        p = 2 * min(hyper_tail(o, F[a], F[b]), hyper_tail(o, F[a], F[b], upper=False))
        rows.append((a, b, o, e, o / e, min(1.0, p)))
    for a, b, o, e, l, p in rows[:8] + sorted(rows[8:], key=lambda r: -r[4])[:3]:
        print(f"   {a + '-' + b:24s} {o:5d} {e:5.1f} {l:5.2f}  {p:.4f}")
    lifts = [r[4] for r in rows]
    alpha = 0.05 / len(rows)
    hh = [r[4] for r in rows if r[0] in HEAD and r[1] in HEAD]
    bb = [r[4] for r in rows if r[0] not in HEAD and r[1] not in HEAD]
    print(f"   {len(rows)} pairs: lift < 1 in {sum(l < 1 for l in lifts)}; median lift"
          f" {sorted(lifts)[len(lifts) // 2]:.2f}; Bonferroni-significant"
          f" {sum(r[5] < alpha for r in rows)}")
    print(f"   head-head pairs: mean lift {math.fsum(hh) / len(hh):.2f} (n = {len(hh)});"
          f" body-body pairs: {math.fsum(bb) / len(bb):.2f} (n = {len(bb)})")
    print(f"   Baihui is in {F['Baihui']}/{N} = {F['Baihui'] / N:.1%} of prescriptions,")
    print("   so its weight with any point j is about 0.74 f_j by chance alone")

def tail_freqs(m=137, total=527):
    f = [max(1, round(19 * 0.965 ** k)) for k in range(m)]
    i = 0
    while sum(f) != total:                       # adjust the largest entries by one
        f[i % 20] += 1 if sum(f) < total else -1
        i += 1
    return f

def build(rng):
    names = list(F) + [f"t{k:03d}" for k in range(137)]
    freq = list(F.values()) + tail_freqs()
    db = [[j for j, fj in enumerate(freq) if rng.random() < fj / N] for _ in range(N)]
    w = {}
    for rx in db:
        for x in range(len(rx)):
            for y in range(x + 1, len(rx)):
                w[(rx[x], rx[y])] = w.get((rx[x], rx[y]), 0) + 1
    return names, freq, db, w

def summary(w, thr):
    adj = {}
    for (a, b), c in w.items():
        if c >= thr:
            adj.setdefault(a, set()).add(b); adj.setdefault(b, set()).add(a)
    cc = []
    for v, nb in adj.items():
        k = len(nb)
        if k >= 2:
            links = sum(1 for x in nb for y in nb if x < y and y in adj[x])
            cc.append(2 * links / (k * (k - 1)))
        else:
            cc.append(0.0)
    diam = 0
    for s in adj:                                # BFS from every node
        dist, front = {s: 0}, [s]
        while front:
            nxt = []
            for u in front:
                for v in adj[u]:
                    if v not in dist:
                        dist[v] = dist[u] + 1; nxt.append(v)
            front = nxt
        diam = max(diam, max(dist.values()))
    m = sum(len(nb) for nb in adj.values()) // 2
    return len(adj), m, math.fsum(cc) / len(cc), diam

def spearman(x, y):
    def rank(v):                                 # average ranks for ties
        srt = sorted(v); first = {}
        for i, a in enumerate(srt):
            first.setdefault(a, i)
        return [first[a] + (srt.count(a) - 1) / 2 for a in v]
    rx, ry = rank(x), rank(y); mx, my = math.fsum(rx) / len(rx), math.fsum(ry) / len(ry)
    sxy = math.fsum((a - mx) * (b - my) for a, b in zip(rx, ry))
    sxx = math.fsum((a - mx) ** 2 for a in rx); syy = math.fsum((b - my) ** 2 for b in ry)
    return sxy / math.sqrt(sxx * syy)

def part_b():
    names, freq, db, w = build(random.Random(2024))
    occ = sum(len(r) for r in db)
    print(f"B. Null database: {len(names)} points, {N} prescriptions, {occ:,} point uses")
    print("   (Table 1-4 implies about 1,207 uses: 335 Du-vessel uses = 27.75 %)")
    print("   threshold  nodes  edges  mean degree  avg clustering  diameter")
    for thr in (1, 3, 5, 8):
        n, m, c, d = summary(w, thr)
        print(f"   weight>={thr:<3d} {n:6d} {m:6d} {2 * m / n:12.1f} {c:15.3f} {d:9d}")
    print("   thesis (Gephi): 172 nodes, 466 edges, mean degree 5.4, clustering 0.822,"
          " diameter 3")
    wd = [0] * len(names)
    for (a, b), c in w.items():
        wd[a] += c; wd[b] += c
    top = sorted(range(len(names)), key=lambda i: -wd[i])[:5]
    print("   top 5 by weighted degree:", ", ".join(names[i] for i in top))
    print(f"   Spearman(frequency, weighted degree) = {spearman(freq, wd):.3f}")

if __name__ == "__main__":
    part_a()
    part_b()
# A. Reported pair weights (Table 1-5) against independent choice
#    pair                      obs   exp  lift  two-sided p (hypergeometric)
#    Baihui-Sishencong           65  50.2  1.29  0.0000
#    Baihui-Shenting             59  46.5  1.27  0.0000
#    Baihui-Fengchi              44  34.7  1.27  0.0002
#    Baihui-Neiguan              37  31.8  1.17  0.0499
#    Baihui-Zusanli              35  37.7  0.93  0.4104
#    Sishencong-Shenting         33  24.9  1.32  0.0142
#    Sishencong-Fengchi          32  18.6  1.72  0.0000
#    Baihui-Sanyinjiao           31  29.5  1.05  0.7036
#    Zusanli-Sanyinjiao          26  11.9  2.19  0.0000
#    Zusanli-Fenglong            22  10.7  2.06  0.0000
#    Sanyinjiao-Taixi            19   9.3  2.04  0.0002
#    32 pairs: lift < 1 in 3; median lift 1.27; Bonferroni-significant 8
#    head-head pairs: mean lift 1.32 (n = 9); body-body pairs: 1.99 (n = 4)
#    Baihui is in 127/172 = 73.8% of prescriptions,
#    so its weight with any point j is about 0.74 f_j by chance alone
# B. Null database: 152 points, 172 prescriptions, 1,148 point uses
#    (Table 1-4 implies about 1,207 uses: 335 Du-vessel uses = 27.75 %)
#    threshold  nodes  edges  mean degree  avg clustering  diameter
#    weight>=1      125   1582         25.3           0.752         3
#    weight>=3       62    343         11.1           0.722         3
#    weight>=5       42    172          8.2           0.729         3
#    weight>=8       27     76          5.6           0.463         2
#    thesis (Gephi): 172 nodes, 466 edges, mean degree 5.4, clustering 0.822, diameter 3
#    top 5 by weighted degree: Baihui, Sishencong, Shenting, Zusanli, Fengchi
#    Spearman(frequency, weighted degree) = 0.843

Part A says two things. First, high weights come mainly from high frequencies: of the 65 co-occurrences of Baihui and Sishencong, about 50.2 would arise from independent choice, a lift of 1.29; Baihui–Zusanli, at 35, is even below its expectation of 37.7 (lift 0.93, p = 0.41) — doctors who used Baihui were not more inclined also to use Zusanli. Second, pairing rules do exist, but they take the shape of schools: 8 of the 32 pairs are significant after Bonferroni correction; the mean lift among head points is 1.32, whereas among the trunk and limb points Zusanli, Sanyinjiao, Taixi and Fenglong it is as high as 1.99 (Zusanli–Sanyinjiao, for example, 26 against 11.9 expected). A reasonable reading is that the literature contains two prescription traditions, one “built on the head points of the Du vessel” and one “built on limb points chosen by pattern differentiation”, and that points of the same kind tend to appear together.

A prescription database with no pairing rule

The reported clustering coefficient of 0.822 and diameter of 3 are often read as “small-world” properties and further as evidence of synergy between points. Part B builds a comparison: 152 points, the first 15 with the frequencies of Table 1-3 and the other 137 with decreasing small frequencies, bringing total use to about 1,207 (the total implied by Table 1-4, where 335 uses of Du-vessel points are 27.75 %); each point then enters each of 172 prescriptions independently with its own frequency. This database contains no pairing rule.

Building networks from co-occurrence counts of at least 1, 3 and 5 gives 125, 62 and 42 nodes, average clustering coefficients of 0.752, 0.722 and 0.729, and a diameter of 3 every time; only at a threshold of 8 does the network thin out. The top five by weighted degree are Baihui, Sishencong, Shenting, Zusanli and Fengchi — exactly the thesis’s top five by frequency. The reason is simple: every prescription is a “clique” in the co-occurrence network (every two points in it are joined), many cliques overlap, and that alone produces high clustering and short paths; frequent points sit in most cliques and so become high-weighted-degree “hubs” (Watts and Strogatz 1998). Network statistics by themselves do not distinguish “pairing rules” from “frequency”.

Left: reported weights of the 32 pairs in Table 1-5 of the thesis against their expected counts under independent choice (dotted line y = x; blue, pairs of head points; gold, head with trunk or limb points; plum, pairs of trunk or limb points). Right: frequency against weighted degree for each point in a simulated prescription database with no pairing rule.

In Figure 1 most pairs lie on or slightly above y = x, and without pairing rules weighted degree is almost a function of frequency (Spearman 0.843, lowered by many tied frequencies in the tail).

Note

What a co-occurrence network can answer. It can answer “how did doctors in this literature usually write prescriptions”, and, after removing frequency, which pairs co-occur beyond chance — which needs methods anchored to a null model, such as lift, hypergeometric tests or “backbone extraction” (Serrano et al. 2009). It cannot answer whether two points interact physiologically, nor which point is more effective: a point may appear often because it works, or because it is the standard choice of one school, convenient to needle or recommended by textbooks. Book 25 discussed the general properties of clustering coefficients and centrality; they are not repeated here.

Pinning control and Gramian energy

The second step of the author’s framework applies control theory to this network. Research on controlling complex networks has three main strands. Liu, Slotine and Barabási (2011) showed that the structural controllability of a directed network gives the minimum number of driver nodes through a maximum matching, and that driver nodes tend not to be the high-degree hubs (Liu et al. 2011). Wang and Chen’s (2002) pinning control asks whether, in a coupled network, feedback −k(xi−x*)-k(x_i – x^*) applied to only a few nodes can pull the whole network to a target state, and which nodes should be pinned (Wang and Chen 2002). Yan and colleagues (2012) pointed out that “controllable” does not mean “easy to control”: the minimum energy needed to drive the linear system ẋ=Ax+Bu\dot{x} = Ax + Bu from the origin to a target xfx_f is

Emin(T)=xf⊤W(T)−1xf,W(T)=∫0TeAtBB⊤eA⊤tdt,E_{\min}(T) = x_f^{\top}\, W(T)^{-1} x_f, \qquad W(T) = \int_0^T e^{At} B B^{\top} e^{A^{\top} t}\, dt,

where W(T)W(T) is the controllability Gramian; with few driver nodes the energy can differ by many orders of magnitude between target directions (Yan et al. 2012; Pasqualetti et al. 2014).

Gu and colleagues (2015) applied these methods to structural brain networks from diffusion imaging, proposed indices such as “average” and “modal” controllability, and argued that a single region can in theory control the whole brain network (Gu et al. 2015). Tu and colleagues (2018) redid the analysis on four data sets and found that more than one node is always needed, that the relation between average controllability and weighted degree also holds in randomised networks, and that proposals to use such indices to choose neurostimulation targets should be revisited (Tu et al. 2018). Even on a real brain network, then, “where is driving cheapest” depends heavily on modelling choices.

A schematic brain-region network

Applying these methods to the acupoint co-occurrence network fails at the first step: an edge in a co-occurrence network is joint appearance in a prescription, not signal transmission, and no state variable on the network evolves according to ẋ=Ax\dot{x} = Ax. This chapter therefore discusses the author’s question on a schematic brain-region network. This is the author’s model: 8 nodes (primary somatosensory cortex S1, primary motor cortex M1, the ventral posterolateral thalamic nucleus VPL, the mediodorsal thalamic nucleus MD, striatum STR, prefrontal cortex PFC, anterior cingulate ACC and posterior parietal cortex PPC), 13 symmetric edges with illustrative weights not estimated from any imaging data. “Distal input” enters at VPL (the thalamic relay of hand afference), “head input” at ACC (standing for medial frontal cortex), and the target state is equal activation of PFC, ACC and PPC; “basal-ganglia damage” multiplies every edge touching the striatum by 0.3.

Calculation

# Chapter 1. Control energy on a SCHEMATIC 8-region network (the author's model; weights
# illustrative). dx/dt = A x + B u, A = -I + 0.9 W / lambda_max(W). Energy to reach x_f
# (PFC = ACC = PPC) is x_f' G^-1 x_f with G the controllability Gramian, also solved
# EXACTLY in rational arithmetic (Lyapunov equation) since floats fail for one driver.
# Inputs: "distal" at VPL, "head" at ACC; lesion: STR weights x 0.3. B: pinning rate.
import math, random
from fractions import Fraction

NODES = ["S1", "M1", "VPL", "MD", "STR", "PFC", "ACC", "PPC"]
EDGES = {("VPL", "S1"): 1.0, ("S1", "M1"): 0.8, ("S1", "PPC"): 0.7, ("M1", "PPC"): 0.5,
         ("PPC", "PFC"): 0.6, ("PFC", "ACC"): 0.7, ("PFC", "MD"): 0.6, ("ACC", "MD"): 0.4,
         ("PFC", "STR"): 0.7, ("ACC", "STR"): 0.5, ("M1", "STR"): 0.5, ("STR", "MD"): 0.6,
         ("MD", "VPL"): 0.2}
IX = {v: i for i, v in enumerate(NODES)}
n = len(NODES)

def jacobi(S):                                   # eigen-decomposition, symmetric S
    a = [row[:] for row in S]; V = [[float(i == j) for j in range(n)] for i in range(n)]
    for _ in range(100):
        off = math.fsum(a[i][j] ** 2 for i in range(n) for j in range(n) if i != j)
        if off < 1e-22:
            break
        for p in range(n - 1):
            for q in range(p + 1, n):
                if abs(a[p][q]) < 1e-30:
                    continue
                th = 0.5 * math.atan2(2 * a[p][q], a[q][q] - a[p][p])
                c, s = math.cos(th), math.sin(th)
                for k in range(n):
                    akp, akq = a[k][p], a[k][q]
                    a[k][p], a[k][q] = c * akp - s * akq, s * akp + c * akq
                for k in range(n):
                    apk, aqk = a[p][k], a[q][k]
                    a[p][k], a[q][k] = c * apk - s * aqk, s * apk + c * aqk
                for k in range(n):
                    vkp, vkq = V[k][p], V[k][q]
                    V[k][p], V[k][q] = c * vkp - s * vkq, s * vkp + c * vkq
    return [a[i][i] for i in range(n)], V

def weights(scale=None, lesion=1.0):
    W = [[0.0] * n for _ in range(n)]
    for (u, v), w in EDGES.items():
        f = (scale or {}).get((u, v), 1.0) * (lesion if "STR" in (u, v) else 1.0)
        W[IX[u]][IX[v]] = W[IX[v]][IX[u]] = w * f
    return W

def system(W, norm):
    return [[(-1.0 if i == j else 0.0) + 0.9 * W[i][j] / norm for j in range(n)]
            for i in range(n)]

def gramian(A, drivers, T):
    lam, V = jacobi(A)
    b = [[V[IX[dd]][i] for dd in drivers] for i in range(n)]
    M = [[0.0] * n for _ in range(n)]
    for i in range(n):
        for j in range(n):
            s = -(lam[i] + lam[j])
            g = (1 - math.exp(-s * T)) / s if T != math.inf else 1 / s
            M[i][j] = math.fsum(b[i][k] * b[j][k] for k in range(len(drivers))) * g
    return [[math.fsum(V[r][i] * M[i][j] * V[c][j] for i in range(n) for j in range(n))
             for c in range(n)] for r in range(n)]

XF = [1 / math.sqrt(3) if v in ("PFC", "ACC", "PPC") else 0.0 for v in NODES]

def report(A, d, T=math.inf):
    G = gramian(A, d, T); ev, V = jacobi(G); cond = max(ev) / min(ev)
    tr = math.fsum(G[i][i] for i in range(n))
    if min(ev) <= 0 or cond > 1e10:
        return tr, cond, None                     # numerically singular: no energy
    proj = [math.fsum(V[r][k] * XF[r] for r in range(n)) for k in range(n)]
    return tr, cond, math.fsum(p * p / l for p, l in zip(proj, ev))   # x' G^-1 x

def rref(M, m):                                   # exact Gauss-Jordan, m unknowns
    for c in range(m):
        p = next(r for r in range(c, m) if M[r][c] != 0); M[c], M[p] = M[p], M[c]
        M[c] = [x / M[c][c] for x in M[c]]
        for r in range(m):
            if r != c and M[r][c] != 0:
                f = M[r][c]; M[r] = [x - f * y for x, y in zip(M[r], M[c])]
    return [row[-1] for row in M]

def exact_energy(A, drivers):
    idx = [(i, j) for i in range(n) for j in range(i, n)]
    pos = {p: k for k, p in enumerate(idx)}
    F = [[Fraction(x) for x in row] for row in A]; m = len(idx)
    M = [[Fraction(0)] * (m + 1) for _ in range(m)]
    for r, (i, j) in enumerate(idx):
        for k in range(n):
            M[r][pos[min(k, j), max(k, j)]] += F[i][k]
            M[r][pos[min(i, k), max(i, k)]] += F[j][k]
        M[r][m] = -Fraction(sum(1 for d in drivers if IX[d] == i == j))
    g = rref(M, m)
    e = [Fraction(int(v in ("PFC", "ACC", "PPC"))) for v in NODES]
    G = [[g[pos[min(i, j), max(i, j)]] for j in range(n)] + [e[i]] for i in range(n)]
    y = rref(G, n)
    return float(sum(a * b for a, b in zip(e, y)) / 3)

if __name__ == "__main__":
    W0 = weights(); norm = max(jacobi(W0)[0])
    Ai, Al = system(weights(), norm), system(weights(lesion=0.3), norm)
    configs = [("VPL",), ("ACC",), ("PFC",), ("VPL", "ACC"), tuple(NODES)]
    print("A. Gramian of the schematic network (T = infinity);"
          " STR lesion = weights x 0.3")
    print("   drivers       trace(G) int/les  cond(G)    E intact    E lesion   ratio")
    for d in configs:
        ti, ci, ei = report(Ai, d); tl, cl, el = report(Al, d)
        xi, xl = exact_energy(Ai, d), exact_energy(Al, d)
        lab = "all 8 nodes" if len(d) == n else "+".join(d)
        fi, fl = ("*" if ei is None else " "), ("*" if el is None else " ")
        print(f"   {lab:13s} {ti:5.2f}/{tl:4.2f} {ci:12.1e} {xi:10.3g}{fi} {xl:10.3g}{fl}"
              f" {xl / xi:7.2f}")
    print("   (energies exact, rational arithmetic; * = cond(G) > 1e10, so the double-")
    print("    precision inverse of G is unreliable; float energies cannot be trusted)")
    rng = random.Random(52); bad = 0; ratio = []
    for _ in range(300):                          # weights perturbed by +-30 %
        sc = {e: rng.uniform(0.7, 1.3) for e in EDGES}
        Wr = weights(sc); nr = max(jacobi(Wr)[0])
        bad += report(system(Wr, nr), ("VPL",))[2] is None
        e1 = report(system(Wr, nr), ("VPL", "ACC"))[2]
        e2 = report(system(weights(sc, 0.3), nr), ("VPL", "ACC"))[2]
        if e1 and e2:
            ratio.append(e2 / e1)
    ratio.sort()
    print(f"   300 perturbed networks: VPL alone has cond(G) > 1e10 in {bad};"
          " VPL+ACC\n   lesion/intact"
          f" energy ratio median {ratio[len(ratio) // 2]:.2f}"
          f" (range {ratio[0]:.2g} to {ratio[-1]:.3g}, n = {len(ratio)})")
    print("B. Pinning: convergence rate lambda_min(L + 5 D_pin) of x' = -(L + 5 D_pin) x")
    for lesion in (1.0, 0.3):
        W = weights(lesion=lesion)
        L = [[(math.fsum(W[i]) if i == j else -W[i][j]) for j in range(n)]
             for i in range(n)]
        out = []
        for pins in (("VPL",), ("ACC",), ("PFC",), ("VPL", "ACC")):
            Lp = [[L[i][j] + (5.0 if i == j and NODES[i] in pins else 0.0)
                   for j in range(n)] for i in range(n)]
            out.append(f"{'+'.join(pins)} {min(jacobi(Lp)[0]):.3f}")
        print(f"   STR x {lesion}: " + "; ".join(out))
# A. Gramian of the schematic network (T = infinity); STR lesion = weights x 0.3
#    drivers       trace(G) int/les  cond(G)    E intact    E lesion   ratio
#    VPL            0.78/0.71      8.8e+13   4.33e+12*   9.03e+13*   20.83
#    ACC            1.02/0.63      2.4e+12   3.78e+11*   1.81e+13*   47.72
#    PFC            1.46/0.75      1.9e+13   1.01e+12*   8.98e+13*   89.18
#    VPL+ACC        1.80/1.34      4.4e+06   1.29e+06    1.57e+06     1.22
#    all 8 nodes    8.85/5.81      1.6e+01       1.23        1.23     1.00
#    (energies exact, rational arithmetic; * = cond(G) > 1e10, so the double-
#     precision inverse of G is unreliable; float energies cannot be trusted)
#    300 perturbed networks: VPL alone has cond(G) > 1e10 in 300; VPL+ACC
#    lesion/intact energy ratio median 3.39 (range 0.0045 to 3.46e+03, n = 300)
# B. Pinning: convergence rate lambda_min(L + 5 D_pin) of x' = -(L + 5 D_pin) x
#    STR x 1.0: VPL 0.097; ACC 0.122; PFC 0.177; VPL+ACC 0.320
#    STR x 0.3: VPL 0.091; ACC 0.096; PFC 0.146; VPL+ACC 0.274

The results differ sharply from what the framework envisages. Driving from VPL, ACC or PFC alone, the minimum energy is finite but huge — 4.33 × 10¹², 3.78 × 10¹¹ and 1.01 × 10¹² intact, 21–89 times more after “damage” — yet the Gramian has a condition number of 10¹²–10¹⁴ and cannot be inverted reliably in double precision, exactly the numerical problem Tu and colleagues pointed out; the program therefore solves the Lyapunov equation exactly in rational arithmetic. Driving VPL and ACC together brings the energy down to about 1.29 × 10⁶, rising to 1.57 × 10⁶ after “damage”, only about 22 % more. That an extra driver lowers the energy holds for any weights in a linear model (the Gramian can only grow), while the factor — here about 10⁵–10⁶ — depends entirely on the weights. When each of the 13 edge weights is perturbed at random by ±30 %, 300 times, the Gramian for VPL alone exceeds a condition number of 10¹⁰ every time; with two drivers the median “damaged/intact” energy ratio is 3.39, but the range runs from 0.0045 to 3,460, nearly six orders of magnitude. In such a model “an order of magnitude less energy” is neither a stable number nor fixed by measurable anatomy.

By contrast, the pinning convergence rate in Part B is a stable quantity: 0.097 when pinning VPL, 0.177 when pinning PFC and 0.320 when pinning VPL and ACC together; after striatal damage these fall to 0.091, 0.146 and 0.274. In this model, an extra pinned node speeds convergence and the damage matters little — but that too is a conclusion under illustrative weights.

Left: base-10 logarithm of the Gramian condition number in the schematic network for different driver sets (dashed line, 10¹⁰; above it the problem is treated as numerically ill-posed). Right: distribution of the base-10 logarithm of the “damaged/intact” energy ratio with VPL and ACC as drivers, over 300 networks with perturbed weights (dashed line, a factor of 10).

The framework uses “64 % have impaired basal-ganglia conduction” as a reason for distal drive. In Table 2-2 of the thesis, 44 of 68 infarcts involve the basal ganglia, 64.7 % (checked in Chapter 3): a share of infarct locations; the thesis measured no conduction function and did not relate lesion location to cognitive outcome.

Hypothesis · not established · Co-occurrence lift reflects schools, not efficacy

The author’s hypothesis (not established): In randomised trials of acupuncture for post-stroke cognitive impairment, pairs of points with high co-occurrence lift after removing frequency (such as limb points chosen by pattern differentiation) do not produce larger between-group effects than pairs with low lift. What would show it wrong: in a pre-registered meta-regression (with trials as units, controlling for type of control group, sample size and risk of bias), a 95 % confidence interval for the association between the number of high-lift pairs in a prescription and the standardised effect size that excludes zero on the positive side. The test requires effect sizes extracted paper by paper and is not done in this book.

Chapter summary

The acupoint network of the thesis is a prescription co-occurrence network. Its weights are determined mainly by the frequency of each point: independent choice alone produces about 50 of the 65 Baihui–Sishencong co-occurrences, and a simulated database with no pairing rule yields a clustering coefficient of about 0.72–0.75, a diameter of 3 and the same five “core points” as the thesis. Some structure remains after removing frequency, but its shape is that of prescription schools, not physiological coupling. Controllability and pinning control can only be discussed on a schematic brain-region network; in the author’s model single-node energies are finite but huge and cannot be inverted reliably in double precision, an extra driver always lowers the energy by a factor set by the weights, and the factor by which “damage” changes the energy spans nearly six orders of magnitude across perturbed networks, so “an order of magnitude less energy” is not a grounded conclusion. 64.7 % is the share of infarcts involving the basal ganglia, not a measured share of impaired conduction.

References

Gu, Shi, Fabio Pasqualetti, Matthew Cieslak, et al. 2015. “Controllability of Structural Brain Networks.” Nature Communications 6: 8414. https://doi.org/10.1038/ncomms9414.
Liu, Yang-Yu, Jean-Jacques Slotine, and Albert-László Barabási. 2011. “Controllability of Complex Networks.” Nature 473: 167–73. https://doi.org/10.1038/nature10011.
Lu, Shunkang. 2024. “Shou Shi’er Jingxue Qinzhen Ganyu Zhiliao Cuzhong Hou Qingdu Renzhi Zhang’ai (PSMCI) de Linchuang Liaoxiao Pingjia Ji Naodian Guilü Chutan [Clinical Efficacy Evaluation of Press Needles at the Twelve Jing-Well Points of the Hands for Post-Stroke Mild Cognitive Impairment (PSMCI) and a Preliminary Study of EEG Patterns].” Master’s thesis (defence version; supervisors: Guo Yi 郭义, Chen Bo 陈波, Zhang Jingsha 张静莎; in Chinese), Tianjin University of Traditional Chinese Medicine.
Pasqualetti, Fabio, Sandro Zampieri, and Francesco Bullo. 2014. “Controllability Metrics, Limitations and Algorithms for Complex Networks.” IEEE Transactions on Control of Network Systems 1 (1): 40–52.
Serrano, M. Ángeles, Marián Boguñá, and Alessandro Vespignani. 2009. “Extracting the Multiscale Backbone of Complex Weighted Networks.” Proceedings of the National Academy of Sciences of the USA 106 (16): 6483–88.
Tu, Chengyi, Rodrigo P. Rocha, Maurizio Corbetta, Sandro Zampieri, Marco Zorzi, and Samir Suweis. 2018. “Warnings and Caveats in Brain Controllability.” NeuroImage 176: 83–91.
Wang, Xiao Fan, and Guanrong Chen. 2002. “Pinning Control of Scale-Free Dynamical Networks.” Physica A 310 (3–4): 521–31. https://doi.org/10.1016/S0378-4371(02)00772-0.
Watts, Duncan J., and Steven H. Strogatz. 1998. “Collective Dynamics of ‘Small-World’ Networks.” Nature 393: 440–42. https://doi.org/10.1038/30918.
Yan, Gang, Jie Ren, Ying-Cheng Lai, Choy-Heng Lai, and Baowen Li. 2012. “Controlling Complex Networks: How Much Energy Is Needed?” Physical Review Letters 108: 218703. https://doi.org/10.1103/PhysRevLett.108.218703.

Fan, Y. (2026). Finger–Brain Cortical Magnification, Distal Microneedle Afference and Computational Neurology of Post-Stroke Cognitive Network Reconstruction: From Complex-Network Pinning Control and Thalamocortical 10 Hz Alpha Restoration to Drift-Diffusion Models, Read Beside the Twelve Jing-Well Points of the Lingshu [指—脑皮层放大、远端微针传入与卒中后认知网络重建的计算神经学] (Version 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.23839915 · Licensed under Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0).