Markov paths on the Poisson-Delaunay graph with applications to routeing in mobile networks

DOI10.1239/aap/1013540019zbMath0959.60008OpenAlexW1964143376MaRDI QIDQ4493504

Konstantin Tchoumatchenko, Sergei Zuyev, François Baccelli

Publication date: 19 September 2000

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1239/aap/1013540019

zbMATH Keywords

shortest pathPoisson processDelaunay triangulationmobile networksroutingVoronoi tessellationfirst-passage percolation

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Discrete-time Markov processes on general state spaces (60J05) Communication networks in operations research (90B18) Paths and cycles (05C38) Distance in graphs (05C12) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)

Related Items

Walking in a Planar Poisson–Delaunay Triangulation: Shortcuts in the Voronoi Path ⋮ Moderate deviations for shortest-path lengths on random segment processes ⋮ Navigation on a Poisson point process ⋮ Asymptotic properties of Euclidean shortest-path trees in random geometric graphs ⋮ Connected spatial networks over random points and a route-length statistic ⋮ Coalescence of Euclidean geodesics on the Poisson-Delaunay triangulation ⋮ Surface order scaling in stochastic geometry ⋮ Geodesics and flows in a Poissonian city ⋮ Expected length of the Voronoi path in a high dimensional Poisson-Delaunay triangulation ⋮ Scaling limits for shortest path lengths along the edges of stationary tessellations ⋮ Stretch factor in a planar Poisson–Delaunay triangulation with a large intensity ⋮ Traffic flow densities in large transport networks ⋮ Elongated Poisson-Voronoi cells in an empty half-plane ⋮ First Passage Percolation on Random Geometric Graphs and an Application to Shortest-Path Trees