关于「把复合当作生存分析问题」,《分手之后的记忆、信号与复合》给出的定量结论是什么?
结论:第一章把复合当作带竞争事件的生存分析:在合成队列中,Kaplan-Meier 估计年底复合率为 0.456,真正复合的比例只有 0.311;并说明即使每对伴侣自身的机会不变,群体风险率也会因筛选降到最初的 0.355。
数据口径:书中的参数均为示意或合成;全部计算由书中程序生成;本书不是心理咨询或治疗,也不是挽回任何人的操作手册,对方的决定属于对方。 第一章把复合当作带竞争事件的生存分析:在合成队列中,Kaplan-Meier 估计年底复合率为 0.456,真正复合的比例只有 0.311;并说明即使每对伴侣自身的机会不变,群体风险率也会因筛选降到最初的 0.355。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.311, 0.456
| by day | Kaplan-Meier | cumulative incidence | observed share |
|---|---|---|---|
| 30 | 0.137 | 0.128 | 0.128 |
| 90 | 0.286 | 0.241 | 0.240 |
| 180 | 0.379 | 0.290 | 0.289 |
| 365 | 0.456 | 0.311 | 0.310 |
| reconciliations in the first 90 days: 0.775 of all | |||
| couples who moved on within the year: 0.597 |
查看完整验算程序
# Chapter 1. p01: Who gets back together, and how to count it. A
# synthetic cohort of 2,000 former couples is followed for 365 days.
# Two events compete: reconciliation, and "moving on" (a new partner,
# after which reconciliation is treated as no longer possible). 30% of
# couples are ambivalent (reconciliation hazard 1/60 a day); the rest
# are settled (1/1500 a day). Moving on has hazard 1/200 a day for all.
# Kaplan-Meier treats moving on as censoring and so overstates the
# chance of reconciliation; the cumulative incidence does not. Seed 92.
import random
N, DAYS, P_AMB, H_AMB, H_SET, H_MOVE = 2000, 365, 0.30, 1 / 60, \
1 / 1500, 1 / 200
def cohort(rng):
out = []
for _ in range(N):
h = H_AMB if rng.random() < P_AMB else H_SET
tr, tm = rng.expovariate(h), rng.expovariate(H_MOVE)
if min(tr, tm) > DAYS:
out.append((DAYS, "censored"))
elif tr < tm:
out.append((tr, "reconciled"))
else:
out.append((tm, "moved on"))
return out
def km_and_ci(data, t_end):
data = sorted(data)
at_risk, s_km, s_all, ci = len(data), 1.0, 1.0, 0.0
for t, kind in data:
if t > t_end:
break
if kind == "reconciled":
ci += s_all / at_risk # Aalen-Johansen increment
s_km *= 1 - 1 / at_risk # KM: moving on as censoring
if kind != "censored":
s_all *= 1 - 1 / at_risk # survival from either event
at_risk -= 1
return 1 - s_km, ci
if __name__ == "__main__":
rng = random.Random(92)
data = cohort(rng)
print(" by day Kaplan-Meier cumulative incidence observed share")
for t in (30, 90, 180, 365):
km, ci = km_and_ci(data, t)
obs = sum(1 for d, k in data if k == "reconciled" and d <= t) / N
print(" {:6d} {:12.3f} {:20.3f} {:14.3f}".format(
t, km, ci, obs))
rec = [d for d, k in data if k == "reconciled"]
print(" reconciliations in the first 90 days: {:.3f} of all".format(
sum(1 for d in rec if d <= 90) / len(rec)))
print(" couples who moved on within the year: {:.3f}".format(
sum(1 for d, k in data if k == "moved on") / N))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《关系断裂生存分析、断联期记忆衰减与复联博弈窗口》第 1 章「把复合当作生存分析问题」(版本 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}
}