Coalescence of Euclidean geodesics on the Poisson-Delaunay triangulation

DOI10.3150/17-BEJ943zbMath1429.60068arXiv1603.05171OpenAlexW2798853240MaRDI QIDQ1708982

Christian Hirsch, David Coupier

Publication date: 27 March 2018

Published in: Bernoulli (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1603.05171

zbMATH Keywords

coalescencePoisson point processDelaunay triangulationfirst-passage percolationsublinearityrelative neighborhood graphBurton-Keane argument

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Coalescent processes (60J90)

Cites Work

• Unnamed Item
• Unnamed Item
• Delaunay graphs are almost as good as complete graphs
• Classes of graphs which approximate the complete Euclidean graph
• Euclidean models of first-passage percolation
• Sublinearity of the number of semi-infinite branches for geometric random trees
• Geodesics and spanning trees for Euclidean first-passage percolation.
• Concentration of measure and isoperimetric inequalities in product spaces
• Geodesics in two-dimensional first-passage percolation
• Moderate deviations for shortest-path lengths on random segment processes
• Asymptotics for First-Passage Times on Delaunay Triangulations
• Markov paths on the Poisson-Delaunay graph with applications to routeing in mobile networks
• The 2D‐directed spanning forest is almost surely a tree
• Stretch factor in a planar Poisson–Delaunay triangulation with a large intensity
• Semi-Infinite Paths of the Two-Dimensional Radial Spanning Tree
• Descending chains, the lilypond model, and mutual-nearest-neighbour matching

This page was built for publication: Coalescence of Euclidean geodesics on the Poisson-Delaunay triangulation