List of possibly-relevant papers available online (will remain under construction throughout the semester!)

Adamatzky (2013): How beta-skeletons lose their edges.

Aldous (2008a): Spatial transportation networks with transfer costs: asymptotic optimality of hub-and-spoke models. (9/13)

Aldous (2008b): Optimal spatial transportation networks where link costs are sublinear in link capacity. (12/9)

Aldous (2009): Which Connected Spatial Networks on Random Points have Linear Route-Lengths?. (11/6)

Aldous (2014): Scale-invariant random spatial networks. (9/13)

Aldous - Steele (2003): The objective method: Probabilistic combinatorial optimization and local weak convergence . (9/30)

Aldous - Krikun (2006): Percolating Paths through Random Points. (10/7)

Aldous - Kendall (2008): Short-length routes in low-cost networks via Poisson line patterns. (9/18)

Aldous - Shun (2010): Connected Spatial Networks over Random Points and a Route-Length Statistic. (9/23)

Aldous - Ganesan (2013): True scale-invariant random spatial networks.

Aldous - Garet (2013): The Shape Theorem for Route-lengths in Connected Spatial Networks on Random Points. (11/13)

Alexander (1995): Percolation and Minimal Spanning Forests in Infinite Graphs. (9/11) (12/4)

Antal - Pisztora (1996): On the chemical distance for supercritical Bernoulli percolation. (12/2)

Baccelli - Blaszczyszyn (2009): Stochastic Geometry and Wireless Networks: Volume I: Theory (book, 207 pages).

Balister - Bollobas - Sarkar (2008): Percolation, connectivity, coverage and colouring of random geometric graphs. (12/9)

Barthelemy (2011): Spatial networks (survey, 100 pages). (9/11)

Barthelemy et al (2013): Self-organization versus top-down planning in the evolution of a city. (9/11)

Benjamini (2010): Random planar metrics . (9/4)

Blanchard - Volchenkov (2009): Mathematical Analysis of Urban Spatial Networks (book, 190 pages).

Bose et al (2006): On the spanning ratio of Gabriel graphs and beta-skeletons. (9/20)

Bose et al (2009): The spanning ratio of the Delaunay triangulation is greater than π /2. (9/20)

Candellero - Fountoulakis (2013): Clustering in random geometric graphs on the hyperbolic plane.

Deijfen - Haggstrom - Holroyd (2012): Percolation in invariant Poisson graphs with i.i.d. degrees. (9/27) (12/2)

Devroye - Gudmundsson (2009): On the expected maximum degree of Gabriel and Yao graphs. (9/9) (12/4)

Dujmovic - Morin - Smid (2013): Average Stretch Factor: How Low Does It Go? (9/18)

Fountoulakis (2013): On the evolution of random geometric graphs on spaces of negative curvature.

Franceschetti et al (2007): Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory . (12/9)

Gai - Kapadia (2010): Contagion in financial networks. (12/11)

Gastner - Newman (2004): The spatial structure of networks. (9/13)

Gastner - Newman (2006): Optimal design of spatial distribution networks. (12/2)

Kalapala et al (2006): Scale invariance in road networks.

Keil - Gutwin (1992): Classes of graphs which approximate the complete Euclidean graph. (9/20)

Krioukov et al (2010): Hyperbolic Geometry of Complex Networks.

Louf - Jensen - Barthelemy (2013): Emergence of hierarchy in cost driven growth of spatial networks. (12/6)

Lyons - Peres (2013): Probability on Trees and Networks.

Morin - Verdonschot (2013): On the average number of edges in theta graphs.

Narayanaswamy et al (2002): Power control in ad-hoc networks: Theory, architecture, algorithm and implementation of the COMPOW protocol. (9/23)

Penrose - Yukich (2001): Central limit theorems for some graphs in computational geometry. (9/30)

Porta - Crucitti - Latora (2006): The network analysis of urban streets: a dual approach. (9/11)

Xie and Levinson (2006): Measuring the structure of road networks.

Xie and Levinson (2011): Evolving Transportation Networks (monograph, 281 pages).