基于复杂网络的城市公交网络的度和最短路径相关性的分析

Urban Public Transport Network Based on the Degree of Complexity Associated with the Analysis of the Shortest Path

通过实证分析中国大陆2个公交网络中的度和最短路径之间的拓扑关系,发现了物理基础设施层中节点的度和最短路径之间呈现出高强度的负相关性关系。随后通过生成相同规模的随机网络,对相关数据进行分析,发现也呈现出一致的负相关性,最后通过计算每个公交网络的相关系数,也发现了结点的度和最短路径之间呈现出很强的负相关性。研究结果表明,这两个公交网络中度和最短路径两个变量之间存在高度的线性负相关关系。

In this paper,the author gave analysis of the topology relationship between two public transport networking and shortest path based on experiments and mathematic procedure,and found that between the physical degree infrastructure layer nodes and the shortest path it showed a negative correlation relationship with high-intensity.The same size in the subsequent generation of a random network the network and data analysis,findings also show a consistent negative correlation.Finally,by calculating the correlation coefficients for each transit network,we also introduced that the node and the shortest path have a strong negative correlation.It results moderate and two transport network shortest paths between two variables,there is a high linear negative correlation.