Random planar graphs and the London street network
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.
PACS89.75.-k Complex systems 89.75.Da Systems obeying scaling laws 89.65.Lm Urban planning and construction
Unable to display preview. Download preview PDF.
- 1.M. Batty, Cities and Complexity (The MIT Press, Cambridge, Massachussets, 2005)Google Scholar
- 2.G.K. Zipf, Human Behaviour and the Principle of Least Effort (Addison-Wesley Press, 1949)Google Scholar
- 3.M. Batty, P. Longley, Fractal cities (Academic Press, London and San Diego, 1996)Google Scholar
- 5.K.J. Kansky, Structure of transportation networks (University of Chicago, Chicago, 1963)Google Scholar
- 7.L. Euler, Comm. Acad. Sci. I. Petropol. 8, 128 (1736)Google Scholar
- 15.J. Simmie, Planning London (UCL Press, London, UK, 1994)Google Scholar
- 18.R. Bruegmann, Sprawl: a compact history (University of Chicago Press, Illinois, 2005)Google Scholar
- 23.L. Figueiredo, L. Amorim, 6th International Space Syntax (Istanbul, Turkey, 2007)Google Scholar