关于「两个静止状态:戈特曼的差分方程」,《分手之后的记忆、信号与复合》给出的定量结论是什么?

结论:没有修复时,0.184 的对话以敌对状态结束;修复三成成功时 0.128;六成时 0.100;九成时 0.096。比例的表现没有那么简单。结局良好的对话,没有修复时比例是 4.02,修复频繁时 6.82;结局不好的对话分别是 2.75 与 5.10。于是,修复频繁的坏对话可以显示出比没有修复的好对话更高的比例。这个比例是一对伴侣动态的结果,并且取决于怎样计数;它不是一个本身就决定伴侣命运的门槛。

数据口径:书中的参数均为示意或合成;全部计算由书中程序生成;本书不是心理咨询或治疗,也不是挽回任何人的操作手册,对方的决定属于对方。 第一章把复合当作带竞争事件的生存分析:在合成队列中,Kaplan-Meier 估计年底复合率为 0.456,真正复合的比例只有 0.311;并说明即使每对伴侣自身的机会不变,群体风险率也会因筛选降到最初的 0.355。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.096, 0.100, 0.128, 0.184, 2.75, 4.02

repair rhoends negativepos:neg (good)pos:neg (bad)
0.00.1844.022.75
0.30.1285.193.91
0.60.1006.054.57
0.90.0966.825.10

核心公式

\[W_{t+1} = a + r W_t + I(H_t), \qquad H_{t+1} = a + r H_t + I(W_{t+1}).\]
查看完整验算程序
# Chapter 6. p12: Repair attempts and the 5 to 1 ratio. The p11 couple
# (T = -1) talks for 60 exchanges with random shocks (sd 1.0) added to
# each score. When a score falls below T, a repair attempt cancels the
# -1.2 influence with chance rho. Start (+0.5, +0.5). Report the share
# of talks that end in the negative basin, and the ratio of positive to
# negative exchanges (score > 0 versus score < 0) in talks that end
# well and in talks that end badly. 4,000 talks per row, seed 92.
import random

def talk(rng, rho, a=0.3, r=0.5, n=60):
    def infl(x):
        if x > 0.8:
            return 0.6
        if x < -1:
            return 0.0 if rng.random() < rho else -1.2
        return 0.2 * x
    w = h = 0.5
    pos = neg = 0
    for _ in range(n):
        w = a + r * w + infl(h) + rng.gauss(0, 1.0)
        h = a + r * h + infl(w) + rng.gauss(0, 1.0)
        for x in (w, h):
            pos += x > 0
            neg += x < 0
    return (w + h) / 2 < 0, pos, neg

if __name__ == "__main__":
    rng = random.Random(92)
    print("   repair rho   ends negative   pos:neg (good)   pos:neg (bad)")
    for rho in (0.0, 0.3, 0.6, 0.9):
        res = [talk(rng, rho) for _ in range(4000)]
        bad = [x for x in res if x[0]]
        good = [x for x in res if not x[0]]
        rg = sum(x[1] for x in good) / max(1, sum(x[2] for x in good))
        rb = sum(x[1] for x in bad) / max(1, sum(x[2] for x in bad))
        print("   {:10.1f}   {:13.3f}   {:14.2f}   {:13.2f}".format(
            rho, len(bad) / len(res), rg, rb))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《关系断裂生存分析、断联期记忆衰减与复联博弈窗口》第 6 章「两个静止状态:戈特曼的差分方程」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090241

DOI: 10.5281/zenodo.24090241 · 阅读本章所在专著 · 5DL-B-092 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026092,
  author    = {Fan, Yafu},
  title     = {Relationship Rupture Survival Analysis, No-Contact Memory Decay and Reconciliation Game Windows},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090241},
  url       = {https://doi.org/10.5281/zenodo.24090241}
}

本书其他章节结论