An upper bound on geodesic length in 2D critical first-passage percolation
arXiv:2309.04454 · doi:10.1214/25-EJP1397
Abstract
We consider i.i.d. first-passage percolation (FPP) on the two-dimensional square lattice, in the critical case where edge-weights take the value zero with probability . Critical FPP is unique in that the Euclidean lengths of geodesics are superlinear -- rather than linear -- in the distance between their endpoints. This fact was speculated by Kesten in 1986 but not confirmed until 2019 by Damron and Tang, who showed a lower bound on geodesic length that is polynomial with degree strictly greater than . In this paper, we establish the first nontrivial upper bound. Namely, we prove that for a large class of critical edge-weight distributions, the shortest geodesic from the origin to a box of radius uses at most edges with high probability, for any . Here is the polychromatic 3-arm probability from classical Bernoulli percolation; upon inserting its conjectural asymptotic, our bound converts to . In any case, it is known that for some , so our bound gives an exponent strictly less than . In the special case of Bernoulli() edge-weights, we replace the additional factor of with a constant and give an expectation bound.
76 pages, 16 figures. Version 3: fixed typos
References in corpus (8)
- On monochromatic arm exponents for 2D critical percolation
- Shortest-Path Fractal Dimension for Percolation in Two and Three Dimensions
- Relations between invasion percolation and critical percolation in two dimensions
- Some geometric critical exponents for percolation and the random-cluster model
- Pair Connectedness and Shortest Path Scaling in Critical Percolation
- Shortest path and Schramm-Loewner Evolution
- Planar lattices do not recover from forest fires
- The sizes of the pioneering, lowest crossing and pivotal sites in critical percolation on the triangular lattice