On the distribution of typical shortest-path lengths in connected random geometric graphs

DOI10.1007/S11134-012-9276-ZMaRDI QIDQ383262zbMATH OpenOpenAlexFDO

Authors Catherine Gloaguen, David Werner Neuhäuser, Christian Hirsch, Volker Schmidt

Publication date 25 November 2013

Published in Queueing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11134-012-9276-z

zbMATH Keywords

point processshortest pathscaling limit{\(\beta\)}-skeletonaggregate tessellationpalm mark distributionstochastic monotonicity

Mathematics Subject Classification ID

Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Geometric probability and stochastic geometry (60D05) Limit theorems in probability theory (60F99) Stochastic network models in operations research (90B15)

Recommendations

• Asymptotic properties of Euclidean shortest-path trees in random geometric graphs
• Scaling limits for shortest path lengths along the edges of stationary tessellations
• Limit theory for the Gilbert graph
• First passage percolation on random geometric graphs and an application to shortest-path trees
• Distribution of components in the \(k\)-nearest neighbour random geometric graph for \(k\) below the connectivity threshold

Cites work

• scientific article; zbMATH DE number 2086250 (Why is no real title available?)
• scientific article; zbMATH DE number 786469 (Why is no real title available?)
• An Introduction to the Theory of Point Processes
• Connected spatial networks over random points and a route-length statistic
• Densities of shortest path lengths in spatial stochastic networks
• On a Voronoi aggregative process related to a bivariate Poisson process
• Probability. Theory and examples.
• Random Geometric Graphs
• Scaling limits for shortest path lengths along the edges of stationary tessellations
• Statistical Analysis and Modelling of Spatial Point Patterns
• Stochastic and Integral Geometry
• Superposition of planar voronoi tessellations
• The distributions of the smallest disks containing the Poisson-Voronoi typical cell and the Crofton cell in the plane
• Theory of Random Sets

Cited in

(12)

• First passage percolation on random geometric graphs and an application to shortest-path trees
• Scaling limits for shortest path lengths along the edges of stationary tessellations
• Constrained minimum passage time in random geometric graphs
• Connected spatial networks over random points and a route-length statistic
• Limit theory for the Gilbert graph
• Asymptotic properties of Euclidean shortest-path trees in random geometric graphs
• The Distribution of Path Lengths On Directed Weighted Graphs
• The scaling limit of Poisson-driven order statistics with applications in geometric probability
• Ratio limits and simulation algorithms for the Palm version of stationary iterated tessellations
• A stochastic model for multi-hierarchical networks
• Connectivity of random geometric graphs related to minimal spanning forests
• Parametric modeling of sparse random trees using 3D copulas

This page was built for publication: On the distribution of typical shortest-path lengths in connected random geometric graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q383262)