2004 volume 31(1) pages 151 – 162
doi:10.1068/b306

Cite as:
Jiang B, Claramunt C, 2004, "Topological analysis of urban street networks" Environment and Planning B: Planning and Design 31(1) 151 – 162

Download citation data in RIS format

Topological analysis of urban street networks

Bin Jiang, Christophe Claramunt

Received 31 January 2003; in revised form 13 June 2003

Abstract. The authors propose a topological analysis of large urban street networks based on a computational and functional graph representation. This representation gives a functional view in which vertices represent named streets and edges represent street intersections. A range of graph measures, including street connectivity, average path length, and clustering coefficient, are computed for structural analysis. In order to characterise different clustering degrees of streets in a street network they generalise the clustering coefficient to a k-clustering coefficient that takes into account k neighbours. Based on validations applied to three cities, the authors show that large urban street networks form small-world networks but exhibit no scale-free property.

Restricted material:

PDF Full-text PDF size: 353 Kb

HTML References  23 references, 10 with DOI links (Crossref)

Your computer (IP address: 54.81.77.217) has not been recognised as being on a network authorised to view the full text or references of this article. If you are a member of a university library that has a subscription to the journal, please contact your serials librarian (subscriptions information).