The stretch-length tradeoff in geometric networks: average case and worst case study

摘要

Consider a network linking the points of a rate-1 Poisson point process on the plane. Write Psi(ave) (s) for the minimum possible mean length per unit area of such a network, subject to the constraint that the route-length between every pair of points is at most s times the Euclidean distance. We give upper and lower bounds on the function Psi(ave) (s), and on the analogous "worst-case" function Psi(worst) (s) where the point configuration is arbitrary subject to average density one per unit area. Our bounds are numerically crude, but raise the question of whether there is an exponent a such that each function has Psi (s) asymptotic to (s - 1)(-alpha) as s down arrow 1.