关于「修复尝试:冲突回路中的阻尼器」,《依恋计算模型与伴侣互动》给出的定量结论是什么?

结论:模型显示两点。第一,做出修复与修复被接收是相乘的关系:一方非常努力地修复(\(p_{make} = 0.8\))而对方很少接收(\(p_{accept} = 0.2\)),冲突仍有六成以上以淹没告终;双方都只是中等程度地做出和接收(0.5 与 0.5),淹没的比例降到约四分之一。第二,从「大多淹没」到「大多平息」的转变发生在乘积约 0.1 到 0.4 之间一个不宽的区间里:在模型中,阻尼与升级斜率之间存在一个类似阈值的关系。决定冲突结局的,不是有没有冲突,而是升级的斜率能不能被修复截断。

数据口径:书中以标注框区分已发表的证据、可运行的 Python 计算(14 段程序,全部核对)、原典与作者的假说。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.1, 0.2, 0.4, 0.5, 0.8

share of conflicts that end flooded, and median length in turns (4,000 simulated conflicts each)
p_make \ p_accept |0.2 | 0.5 | 0.8
0.1 |89% flooded, 16 | 87% flooded, 18 | 82% flooded, 21
0.3 |86% flooded, 19 | 66% flooded, 27 | 30% flooded, 29
0.5 |78% flooded, 22 | 26% flooded, 27 | 3% flooded, 20
0.8 |61% flooded, 27 | 3% flooded, 19 | 0% flooded, 13
p_make * p_accept is what counts0.8 x 0.2 (=0.16) floods far more often than 0.5 x 0.5 (=0.25),
and the change from mostly flooded to mostly settled happens between products of about 0.1 and 0.4
查看完整验算程序
# Repair attempts as damping. A conflict is a sequence of speaking turns. Negativity n rises on
# average by s = 0.30 per turn (each reply a little sharper), with noise. Whenever n > 1, the speaker
# makes a repair attempt (a pause, a softer restatement, humour, "I see your point") with
# probability p_make; the listener accepts it with probability p_accept, and an accepted repair
# halves n. A conflict ends "settled for now" when n falls below 0.3, or "flooded" when n reaches 6
# (someone shuts down or leaves). Illustrative parameters; only the shape of the result matters
# (Gottman 1999 describes repair attempts and why their acceptance matters).
import random

def episode(p_make, p_accept, rng, s=0.30, cut=0.5, start=1.0, cap=6.0, settle=0.3, max_turns=200):
    n, turns = start, 0
    while settle <= n < cap and turns < max_turns:
        n += s + rng.gauss(0, 0.5)
        if n > 1 and rng.random() < p_make and rng.random() < p_accept:
            n *= 1 - cut
        turns += 1
    return turns, n >= cap

rng = random.Random(2)
print("share of conflicts that end flooded, and median length in turns (4,000 simulated conflicts each)")
print("p_make \\ p_accept |       0.2        |       0.5        |       0.8")
for pm in (0.1, 0.3, 0.5, 0.8):
    cells = []
    for pa in (0.2, 0.5, 0.8):
        res = [episode(pm, pa, rng) for _ in range(4000)]
        med = sorted(t for t, _ in res)[len(res) // 2]
        cells.append(f"{sum(f for _, f in res) / len(res):4.0%} flooded, {med:2d}")
    print(f"      {pm:.1f}         | " + " | ".join(cells))
print("p_make * p_accept is what counts: 0.8 x 0.2 (=0.16) floods far more often than 0.5 x 0.5 (=0.25),")
print("and the change from mostly flooded to mostly settled happens between products of about 0.1 and 0.4")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《依恋理论的计算模型与伴侣互动动力学》第 6 章「修复尝试:冲突回路中的阻尼器」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.23754715

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

BibTeX
@book{fan2026021,
  author    = {Fan, Yafu},
  title     = {Computational Attachment Theory and Couple Interaction Dynamics},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.23754715},
  url       = {https://doi.org/10.5281/zenodo.23754715}
}

本书其他章节结论