Rotationally invariant first passage percolation: Breaking the $n/\log n$ variance barrier
Riddhipratim Basu, Vladas Sidoravicius, Allan Sly

TL;DR
This paper proves that for rotationally invariant Riemannian first passage percolation in the plane, the variance of passage times grows slower than previously known, specifically as a polynomial rate less than linear.
Contribution
It introduces a novel multi-scale approach to show polynomial improvement in the variance bound for a class of rotationally invariant FPP models.
Findings
Variance of passage times is bounded by $O(n^{1- ext{positive constant}})$.
Geodesics exhibit disorder chaos upon small resampling of randomness.
Multi-scale analysis leads to polynomial variance bounds in rotationally invariant FPP.
Abstract
For first passage percolation (FPP) on Euclidean lattices with , it is expected that the variance of the first passage time between two points grows sublinearly in the distance with a universal exponent strictly smaller than . Following Kesten's upper bound (Ann. Appl. Probab., 1993) on the variance, Benjamini, Kalai and Schramm (Ann. Probab., 2003) used hypercontractivity to obtain an improvement of a factor of when passage times take two values with equal probability. This was later extended to more general classes of passage time distributions. However, unlike in exactly solvable planar models in last passage percolation where the variance is known to be , the best known upper bound for the variance of passage times has remained in all non-trivial variants of FPP. For a class of rotationally invariant Riemannian…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
