Scaling limits for shortest path lengths along the edges of stationary tessellations
From MaRDI portal
Publication:3074486
DOI10.1239/AAP/1293113145zbMATH Open1214.60006arXiv0912.4516OpenAlexW1992707502MaRDI QIDQ3074486FDOQ3074486
Authors: Florian Voss, Catherine Gloaguen, Volker Schmidt 
Publication date: 9 February 2011
Published in: Advances in Applied Probability (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/0912.4516
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
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)
Cites Work
- An Introduction to the Theory of Point Processes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Stochastic and Integral Geometry
- Analysis of shortest paths and subscriber line lengths in telecommunication access networks
- An Introduction to the Theory of Point Processes
- Title not available (Why is that?)
- Crack STIT tessellations: characterization of stationary random tessellations stable with respect to iteration
- Title not available (Why is that?)
- Subadditive ergodic theory
- Short-length routes in low-cost networks via Poisson line patterns
- Title not available (Why is that?)
- Stationary iterated tessellations
- Stopping sets: Gamma-type results and hitting properties
- Random Laguerre tessellations
- Title not available (Why is that?)
- Mixing properties for STIT tessellations
- Scaling limits for shortest path lengths along the edges of stationary tessellations
- Densities of shortest path lengths in spatial stochastic networks
- Superposition of planar voronoi tessellations
- Local Stereology
- On Distances in Uniformly Random Networks
- Simulation of the typical Poisson–Voronoi–Cox–Voronoi cell
- Markov paths on the Poisson-Delaunay graph with applications to routeing in mobile networks
- Poisson-Voronoi Spanning Trees with Applications to the Optimization of Communication Networks
- Aggregate and fractal tessellations
- Simulation of typical Cox-Voronoi cells with a special regard to implementation tests
- Stochastic geometry and telecommunications networks
- Interdependences of directional quantities of planar tessellations
- Capacity distributions in spatial stochastic models for telecommunication networks
Cited In (11)
- Capacity distributions in spatial stochastic models for telecommunication networks
- Fractal random series generated by Poisson-Voronoi tessellations
- Densities of shortest path lengths in spatial stochastic networks
- Shortest path distance in Manhattan Poisson line Cox process
- Moderate deviations for shortest-path lengths on random segment processes
- Scaling limits for shortest path lengths along the edges of stationary tessellations
- Parametric Modeling of Sparse Random Trees Using 3D Copulas
- Geodesics and flows in a Poissonian city
- Random tessellations and Cox processes
- On the distribution of typical shortest-path lengths in connected random geometric graphs
- Spatial stochastic network models. Scaling limits and Monte-Carlo methods.
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)
