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

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Scaling limits for shortest path lengths along the edges of stationary tessellations - Supplementary material does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Scaling limits for shortest path lengths along the edges of stationary tessellations - Supplementary material, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scaling limits for shortest path lengths along the edges of stationary tessellations - Supplementary material will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-362490

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.