Topological analysis of urban street networks
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.
When requesting a correction, please mention this item's handle: RePEc:pio:envirb:v:31:y:2004:i:1:p:151-162. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Neil Hammond)
If references are entirely missing, you can add them using this form.