中心性
路径(计算)
计算机科学
路径长度
统计物理学
数学
组合数学
物理
计算机网络
作者
Raj Kumar Pan,Jari Saramäki
标识
DOI:10.1103/physreve.84.016105
摘要
In temporal networks, where nodes interact via sequences of temporary events, information or resources can only flow through paths that follow the time ordering of events. Such temporal paths play a crucial role in dynamic processes. However, since networks have so far been usually considered static or quasistatic, the properties of temporal paths are not yet well understood. Building on a definition and algorithmic implementation of the average temporal distance between nodes, we study temporal paths in empirical networks of human communication and air transport. Although temporal distances correlate with static graph distances, there is a large spread, and nodes that appear close from the static network view may be connected via slow paths or not at all. Differences between static and temporal properties are further highlighted in studies of the temporal closeness centrality. In addition, correlations and heterogeneities in the underlying event sequences affect temporal path lengths, increasing temporal distances in communication networks and decreasing them in the air transport network.
科研通智能强力驱动
Strongly Powered by AbleSci AI