Hierarchy property of traffic networks  

作　　者：李夏苗 曾明华 周进 李科赞 

机构地区：[1]School of Traffic and Transport Engineering,Central South University [2]State Key Laboratory of Rail Traffic Control and Safety (Beijing Jiaotong University) [3]School of Mathematics Statistics,Wuhan University [4]School of Mathematics and Computational Science,Guilin University of Electronic Technology

出　　处：《Chinese Physics B》2010年第9期279-286,共8页中国物理B（英文版）

基　　金：supported by the National Natural Science Foundation of China (Grant No. 60964006);the Scientific Research Innovation Fund Project for Graduate Student of Hunan,China (Grant No.3340-74236000003);the Open Program of State Key Laboratory of Rail Traffic Control and Safety (Beijing Jiaotong University),China (Grant No.2007K-0027)

摘　　要：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 as- sortativity coefficient and average nearestlneighbour 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.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 as- sortativity coefficient and average nearestlneighbour 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.

关 键 词：traffic network hierarchy property n-clustering coefficient disassortativity 

分 类 号：O157.5[理学—数学]