The "central" technical papers are

- Short-length routes in low-cost networks via Poisson line patterns (with Wilf Kendall).
- The Stretch-Length Tradeoff in Geometric Networks: Average Case and Worst Case Study (with Tamar Lando).
- Which Connected Spatial Networks on Random Points have Linear Route-Lengths?
- The Shape Theorem for Route-lengths in Connected Spatial Networks on Random Points.

- A Route-Length Efficiency Statistic for Road Networks (with Alan Choi)

Two less central technical papers are:

- Spatial Transportation Networks with Transfer Costs: Asymptotic Optimality of Hub and Spoke Models.
- Optimal spatial transportation networks where link-costs are sublinear in link-capacity

A quite different but loosely related theory is developed in
Optimal Transportation Networks.
This modifies the classical Monge-Kantorovich transportation problem by seeking to
design a network (with given sources and sinks) to carry the flows, and optimize
with respect to cost, defined as follows. The total cost-per-unit-length of transport
along an edge is $\phi^\alpha$
where $\phi$ is the total flow on the edge and $0 < \alpha < 1$ is a parameter.
Intuitively, this *concave cost* setup encourages the network to have "freeways" carrying heavy traffic.
The literature focusses on existence and topological properties of optimal networks, not
on statistical properties of the optimal networks.

- True scale-invariant random spatial networks (with Karthik Ganesan)

- From Random Lines to Metric Spaces by Wilfrid Kendall.