2009/12/23 by Florian Voß, Florian Voss, Voss, Florian +4
Biochemistry, Genetics and Molecular Biology · Computer Science · Mathematics · #60D05 #60F99 #60G55 #90B15 #Computational Geometry and Mesh Generation #Diffusion and Search Dynamics #FOS: Mathematics #Point processes and geometric inequalities #Probability (math.PR) #Statistics Theory (math.ST) #math.PR #math.ST #msc:60D05 #msc:60F99 #msc:60G55 #msc:90B15 #stat.TH
paper · pdf · doi:10.48550/arxiv.0912.4516
arxiv created 2009/12/23 · openalex publication_date 2009/12/23 · arxiv updated 2010/01/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.