On Two-Dimensional Structural Information Of Beijing Transportation Networks Based On Traffic Big Data

ICCBDC '18: Proceedings of the 2018 2nd International Conference on Cloud and Big Data Computing(2018)

引用 1|浏览4
暂无评分
摘要
Hierarchy is a fundamental characteristic of many complex systems. The methods of structural information have been taken as a prospective way for quantifying dynamical network complexity. This paper is based on the study of the high-dimensional natural structural information entropy in networks. And then we propose a new similarity District Structural Information (DSI) index, which takes the characteristics of network districts into consideration, to analyze the complexity of dynamical network districts. Based on the method, this paper applies the district structural information to explain the equilibrium problem in real-world networks. And taking Beijing traffic network and its districts to complete experiments demonstrates that the DSI index can reflect the equilibrium of the network and the districts effectively.
更多
查看译文
关键词
Dynamical Complexity of Networks,Structural Information,Network Districts,Traffic Big Data
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要