Premium
The Evolution and Complexity of Urban Street Networks
Author(s) -
Mohajeri Nahid,
Gudmundsson Agust
Publication year - 2014
Publication title -
geographical analysis
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.773
H-Index - 65
eISSN - 1538-4632
pISSN - 0016-7363
DOI - 10.1111/gean.12061
Subject(s) - entropy (arrow of time) , orientation (vector space) , space (punctuation) , computer science , geometry , geography , statistical physics , mathematics , physics , quantum mechanics , operating system
Street networks are one of the very few types of complex networks where the history of the network can be traced over long periods of time. Here, we introduce methods for quantifying the geometric characteristics of street networks and analyze the details of the evolution of the networks of S heffield ( U . K .), K horramabad ( I ran), and K erman ( I ran) over tens to hundreds of years. The results suggest that the spatial distribution of streets, in particular their lengths and orientations and associated entropies, is strongly affected by the surrounding landscapes but in different ways. The length entropies are mostly controlled by the space available for network growth, whereas the orientation entropies are mostly controlled by the shapes of the constraining landscape features. Thus, the network of K horramabad, located in a narrow crescent‐shaped valley, shows the smallest increase in length entropy (space constraints) and the largest in orientation entropy (shape constraints) over time. By contrast, the network of Kerman, in a flat desert area with essentially no space or shape constraints, has the largest increase in length entropy and the smallest increase in orientation entropy over time. The network of Sheffield, a city subject to moderate landscape constraints of hills and valleys, has length and orientation entropies that fall between these extremes.