arXivDaily arXiv每日学术速递 周一至周五更新
arXiv physics/0510162physics.soc-ph
收藏

城市道路格局平面图的结构性质

Structural Properties of Planar Graphs of Urban Street Patterns

Alessio Cardillo, Salvatore Scellato, Vito Latora, Sergio Porta

摘要:

最近的理论和实证研究集中在社会,生物和技术系统中的复杂关系网络的结构特性。在这里,我们研究的基本属性的20个1平方英里的样本的街道模式不同的世界城市。样本由空间(平面)图表示,即由度量而不是拓扑距离定义的有值图,其中街道交叉口变成节点,街道变成边缘。我们研究了节点在二维平面上的分布。然后,我们通过测量网格系数和计数短周期(三个,四个和五个边缘),并通过测量全局效率和成本的全局属性的图的局部属性进行评估。作为规范化图,我们考虑最小生成树(MST)和贪婪三角剖分(GT)引起的相同的空间分布的节点。结果表明,大多数城市已经演化成网络,其效率与GT相当,尽管它们的成本更接近于树的成本。基于相对效率和成本的分析能够描述不同类型城市的特征。

英文摘要:

Recent theoretical and empirical studies have focused on the structural properties of complex relational networks in social, biological and technological systems. Here we study the basic properties of twenty 1-square-mile samples of street patterns of different world cities. Samples are represented by spatial (planar) graphs, i.e. valued graphs defined by metric rather than topologic distance and where street intersections are turned into nodes and streets into edges. We study the distribution of nodes in the 2-dimensional plane. We then evaluate the local properties of the graphs by measuring the meshedness coefficient and counting short cycles (of three, four and five edges), and the global properties by measuring global efficiency and cost. As normalization graphs, we consider both minimal spanning trees (MST) and greedy triangulations (GT) induced by the same spatial distribution of nodes. The results indicate that most of the cities have evolved into networks as efficienct as GT, although their cost is closer to the one of a tree. An analysis based on relative efficiency and cost is able to characterize different classes of cities.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑