Abstract
Let us consider Euclidean first-passage percolation on the Poisson-Delaunay triangulation. We prove almost sure coalescence of any two semi-infinite geodesics with the same asymptotic direction. The proof is based on an argument of Burton-Keane type and makes use of the concentration property for shortest-path lengths in the considered graphs. Moreover, by considering the specific example of the relative neighborhood graph, we illustrate that our approach extends to further well-known graphs in computational geometry. As an application, we show that the expected number of semi-infinite geodesics starting at a given vertex and leaving a disk of a certain radius grows at most sublinearly in the radius.
| Dokumententyp: | Zeitschriftenartikel |
|---|---|
| Fakultät: | Mathematik, Informatik und Statistik > Mathematik |
| Themengebiete: | 500 Naturwissenschaften und Mathematik > 510 Mathematik |
| ISSN: | 1350-7265 |
| Sprache: | Englisch |
| Dokumenten ID: | 66405 |
| Datum der Veröffentlichung auf Open Access LMU: | 19. Jul. 2019 12:19 |
| Letzte Änderungen: | 13. Aug. 2024 12:43 |
