On the distribution of typical shortest-path lengths in connected random geometric graphs
DOI10.1007/S11134-012-9276-ZzbMATH Open1275.60018OpenAlexW2064729727MaRDI QIDQ383262FDOQ383262
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
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
point processshortest pathscaling limit{\(\beta\)}-skeletonaggregate tessellationpalm mark distributionstochastic monotonicity
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)
Cites Work
- An Introduction to the Theory of Point Processes
- Random Geometric Graphs
- Statistical Analysis and Modelling of Spatial Point Patterns
- Theory of Random Sets
- Probability. Theory and examples.
- Stochastic and Integral Geometry
- Connected spatial networks over random points and a route-length statistic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Scaling limits for shortest path lengths along the edges of stationary tessellations
- On a Voronoi aggregative process related to a bivariate Poisson process
- The distributions of the smallest disks containing the Poisson-Voronoi typical cell and the Crofton cell in the plane
- Densities of shortest path lengths in spatial stochastic networks
- Superposition of planar voronoi tessellations
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
- The Distribution of Path Lengths On Directed Weighted Graphs
- Limit theory for the Gilbert graph
- Asymptotic properties of Euclidean shortest-path trees in random geometric graphs
- Ratio limits and simulation algorithms for the Palm version of stationary iterated tessellations
- The scaling limit of Poisson-driven order statistics with applications in geometric probability
- 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)
