What does Memory, Signals and Reunion after a Rupture conclude, in numbers, about “Two Resting States: Gottman's Difference Equations”?

Answer: Without repair, 0.184 of talks end in the hostile state; with repair succeeding 30% of the time, 0.128; at 60%, 0.100; at 90%, 0.096. The ratios behave less simply. Talks that end well have a ratio of 4.02 without repair and 6.82 with frequent repair; talks that end badly have 2.75 and 5.10. A bad talk with frequent repair can thus show a higher ratio than a good talk without it. The ratio is an outcome of a couple's dynamics and depends on how the counting is done; it is not a threshold that by itself decides a couple's fate.

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.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

Key formula

\[W_{t+1} = a + r W_t + I(H_t), \qquad H_{t+1} = a + r H_t + I(W_{t+1}).\]
Show the full program
# 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))

Single source and citation

Fan, Y. (2026). Relationship Rupture Survival Analysis, No-Contact Memory Decay and Reconciliation Game Windows (Version 1.0.0), Chapter 6: Two Resting States: Gottman's Difference Equations. 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