基于复杂网络的城市公共交通网络研究

将北京、上海和杭州3个大城市的公共交通网络(常规公交和快速公交)抽象成复杂网络，结合网络图论思想，把公交站点作为节点，站点间的连线作为边，在大量统计数据的基础上，通过Space L和Space P方法研究3大城市的复杂网络特性。统计分析表明，3个城市的公交网络均具有较小的平均路径长度，即典型的小世界特性。其节点的度分布，在Space L方法的描述下具有无标度特性，在Space P方法的描述下具有指数分布特性。通过对Space L和Space P两种描述方法的比较，可以发现对于同样的公交网络，Space P方法描述的网络具有更大的聚类系数和更小的平均路径长度，即具有更强的小世界效应。

Research on Urban Public Transport Networks Based on Complex Networks

The public transport networks of Beijing, Shanghai and Hangzhou, including bus transport and rapid bus transport, are abstracted as complex networks. On the basis of graph theory idea, the stations and the lines between them are considered as nodes and edges. The property of complex networks is researched with the methods of Space L and Space P based on statistical data. The analysis on the data indicates that the public transport networks of all the three cities have small average path length, which means all of them have typical property of small-world. The degree distribution of nodes shows scale-free property in Space L, and exponential distribution property in Space P. Comparing Space L and Space P, this paper proposes the fact that the networks described by Space P have larger clustering coefficient and smaller average path length for the same public transport networks, namely having more obvious small-world effect.