Random planar graphs and the London street network
Centre for Advanced Spatial Analysis, University College London, 1-19 Torrington Place, London, WC1E 7HB, UK
Corresponding author: a email@example.com
Revised: 24 June 2009
Published online: 18 August 2009
In this paper we analyse the street network of London both in its primary and dual representation. To understand its properties, we consider three idealised models based on a grid, a static random planar graph and a growing random planar graph. Comparing the models and the street network, we find that the streets of London form a self-organising system whose growth is characterised by a strict interaction between the metrical and informational space. In particular, a principle of least effort appears to create a balance between the physical and the mental effort required to navigate the city.
PACS: 89.75.-k – Complex systems / 89.75.Da – Systems obeying scaling laws / 89.65.Lm – Urban planning and construction
© EDP Sciences, Società Italiana di Fisica, Springer-Verlag, 2009