Maximal inequalities for real iid walks #
This file defines finite-horizon exceedance probabilities and proves Ottaviani's maximal inequality using first-exit events and fresh-start independence.
Reference: P. Billingsley, Convergence of Probability Measures, 2nd ed., 1999, Theorem 9.7 (Ottaviani's inequality).
maxTail ν m r = P(max_{k ≤ m} |S_k| > r): the genuine maximum probability, not a
supremum of marginal probabilities.
Equations
Instances For
Monotone in the length.
Antitone in the threshold.
Block translation: the maximum of |S_{a+k} - S_a|, k ≤ m, has the same exceedance
probability as the walk started at 0 (fresh start at the deterministic index a).
Ottaviani's maximal inequality for real iid sums (Node 6). If every partial sum S_j,
j ≤ m, lies in [-r, r] with probability ≥ 1/2 (the "safe remainder" hypothesis, applied to
the independent remainder S_m - S_k of length m - k ≤ m), then
P(max_{k ≤ m} |S_k| > 2 r) ≤ 2 P(|S_m| > r).