关于「抗拒的棘轮:为什么早期施压适得其反」,《分手之后的记忆、信号与复合》给出的定量结论是什么?

结论:第三章加入抗拒棘轮:第一个月每周联系三次,会让第 60 天一条平静消息被接受的机会从 0.803 降到 0.017。

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

English version

对照数据表

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

contacts a weekwelcome chance (day 60)lasting R
0.00.8030.000
0.50.6720.098
1.00.4880.236
2.00.1400.667
3.00.0171.119
7.00.0002.649
3 a week but only on days 31 to 45: 0.582
查看完整验算程序
# Chapter 3. p05: The reactance ratchet. The receiving partner starts
# with N = 1.5 (tn 17.5 days) and P = 1.0 (tp 75 days). Each unwanted
# contact adds 0.25 to N if it arrives while N > P, and 0.05 otherwise;
# a share 0.4 of each addition goes instead into a lasting resistance R
# that fades with a time constant of 365 days (the ratchet). Contacts
# come on random days in days 0 to 30 at f a week; then silence. On day
# 60 one calm message is sent; the chance it is welcomed is
# 1 / (1 + exp(-6 (P - N - R) + 1)). 5,000 runs per row, seed 92.
# The last row moves 3 contacts a week to days 31 to 45 instead.
import random
from math import exp

TN, TP, TR, K = 17.5, 75.0, 365.0, 6.0

def run(rng, per_week, first_day=0, last_day=30, ask_day=60):
    n, p, r = 1.5, 1.0, 0.0
    for day in range(ask_day):
        if first_day <= day < last_day and rng.random() < per_week / 7:
            add = 0.25 if n > p else 0.05
            n += 0.6 * add
            r += 0.4 * add
        n *= exp(-1 / TN)
        p *= exp(-1 / TP)
        r *= exp(-1 / TR)
    return 1 / (1 + exp(-K * (p - n - r) + 1)), r

if __name__ == "__main__":
    rng = random.Random(92)
    print("   contacts a week   welcome chance (day 60)   lasting R")
    base = None
    for f in (0, 0.5, 1, 2, 3, 7):
        out = [run(rng, f) for _ in range(5000)]
        w = sum(o[0] for o in out) / len(out)
        base = w if base is None else base
        print("   {:15.1f}   {:23.3f}   {:9.3f}".format(
            f, w, sum(o[1] for o in out) / len(out)))
    late = [run(rng, 3, 31, 46) for _ in range(5000)]
    print("   3 a week but only on days 31 to 45: {:.3f}".format(
        sum(o[0] for o in late) / len(late)))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《关系断裂生存分析、断联期记忆衰减与复联博弈窗口》第 3 章「抗拒的棘轮:为什么早期施压适得其反」(版本 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}
}

本书其他章节结论