Paperlane

no. 6 · Monday 2 November 2026

Fluctuation bounds for rotationally invariant first-passage percolation

Scott Armstrong and Ahmed Bou-Rabee

math.PR · code · ∎ lean 20 sorry · 19 pp

Abstract

We prove that in rotationally invariant first-passage percolation on $\mathbb{R}^d$ with $d\geq2$, the passage time $T_n$ over a distance $n$ satisfies $\mathbb{E}[\exp(|T_n-μn|/n^{\frac{1}{2}(1-\varepsilon)})]\leq C$ for some $\varepsilon>0$, where $μ$ is the time constant. This implies that its variance is at most a constant times $n^{1-\varepsilon}$, the bound that Basu, Sidoravicius and Sly proved in the planar case. As in their work, our argument is an induction on the scale, but in place of their proof that the geodesic is chaotic, we use the averaging argument of Benjamini, Kalai and Schramm together with a logarithmic improvement of the Efron-Stein inequality due to Benaïm and Rossignol.

code
github.com/nitromannitol/FPP-variance ∎ Lean project (lakefile.lean, lean-toolchain) builds with 20 sorry warnings at cfe58d1, checked 2026-11-02 build details
comments
19 pages, 4 figures; Lean 4 formalization at https://github.com/nitromannitol/FPP-variance
fields
Probability
pdf ↗ page arXiv:2610.42124 ↗