What does Strata Commons and Sinking-Fund Ruin conclude, in numbers, about “The Walking-Distance Gradient around Rail Stations: Reading a Meta-Analysis, Fitting and Confounding”?
Answer: Chapter 4 shows that the meta-analytic band premium of 0.042 is not the premium at the door, and that omitting highways inflates the station effect, the estimated gap rising from 0.0533 to 0.0827.
Scope of the numbers: All data are synthetic or illustrative, all calculations come from its programs, and it is general analysis, not legal, tax or investment advice; statutes await human review. Boxes separate evidence, runnable calculations (20 programs), classical sources and 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.0533, 0.0827
| form | hwy | RSS | AIC | gap 200 m vs 1,500 m | extra |
| line | no | 1.4716 | -1975.9 | 0.0827 | |
| line | yes | 1.2646 | -2028.5 | 0.0533 | |
| exp | no | 1.4194 | -1986.9 | 0.0989 | s=900 |
| exp | yes | 1.2187 | -2039.8 | 0.0686 | s=650 |
| ramp | no | 1.3805 | -1994.9 | 0.1021 | k=300,1,100 |
| ramp | yes | 1.1748 | -2051.0 | 0.0624 | k=600,700 |
| true gap 200 m vs 1,500 m: 0.0800 |
Show the full program
# Chapter 4. p42: fitting a walking-distance decay to synthetic listings.
# 360 synthetic listings, seed 3356. True log-price premium: 0.08 up to
# 300 m walk, falling linearly to 0 at 1,100 m, nothing beyond. A
# highway-access dummy adds 0.05 and is likelier near the station
# (probability falls with distance), the confounder Debrezion et al.
# report: adding other accessibility variables lowers the rail effect.
# Noise sd 0.06. Three forms are fitted by least squares (grid search
# for the nonlinear knot or scale, normal equations for the rest):
# semi-log line a + b d (+ c hwy)
# exponential a + p0 exp(-d / s) (+ c hwy)
# two-knot ramp a + p0 ramp(d; k1, k2) (+ c hwy)
# AIC = n ln(RSS / n) + 2 k. All values illustrative.
import math
import random
def solve(xs, ys):
m = len(xs[0])
a = [[math.fsum(r[i] * r[j] for r in xs) for j in range(m)]
for i in range(m)]
b = [math.fsum(r[i] * y for r, y in zip(xs, ys)) for i in range(m)]
for c in range(m):
piv = max(range(c, m), key=lambda r: abs(a[r][c]))
a[c], a[piv] = a[piv], a[c]
b[c], b[piv] = b[piv], b[c]
for r in range(m):
if r != c:
f = a[r][c] / a[c][c]
a[r] = [u - f * v for u, v in zip(a[r], a[c])]
b[r] = b[r] - f * b[c]
coef = [b[i] / a[i][i] for i in range(m)]
rss = math.fsum((y - math.fsum(q * w for q, w in zip(r, coef))) ** 2
for r, y in zip(xs, ys))
return coef, rss
def ramp(d, k1, k2):
return 1.0 if d <= k1 else (0.0 if d >= k2 else (k2 - d) / (k2 - k1))
def data():
rng = random.Random(3356)
rows = []
for _ in range(360):
d = rng.uniform(50.0, 2000.0)
hwy = 1.0 if rng.random() < 1.0 - d / 2400.0 else 0.0
y = 0.08 * ramp(d, 300.0, 1100.0) + 0.05 * hwy
rows.append((d, hwy, y + rng.gauss(0.0, 0.06)))
return rows
def fit(rows, form, control):
best = None
grid = {"line": [None],
"exp": [float(s) for s in range(100, 2001, 50)],
"ramp": [(float(k1), float(k2)) for k1 in range(0, 1001, 50)
for k2 in range(k1 + 100, 2001, 50)]}[form]
for g in grid:
xs = []
for d, hwy, _ in rows:
if form == "line":
f = d / 1000.0
elif form == "exp":
f = math.exp(-d / g)
else:
f = ramp(d, g[0], g[1])
xs.append([1.0, f, hwy] if control else [1.0, f])
coef, rss = solve(xs, [r[2] for r in rows])
if best is None or rss < best[0]:
best = (rss, coef, g)
return best
def effect(form, coef, g, d):
if form == "line":
return coef[1] * d / 1000.0
if form == "exp":
return coef[1] * math.exp(-d / g)
return coef[1] * ramp(d, g[0], g[1])
if __name__ == "__main__":
rows = data()
n = len(rows)
print("form hwy RSS AIC gap 200 m vs 1,500 m extra")
for form in ("line", "exp", "ramp"):
for control in (False, True):
rss, coef, g = fit(rows, form, control)
k = len(coef) + (0 if form == "line" else
(1 if form == "exp" else 2))
aic = n * math.log(rss / n) + 2 * k
gap = effect(form, coef, g, 200.0) - effect(form, coef, g,
1500.0)
extra = ("" if g is None else
("s={:.0f}".format(g) if form == "exp" else
"k={:.0f},{:,.0f}".format(g[0], g[1])))
print("{:<5} {:<4} {:.4f} {:>8.1f} {:>20.4f} {}".format(
form, "yes" if control else "no", rss, aic, gap, extra))
print("true gap 200 m vs 1,500 m: {:.4f}".format(
0.08 * (ramp(200.0, 300.0, 1100.0) - ramp(1500.0, 300.0, 1100.0))))Single source and citation
Fan, Y. (2026). Strata-Title Commons Games, Sinking-Fund Ruin Actuarial Science and High-Intent Property Lead Routing (Version 1.0.0), Chapter 4: The Walking-Distance Gradient around Rail Stations: Reading a Meta-Analysis, Fitting and Confounding. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-335 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026335,
author = {Fan, Yafu},
title = {Strata-Title Commons Games, Sinking-Fund Ruin Actuarial Science and High-Intent Property Lead Routing},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · The Game of Late Payment: Conditional Cooperation, the Sanction Threshold and the Critical Arrears Rate
- Chapter 2 · The Actuarial Ruin of a Sinking Fund: Lumpy Works, Heavy-Tailed Costs and Finite-Horizon Ruin
- Chapter 3 · The Discount for a Delayed Strata Title: Risk-Neutral Pricing and Censored Data
- Chapter 5 · Routing High-Intent Leads: Response Decay, Erlang Queues and Fair Rotation
- Chapter 6 · Central Control against Diverted Leads: the Inspection Game, Sampled Call-Backs and Tamper-Evident Logs
- Chapter 7 · Eastern and Western Classics Examined: Mencius on the Well-Field, Aristotle on Common Property
- Chapter 8 · Closing the Empirical Loop: the Quarterly Sinking-Fund Check-Up, the Monthly Routing Review and Pre-Registered Refutation