Geodesics in first-passage percolation cross any pattern
Résumé
In first-passage percolation, one places nonnegative i.i.d. random variables (T (e)) on the edges of Z d. A geodesic is an optimal path for the passage times T (e). Consider a local property of the time environment. We call it a pattern. We investigate the number of times a geodesic crosses a translate of this pattern. Under mild conditions, we show that, apart from an event with exponentially small probability, this number is linear in the distance between the extremities of the geodesic.
Domaines
Probabilités [math.PR]Origine | Fichiers produits par l'(les) auteur(s) |
---|