中国物理B ›› 2020, Vol. 29 ›› Issue (12): 128902-.doi: 10.1088/1674-1056/abb302

• INTERDISCIPLINARY PHYSICS AND RELATED AREAS OF SCIENCE AND TECHNOLOGY • 上一篇    

  

  • 收稿日期:2020-05-14 修回日期:2020-07-20 接受日期:2020-08-27 出版日期:2020-12-01 发布日期:2020-12-02

Shortest path of temporal networks: An information spreading-based approach

Yixin Ma(马一心)1,2, Xiaoyu Xue(薛潇雨)1,2, Meng Cai(蔡萌)3, and Wei Wang(王伟)2,†   

  1. 1 College of Cybersecurity, Sichuan University, Chengdu 610065, China; 2 Cybersecurity Research Institute, Sichuan University, Chengdu 610065, China; 3 School of Humanities and Social Sciences, Xi'an Jiaotong University, Xi'an 710049, China
  • Received:2020-05-14 Revised:2020-07-20 Accepted:2020-08-27 Online:2020-12-01 Published:2020-12-02
  • Contact: Corresponding author. E-mail: wwzqbx@hotmail.com
  • Supported by:
    Project supported by the National Natural Science Foundation of China (Grant No. 61903266), China Postdoctoral Science Foundation (Grant No. 2018M631073), China Postdoctoral Science Special Foundation (Grant No. 2019T120829), the Fundamental Research Funds for the Central Universities, China, and Sichuan Science and Technology Program, China (Grant No. 20YYJC4001).

Abstract: The shortest path is a widely studied network science problem and has attracted great attention. Nevertheless, it draws little attention in temporal networks, in which temporal edges determine information dissemination. In this paper, we propose an information spreading-based method to calculate the shortest paths distribution in temporal networks. We verify our method on both artificial and real-world temporal networks and obtain a good agreement. We further generalize our method to identify influential nodes and found an effective method. Finally, we verify the influential nodes identifying method on four networks.

Key words: temporal network, shortest path, information spreading

中图分类号:  (Networks and genealogical trees)

  • 89.75.Hc
87.19.X- (Diseases) 87.23.Ge (Dynamics of social systems)