On the distribution of typical shortest-path lengths in connected random geometric graphs
DOI10.1007/s11134-012-9276-zzbMath1275.60018OpenAlexW2064729727MaRDI QIDQ383262
C. Gloaguen, David 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
shortest pathscaling limitpoint processstochastic monotonicity{\(\beta\)}-skeletonaggregate tessellationpalm mark distribution
Geometric probability and stochastic geometry (60D05) Stochastic network models in operations research (90B15) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Limit theorems in probability theory (60F99)
Related Items (6)
Cites Work
- Unnamed Item
- Unnamed Item
- Connected spatial networks over random points and a route-length statistic
- Scaling limits for shortest path lengths along the edges of stationary tessellations
- Stochastic and Integral Geometry
- On a Voronoi aggregative process related to a bivariate Poisson process
- Random Geometric Graphs
- The distributions of the smallest disks containing the Poisson-Voronoi typical cell and the Crofton cell in the plane
- An Introduction to the Theory of Point Processes
- Densities of Shortest Path Lengths in Spatial Stochastic Networks
- Superposition of planar voronoi tessellations
- Statistical Analysis and Modelling of Spatial Point Patterns
- Theory of Random Sets
- Probability
This page was built for publication: On the distribution of typical shortest-path lengths in connected random geometric graphs