Asymptotic properties of Euclidean shortest-path trees in random geometric graphs

DOI10.1016/j.spl.2015.08.012zbMath1356.60018OpenAlexW1130790355MaRDI QIDQ900933

Christian Hirsch, C. Gloaguen, David Neuhäuser, Volker Schmidt

Publication date: 23 December 2015

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.spl.2015.08.012

zbMATH Keywords

total lengthCox processVoronoi tessellationrandom geometric graphbackbone lengthshortest-path tree

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Random graphs (graph-theoretic aspects) (05C80)

Related Items (2)

Moderate deviations for shortest-path lengths on random segment processes ⋮ A Model for Optimal Human Navigation with Stochastic Effects

Cites Work

• Unnamed Item
• Connected spatial networks over random points and a route-length statistic
• Geodesics and spanning trees for Euclidean first-passage percolation.
• The time constant and critical probabilities in percolation models
• A Parametric Copula Approach for Modelling Shortest-Path Trees in Telecommunication Networks
• Optimal paths on the space-time SINR random graph
• Stochastic and Integral Geometry
• Markov paths on the Poisson-Delaunay graph with applications to routeing in mobile networks
• An Introduction to the Theory of Point Processes
• Parametric Modeling of Sparse Random Trees Using 3D Copulas
• First Passage Percolation on Random Geometric Graphs and an Application to Shortest-Path Trees
• Semi-Infinite Paths of the Two-Dimensional Radial Spanning Tree

This page was built for publication: Asymptotic properties of Euclidean shortest-path trees in random geometric graphs