Densities of Shortest Path Lengths in Spatial Stochastic Networks

DOI10.1080/15326349.2011.542735zbMath1262.90030MaRDI QIDQ4906411

C. Gloaguen, Volker Schmidt, Florian Voss, Frank Fleischer

Publication date: 11 February 2013

Published in: Stochastic Models (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15326349.2011.542735

Mathematics Subject Classification ID

62M30: Inference from spatial processes

65C05: Monte Carlo methods

90B18: Communication networks in operations research

90B15: Stochastic network models in operations research

60G55: Point processes (e.g., Poisson, Cox, Hawkes processes)

Related Items

Ratio limits and simulation algorithms for the Palm version of stationary iterated tessellations, On the distribution of typical shortest-path lengths in connected random geometric graphs, A stochastic model for multi-hierarchical networks, Scaling limits for shortest path lengths along the edges of stationary tessellations

Cites Work

• Unnamed Item
• Unnamed Item
• Simulation of typical Cox-Voronoi cells with a special regard to implementation tests
• Distributional properties of the typical cell of stationary iterated tessellations
• Analysis of shortest paths and subscriber line lengths in telecommunication access networks
• Scaling limits for shortest path lengths along the edges of stationary tessellations
• Stochastic and Integral Geometry
• Random Laguerre tessellations
• Simulation of the typical Poisson–Voronoi–Cox–Voronoi cell
• Sur les mesures de Palm de deux processus ponctuels stationnaires
• Stationary iterated tessellations
• RANDOM POLYGONS DETERMINED BY RANDOM LINES IN A PLANE