What does Memory, Signals and Reunion after a Rupture conclude, in numbers, about “The Reactance Ratchet: Why Early Pressure Backfires”?
Answer: Chapter 3 adds a reactance ratchet: three contacts a week in the first month cut the chance that a calm message on day 60 is welcome from 0.803 to 0.017.
Scope of the numbers: Its parameters are illustrative or synthetic; all calculations are generated by its programs; the book is not psychological counselling or therapy and not a manual for winning anyone back, and the other person's decision is theirs. Marked boxes separate published evidence, runnable Python calculations (16 programs), classical sources and the author's hypotheses.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 0.017, 0.803, 60
| contacts a week | welcome chance (day 60) | lasting R |
| 0.0 | 0.803 | 0.000 |
| 0.5 | 0.672 | 0.098 |
| 1.0 | 0.488 | 0.236 |
| 2.0 | 0.140 | 0.667 |
| 3.0 | 0.017 | 1.119 |
| 7.0 | 0.000 | 2.649 |
| 3 a week but only on days 31 to 45: 0.582 |
Show the full program
# 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)))Single source and citation
Fan, Y. (2026). Relationship Rupture Survival Analysis, No-Contact Memory Decay and Reconciliation Game Windows (Version 1.0.0), Chapter 3: The Reactance Ratchet: Why Early Pressure Backfires. 5D Library. https://doi.org/10.5281/zenodo.24090241
DOI: 10.5281/zenodo.24090241 · Read the monograph · 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}
}Other chapter answers in this book
- Chapter 1 · Reconciliation as a Survival Problem
- Chapter 2 · Two Memories Fading at Two Speeds
- Chapter 4 · Signals That Can Be Believed
- Chapter 5 · How Long Reunions Last
- Chapter 6 · Two Resting States: Gottman's Difference Equations
- Chapter 7 · "Mang", "Gu feng" and "Bai tou yin"
- Chapter 8 · Practice: Three Ways to Spend the Year, Measuring Oneself, and Too Few Cases