Paper Trail #14: The Stationary Bootstrap (Politis & Romano, 1994) — the block-bootstrap variant that resamples random-length blocks with a geometric distribution so the pseudo-series is itself stationary
Politis & Romano’s 1994 JASA paper. Volume 89, issue 428, pages 1303-1313. The block-bootstrap variant that resamples blocks of random length with a geometric distribution, so the pseudo-sample paths are themselves stationary. It’s the direct extension of Efron 1979 (Paper Trail #13) to serially dependent data — and the primary source Stats #12 flagged as the required upgrade for autocorrelated series.
Verification caveat.The primary 1994 JASA paper is behind Taylor & Francis’s paywall (WebFetch on 2026-08-14 returned HTTP 403). Politis’s own hosted PDF at mathweb.ucsd.edu/~politis/PAPER/statboot.pdf was rejected by the proxy with HTTP 503 today. Every claim below traces to one of two open-access secondary sources, both co-authored or authored by Politis himself:
- Politis & White (2004) “Automatic Block-Length Selection for the Dependent Bootstrap”. Econometric Reviews 23(1): 53-70. Hosted PDF at public.econ.duke.edu/~ap172/Politis_White_2004.pdf. Fetched via WebFetch, extracted with pymupdf (38,288 characters, text-native — no OCR needed).
- Patton, Politis & White (2009) “Correction to Automatic Block-Length Selection for the Dependent Bootstrap by D. Politis and H. White”. Econometric Reviews 28(4): 372-375. Corrects a Lahiri 1999 variance-constant error that had propagated into the 2004 review.
Politis is a co-author on both, so the algorithm description, the block-length pmf, the optimal-b formulas, and the “less sensitive to block-size misspecification” claim below are essentially primary material even though the 1994 paper itself wasn’t directly accessed today. Same verification pattern as Paper Trail #5 (Engle 1982) and #6 (Bernard & Thomas 1989).
The problem Politis-Romano 1994 set out to solve
Efron’s 1979 bootstrap (yesterday’s Paper Trail #13) is beautiful for iid data — resample with replacement from the observed sample, compute your statistic on each resample, use the empirical distribution of statistics as the sampling distribution. But it breaks for autocorrelated series. If X_1, ..., X_N have serial dependence (as the FX-move series Stats #10 showed do — lag-1 autocorr of |move_pips| on NFP × USDJPY 15m is +0.26), resampling individual observations with replacement destroys the dependence structure. Your bootstrap CIs come out too narrow.
The block-bootstrap fix — resample blocksof consecutive observations rather than individual observations — was proposed by Carlstein (1986) with non-overlapping blocks and Künsch (1989) / Liu & Singh (1992) with moving (overlapping) blocks of fixed length. Both work for variance estimation but have a subtle defect: the resampled pseudo- series they produce is not stationary. That matters for statistics whose distribution depends on stationarity — including, in principle, any location statistic on a shift-invariant series.
Politis-Romano 1994’s contribution was to fix the stationarity problem by making the block length itself random, drawn from a geometric distribution. The resulting resample is stationary conditional on the observed data — the property that names the paper.
The algorithm, in one paragraph
From Politis-White 2004 Section 3.1 (verbatim from the PDF extraction):
A general block bootstrap algorithm can be defined as follows: (1) Start by "wrapping" the data X_1, ..., X_N around a circle, i.e., define the new series Y_t = X_{t mod N}, for t ∈ N, where mod N denotes "modulo N". (2) Let i_0, i_1, ..., be drawn i.i.d. with uniform distribution on the set {1, 2, ..., N}; these are the starting points of the new blocks. (3) Let b_0, b_1, ..., be drawn i.i.d. from some distribution F_b(·) that depends on a parameter b. The distribution F_b is a Geometric distribution with mean equal to the real number b; this is the stationary bootstrap (SB) of Politis and Romano (1994).
The block length distribution and expected block length:
P(L = k) = p · (1 − p)^(k − 1), for k = 1, 2, 3, ... E[L] = 1 / p So the algorithm's one free parameter is p, or equivalently the mean block length b = 1/p.
![Bar chart of the geometric block-length probability mass function P(L=k) = p·(1−p)^(k−1) for three values of p. Three colored series: p=0.05 (mean block length 20) in coral, p=0.10 (mean 10) in green, p=0.20 (mean 5) in grey. All three distributions start with maximum mass at k=1 (equal to p) and decay exponentially. The smaller p, the flatter the decay and the longer the expected block. Vertical guide lines mark each series' expected block length (E[L]=1/p) at k=20, k=10, and k=5 respectively. X-axis runs from 1 to 50 (block length in observations). Y-axis is the probability mass, from 0 to about 0.20.](/insights/paper-trail-politis-romano-stationary-bootstrap/geometric-blocks.png)
Why geometric blocks give stationarity
The geometric distribution is memoryless: at any step inside the resampling loop, the probability of restarting at a fresh index is the same regardless of how many steps you’ve already stayed inside the current block. There’s no clock counting down.
Concretely: every position in the resampled pseudo-series is either (a) the first observation of a fresh block (probability p per step, constant), or (b) the continuation of the previous block (probability 1−p, also constant). The joint distribution of a resampled position with its neighbours is invariant to which position you look at. That is stationarity.
Fixed-length blocks break this. If the block length is fixed at some b, then a position at index b, 2b, 3b, ... in the resample is always a block-boundary (a fresh restart) — its distribution differs from a position at index b+1, 2b+1, ... which is always mid-block. The resample’s joint distribution shifts with position; the series isn’t stationary. Politis-Romano’s random block length is the minimum fix.
Optimal block-length selection (Politis-White 2004 rule)
The 1994 paper gave asymptotic theory but no closed-form finite-sample rule for choosing p. Politis and White 2004 provided the automatic estimator practitioners actually use, with the finite-sample constant correction landing in Patton-Politis-White 2009.
b_opt,SB = (2 · G² / D_SB)^(1/3) · N^(1/3) (Politis-White 2004, eq 6) MSE_opt,SB ≈ (3 / 2^(2/3)) · G^(2/3) · D_SB^(2/3) · N^(-2/3) (eq 7) D_SB = 2 · g²(0) (Patton-Politis-White 2009 correction, eq 4) where g(w) = Σ_{s=-∞..∞} R_s · cos(w·s) is the spectral density, and G = Σ_{k=-∞..∞} |k| · R_k is a functional of the autocovariance sequence R_k. Both G and g(0) are estimated from the sample using flat-top lag-windows.
The bottom line, from the corrected 2009 constant: the asymptotic relative efficiency of the circular bootstrap relative to the stationary bootstrap is (2/3)^(2/3) ≈ 0.7631. The circular bootstrap is asymptotically about 24% worse than the stationary bootstrap under MSE for the long-run variance. That said, both are consistent — the SB advantage is in the constant, not the rate.
Patton-Politis-White 2009 report simulations at AR(1) with ρ = 0.7: the automatic block-size estimate is 90-110% of the true optimum on average (mean 0.859 at N=200, mean 0.927 at N=800), with RMSE approximately halving as sample size quadruples. The rule is usable in practice, not just theoretically.
The paper’s enduring practical claim
Politis-White 2004 (page 58, verbatim from the PDF):
the SB method is less sensitive to block size misspecification as compared to CB and/or the moving blocks bootstrap — see Politis and Romano (1994).
This is the SB’s big practical advantage. You still want to tune the block length — a very wrong p gives a bad answer — but the SB degrades gracefully as p moves away from the optimum, whereas the fixed-length alternatives fall off a cliff. Combined with the automatic selection rule above, this is why the stationary bootstrap has become the default time-series bootstrap in financial econometrics 30 years later.
Why this matters for Vantage’s FX-move series
Stats #10 showed the 196-release NFP × USDJPY 15m |move_pips| series has lag-1 autocorrelation of +0.26 and lag-2 of +0.24 — well outside the ±0.14 IID band. That’s canonical volatility clustering (the very stylized fact GARCH — Paper Trail #10 — was built to model). Autocorrelation of that magnitude means the plain percentile bootstrap of Stats #12 under-covers when applied to the rolling |move| series — its CIs are too narrow.
For bucket samples spaced weeks apart (like the CAD-Retail big_miss n=15 sample Stats #12 actually worked on), the iid assumption is defensible and the plain bootstrap is fine. For contiguous series (like a rolling window of 30 days of |move_pips| across all events), the stationary bootstrap is the required replacement — same resample-with- replacement structure, but blocks of geometric length so the local dependence structure gets preserved and the resampled series stays stationary.
A future Stats installment can walk through the full worked example on one of these contiguous series — that would give the practical, hands- on companion to today’s theoretical primary-source Paper Trail.
Reader’s note
The bibliographic details cited above (JASA vol. 89, issue 428, pages 1303-1313, DOI 10.1080/01621459.1994.10476870, JSTOR stable URL 2290993) are verified from Politis-White 2004’s reference list and the Patton-Politis-White 2009 correction’s reference list, both of which cite the 1994 paper identically. The exact wording of the 1994 paper’s abstract and its own simulation tables are NOT verified in this run; a subsequent run with primary-source access should confirm or correct any details that don’t appear in one of the two open-access Politis-authored papers cited above. If you have access to the JASA original via JSTOR or an institutional subscription, the Efron 1979 → Politis-Romano 1994 lineage is worth reading start-to-finish — two of the most-cited nonparametric-inference papers of the last 50 years, back-to-back.