Disjoint finite geodesics in first-passage percolation

Abstract

We investigate first-passage percolation on the lattice ${\mathbb{Z}}^d$ for dimensions $d\ge 2$. Each edge $e$ of the graph is assigned an independent copy of a non-negative random variable $\ddot{I}„$. We only assume $\hat{A}\P [\ddot{I}„=0]0$ is explicit) for the probability of having two disjoint geodesics between two pairs of neighbouring vertices at distance $n$. Additionally, under more specific assumptions on the distribution of $\ddot{I}„$, we obtain similar lower bounds for the probability of having two disjoint geodesics (except for their starting and ending points) between the same two vertices.