Intelligibility and First Passage Times In Complex Urban Networks
arXiv:0710.0996 · doi:10.1098/rspa.2007.0329
Abstract
Topology of urban environments can be represented by means of graphs. We explore the graph representations of several compact urban patterns by random walks. The expected time of recurrence and the expected first passage time to a node scales apparently linearly in all urban patterns we have studied In space syntax theory, a positive relation between the local property of a node (qualified by connectivity or by the recurrence time) and the global property of the node (estimated in our approach by the first passage time to it) is known as intelligibility. Our approach based on random walks allows to extend the notion of intelligibility onto the entire domain of complex networks and graph theory.
19 pages, 4 figures, English UK, the Harvard style references
References in corpus (7)
- Random graphs with arbitrary degree distributions and their applications
- The Network Analysis of Urban Streets: A Primal Approach
- Structural Properties of Planar Graphs of Urban Street Patterns
- Networks and Cities: An Information Perspective
- The Backbone of a City
- Scaling and Universality in City Space Syntax: between Zipf and Matthew
- Random Walks Along the Streets and Canals in Compact Cities: Spectral analysis, Dynamical Modularity, Information, and Statistical Mechanics