Prof Wilfrid Kendall, University of Warwick
Short-length routes in low-cost networks via Poisson line patterns (joint work with David Aldous)

How efficiently can one move about in a network linking a configuration of n cities? Here the notion of "efficient" has to balance (a) total network length against (b) short network distances between cities. My talk will explain how to use Poisson line processes to produce networks which are nearly of shortest total length, which make the average inter-city distance almost Euclidean.