Scaling limits for shortest path lengths along the edges of stationary tessellations

DOI10.1239/AAP/1293113145MaRDI QIDQ3074486zbMATHOpenAlexFDO

Authors Florian Voss, Catherine Gloaguen, Volker Schmidt

Publication date 9 February 2011

Published in Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0912.4516

zbMATH Keywords

Poisson approximationPalm distributionCox processuniform integrability.Random geometric graph

Mathematics Subject Classification ID

Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Geometric probability and stochastic geometry (60D05) Stochastic network models in operations research (90B15) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)

Abstract: We consider spatial stochastic models, which can be applied e.g. to telecommunication networks with two hierarchy levels. In particular, we consider two Cox processes concentrated on the edge set of a random tessellation, where the points can describe the locations of low-level and high-level network components, respectively, and the edge set the underlying infrastructure of the network, like road systems, railways, etc. Furthermore, each low-level component is marked with the shortest path along the edge set to the nearest high-level component. We investigate the typical shortest path length of the resulting marked point process, which is an important characteristic e.g. in performance analysis and planning of telecommunication networks. In particular, we show that its distribution converges to simple parametric limit distributions if a certain scaling factor converges to zero and infinity, respectively. This can be used to approximate the density of the typical shortest path length by analytical formulae.

Recommendations

• Random tessellations and Cox processes
• Analysis of shortest paths and subscriber line lengths in telecommunication access networks
• Densities of shortest path lengths in spatial stochastic networks
• On the distribution of typical shortest-path lengths in connected random geometric graphs
• Capacity distributions in spatial stochastic models for telecommunication networks

Cites work

• scientific article; zbMATH DE number 1713116 (Why is no real title available?)
• scientific article; zbMATH DE number 3731021 (Why is no real title available?)
• scientific article; zbMATH DE number 3595945 (Why is no real title available?)
• scientific article; zbMATH DE number 1455125 (Why is no real title available?)
• scientific article; zbMATH DE number 786469 (Why is no real title available?)
• scientific article; zbMATH DE number 1416816 (Why is no real title available?)
• Aggregate and fractal tessellations
• An Introduction to the Theory of Point Processes
• An Introduction to the Theory of Point Processes
• Analysis of shortest paths and subscriber line lengths in telecommunication access networks
• Capacity distributions in spatial stochastic models for telecommunication networks
• Crack STIT tessellations: characterization of stationary random tessellations stable with respect to iteration
• Densities of shortest path lengths in spatial stochastic networks
• Interdependences of directional quantities of planar tessellations
• Local Stereology
• Markov paths on the Poisson-Delaunay graph with applications to routeing in mobile networks
• Mixing properties for STIT tessellations
• On Distances in Uniformly Random Networks
• Poisson-Voronoi Spanning Trees with Applications to the Optimization of Communication Networks
• Random Laguerre tessellations
• Scaling limits for shortest path lengths along the edges of stationary tessellations
• Short-length routes in low-cost networks via Poisson line patterns
• Simulation of the typical Poisson–Voronoi–Cox–Voronoi cell
• Simulation of typical Cox-Voronoi cells with a special regard to implementation tests
• Stationary iterated tessellations
• Stochastic and Integral Geometry
• Stochastic geometry and telecommunications networks
• Stopping sets: Gamma-type results and hitting properties
• Subadditive ergodic theory
• Superposition of planar voronoi tessellations

Cited in

(13)

• Shortest path distance in Manhattan Poisson line Cox process
• Scaling limits for shortest path lengths along the edges of stationary tessellations
• A stochastic model for multi-hierarchical networks
• Asymptotic properties of Euclidean shortest-path trees in random geometric graphs
• Parametric modeling of sparse random trees using 3D copulas
• On the distribution of typical shortest-path lengths in connected random geometric graphs
• Geodesics and flows in a Poissonian city
• Capacity distributions in spatial stochastic models for telecommunication networks
• Fractal random series generated by Poisson-Voronoi tessellations
• Random tessellations and Cox processes
• Spatial stochastic network models. Scaling limits and Monte-Carlo methods.
• Moderate deviations for shortest-path lengths on random segment processes
• Densities of shortest path lengths in spatial stochastic networks

This page was built for publication: Scaling limits for shortest path lengths along the edges of stationary tessellations

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