中国物理B ›› 2010, Vol. 19 ›› Issue (9): 90510-090510.doi: 10.1088/1674-1056/19/9/090510
李科赞1, 周进2, 曾明华3, 李夏苗4
Li Xia-Miao(李夏苗)a)b),Zeng Ming-Hua(曾明华)a)†, Zhou Jin(周进)c), and Li Ke-Zan(李科赞)d)
摘要: The flourishing complex network theory has aroused increasing interest in studying the properties of real-world networks. Based on the traffic network of Chang--Zhu--Tan urban agglomeration in central China, some basic network topological characteristics were computed with data collected from local traffic maps, which showed that the traffic networks were small-world networks with strong resilience against failure; more importantly, the investigations of assortativity coefficient and average nearest-neighbour degree implied the disassortativity of the traffic networks. Since traffic network hierarchy as an important basic property has been neither studied intensively nor proved quantitatively, the authors are inspired to analyse traffic network hierarchy with disassortativity and to finely characterize hierarchy in the traffic networks by using the n-degree--n-clustering coefficient relationship. Through numerical results and analyses an exciting conclusion is drawn that the traffic networks exhibit a significant hierarchy, that is, the traffic networks are proved to be hierarchically organized. The result provides important information and theoretical groundwork for optimal transport planning.
中图分类号: