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

Abstract

For a connected network on Poisson points in the plane, consider the route-length $D(r,θ) $ between a point near the origin and a point near polar coordinates $(r,θ)$, and suppose $E D(r,θ) = 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, θ)$ to converge as $r \to \infty$ to a constant $ρ(θ)$. 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.