First passage percolation, local uniqueness for interlacements and capacity of random walk
Preprint
Abstract
The study of first passage percolation (FPP) for the random interlacements model has been initiated in arXiv:2112.12096, where it is shown that on $\mathbb{Z}^d$, $d\geq 3$, the FPP distance is comparable to the graph distance with high probability. In this article, we give an asymptotically sharp lower bound on this last probability, which additionally holds on a large class of transient graphs with polynomial volume growth and polynomial decay of the Green function. When considering the interlacement set in the low-intensity regime, the previous bound is in fact valid throughout the near-critical phase. In low dimension, we also present two applications of this FPP result: sharp large deviation bounds on local uniqueness of random interlacements, and on the capacity of a random walk in a ball.
Keywords
All Related Versions
This publication has 40 references indexed in Scilit:
- Geometry of Gaussian free field sign clusters and random interlacementsProbability Theory and Related Fields, 2024
- On the cost of the bubble set for random interlacementsInventiones Mathematicae, 2023
- The Chemical Distance in Random Interlacements in the Low-Intensity RegimeCommunications in Mathematical Physics, 2023
- Critical exponents for a percolation model on transient graphsInventiones Mathematicae, 2022
- Disconnection, random walks, and random interlacementsProbability Theory and Related Fields, 2015
- Harnack inequalities on weighted graphs and some applications to the random conductance modelProbability Theory and Related Fields, 2015
- On the fragmentation of a torus by random walkCommunications on Pure and Applied Mathematics, 2011
- Decoupling inequalities and interlacement percolation on G×ℤInventiones Mathematicae, 2011
- Random walks on discrete cylinders and random interlacementsProbability Theory and Related Fields, 2008
- Foundations of Modern Potential Theory1972