关于「腧穴共现网络与脑网络的牵制控制」,《井穴揿针与卒中后认知》给出的定量结论是什么?
结论:论文的腧穴网络是处方共现网络。它的权重主要由各穴的使用频率决定:独立选择就能产生百会—四神聪 65 次中的约 50 次;一个没有任何配伍规则的模拟处方库,同样产生约 0.72–0.75 的聚类系数、直径 3,以及与论文相同的前五位「核心穴」。扣除频率后仍有可辨认的结构,但其形态是处方流派,而不是生理耦合。可控性与牵制控制只能放在示意性的脑区网络中讨论;在作者的模型中,单点驱动的能量有限但极大、双精度下无法可靠求逆,加驱动点必然降低能量但倍数取决于权重,「受损后能量变化」的倍数在扰动网络中跨越近六个数量级,所以「降低一个数量级」不是一个有根据的结论。64.7% 是梗死部位涉及基底节的比例,不是测得的传导受损比例。
数据口径:卒中后在双手十二井穴贴上长 0.9 毫米的揿针并每天按揉,能否借指端密集的感觉传入改善认知?本书是教学与研究用的数学模型与方法学讨论,不是医疗建议。 书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的模型和假说;除注明的文献数据外,书中数据都是合成的。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 65
| 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 |
核心公式
\[E_{ij} = \frac{f_i f_j}{N}, \qquad N = 172,\]
查看完整验算程序
# 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()唯一数据源与引用
范雅福(Fan, Y.). (2026). 《指—脑皮层放大、远端微针传入与卒中后认知网络重建的计算神经学》第 1 章「腧穴共现网络与脑网络的牵制控制」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.23839915
DOI: 10.5281/zenodo.23839915 · 阅读本章所在专著 · 5DL-B-052 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026052,
author = {Fan, Yafu},
title = {Finger–Brain Cortical Magnification, Distal Microneedle Afference and Computational Neurology of Post-Stroke Cognitive Network Reconstruction},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.23839915},
url = {https://doi.org/10.5281/zenodo.23839915}
}