The Shape Theorem for Route-lengths in Connected Spatial Networks on Random Points

Details The Shape Theorem for Route-lengths in Connected Spatial Networks on Random Points The Shape Theorem for Route-lengths in Connected Spatial Networks on Random Points

2009-11-27

arxiv.org/abs/0911.5301v1

Mathematics

Probability

Scientific paper

For a connected network on Poisson points in the plane, consider the route-length $D(r,\theta) $ between a point near the origin and a point near polar coordinates $(r,\theta)$, and suppose $E D(r,\theta) = O(r)$ as $r \to \infty$. By analogy with the shape theorem for first-passage percolation, for a translation-invariant and ergodic network one expects $r^{-1} D(r, \theta)$ to converge as $r \to \infty$ to a constant $\rho(\theta)$. It turns out there are some subtleties in making a precise formulation and a proof. We give one formulation and proof via a variant of the subadditive ergodic theorem wherein random variables are sometimes infinite.

Affiliated with

Also associated with

No associations

Rating

The Shape Theorem for Route-lengths in Connected Spatial Networks on Random Points 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 The Shape Theorem for Route-lengths in Connected Spatial Networks on Random Points, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Shape Theorem for Route-lengths in Connected Spatial Networks on Random Points will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-195872