IDEAS home Printed from https://ideas.repec.org/a/eee/chsofr/v165y2022ip1s0960077922009456.html
   My bibliography  Save this article

A sequential-path tree-based centrality for identifying influential spreaders in temporal networks

Author

Listed:
  • Tao, Li
  • Kong, Shengzhou
  • He, Langzhou
  • Zhang, Fan
  • Li, Xianghua
  • Jia, Tao
  • Han, Zhen

Abstract

The problem of identifying influential spreaders in temporal networks has attracted extensive attention in recent years. Existing studies have proposed various centrality measures for quantifying the influence of nodes based on the structures of temporal networks, such as temporal degree centrality and temporal closeness centrality. However, most existing methods only take into account a single feature of nodes, while ignoring other temporal features (e.g., the propagation time, or the path length from an infected node to a destination node). In this paper, we propose a new centrality measure, namely as sequential-path tree-based centrality (SPT-C) which takes into account three different temporal features based on a new representation structure of temporal networks (i.e., sequential-path tree). The three temporal features include propagation time which measures the time that an infection propagates from an infected node to another, hop count which denotes the number of intermediate nodes that an infection propagates from an infected node to another, and reachable paths which represent the number of different time-respecting paths from an infected node to another. The evaluation experiments on 12 real-world temporal networks show that the effectiveness of our SPT-C in identifying influential spreaders is superior to other baseline measures.

Suggested Citation

  • Tao, Li & Kong, Shengzhou & He, Langzhou & Zhang, Fan & Li, Xianghua & Jia, Tao & Han, Zhen, 2022. "A sequential-path tree-based centrality for identifying influential spreaders in temporal networks," Chaos, Solitons & Fractals, Elsevier, vol. 165(P1).
  • Handle: RePEc:eee:chsofr:v:165:y:2022:i:p1:s0960077922009456
    DOI: 10.1016/j.chaos.2022.112766
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0960077922009456
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.chaos.2022.112766?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Hu, Jiantao & Du, Yuxian & Mo, Hongming & Wei, Daijun & Deng, Yong, 2016. "A modified weighted TOPSIS to identify influential nodes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 444(C), pages 73-85.
    2. Liu, Panfeng & Li, Longjie & Fang, Shiyu & Yao, Yukai, 2021. "Identifying influential nodes in social networks: A voting approach," Chaos, Solitons & Fractals, Elsevier, vol. 152(C).
    3. Zhao, Jie & Wang, Yunchuan & Deng, Yong, 2020. "Identifying influential nodes in complex networks from global perspective," Chaos, Solitons & Fractals, Elsevier, vol. 133(C).
    4. Génois, Mathieu & Vestergaard, Christian L. & Fournet, Julie & Panisson, André & Bonmarin, Isabelle & Barrat, Alain, 2015. "Data on face-to-face contacts in an office building suggest a low-cost vaccination strategy based on community linkers," Network Science, Cambridge University Press, vol. 3(3), pages 326-347, September.
    5. Petter Holme, 2021. "Fast and principled simulations of the SIR model on temporal networks," PLOS ONE, Public Library of Science, vol. 16(2), pages 1-15, February.
    6. Bi, Jialin & Jin, Ji & Qu, Cunquan & Zhan, Xiuxiu & Wang, Guanghui & Yan, Guiying, 2021. "Temporal gravity model for important node identification in temporal networks," Chaos, Solitons & Fractals, Elsevier, vol. 147(C).
    7. Petter Holme, 2015. "Modern temporal network theory: a colloquium," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 88(9), pages 1-30, September.
    8. Yin, Ran-Ran & Guo, Qiang & Yang, Jian-Nan & Liu, Jian-Guo, 2018. "Inter-layer similarity-based eigenvector centrality measures for temporal networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 512(C), pages 165-173.
    9. Cheng, Le & Li, Xianghua & Han, Zhen & Luo, Tengyun & Ma, Lianbo & Zhu, Peican, 2022. "Path-based multi-sources localization in multiplex networks," Chaos, Solitons & Fractals, Elsevier, vol. 159(C).
    10. Ma, Ling-ling & Ma, Chuang & Zhang, Hai-Feng & Wang, Bing-Hong, 2016. "Identifying influential spreaders in complex networks based on gravity formula," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 451(C), pages 205-212.
    11. Chang, Sheryl L. & Piraveenan, Mahendra & Prokopenko, Mikhail, 2020. "Impact of network assortativity on epidemic and vaccination behaviour," Chaos, Solitons & Fractals, Elsevier, vol. 140(C).
    12. Jabari Lotf, Jalil & Abdollahi Azgomi, Mohammad & Ebrahimi Dishabi, Mohammad Reza, 2022. "An improved influence maximization method for social networks based on genetic algorithm," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 586(C).
    13. Liu, Yang & Wei, Bo & Du, Yuxian & Xiao, Fuyuan & Deng, Yong, 2016. "Identifying influential spreaders by weight degree centrality in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 86(C), pages 1-7.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Wang, Longjian & Zhang, Shuichao & Szűcs, Gábor & Wang, Yonggang, 2024. "Identifying the critical nodes in multi-modal transportation network with a traffic demand-based computational method," Reliability Engineering and System Safety, Elsevier, vol. 244(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Zhang, Tianrui & Yang, Lu-Xing & Yang, Xiaofan & Wu, Yingbo & Tang, Yuan Yan, 2017. "Dynamic malware containment under an epidemic model with alert," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 470(C), pages 249-260.
    2. Li, Hanwen & Shang, Qiuyan & Deng, Yong, 2021. "A generalized gravity model for influential spreaders identification in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 143(C).
    3. Li, Mingwu & Dankowicz, Harry, 2019. "Impact of temporal network structures on the speed of consensus formation in opinion dynamics," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 1355-1370.
    4. Wang, Ying & Zheng, Yunan & Shi, Xuelei & Liu, Yiguang, 2022. "An effective heuristic clustering algorithm for mining multiple critical nodes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 588(C).
    5. Wang, Yan & Li, Haozhan & Zhang, Ling & Zhao, Linlin & Li, Wanlan, 2022. "Identifying influential nodes in social networks: Centripetal centrality and seed exclusion approach," Chaos, Solitons & Fractals, Elsevier, vol. 162(C).
    6. Li, Qi & Cheng, Le & Wang, Wei & Li, Xianghua & Li, Shudong & Zhu, Peican, 2023. "Influence maximization through exploring structural information," Applied Mathematics and Computation, Elsevier, vol. 442(C).
    7. Yin, Ran-Ran & Guo, Qiang & Yang, Jian-Nan & Liu, Jian-Guo, 2018. "Inter-layer similarity-based eigenvector centrality measures for temporal networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 512(C), pages 165-173.
    8. Yang, Pingle & Meng, Fanyuan & Zhao, Laijun & Zhou, Lixin, 2023. "AOGC: An improved gravity centrality based on an adaptive truncation radius and omni-channel paths for identifying key nodes in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 166(C).
    9. Wang, Min & Li, Wanchun & Guo, Yuning & Peng, Xiaoyan & Li, Yingxiang, 2020. "Identifying influential spreaders in complex networks based on improved k-shell method," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 554(C).
    10. Jin, Pengfei & Wang, Saige & Meng, Zheng & Chen, Bin, 2023. "China's lithium supply chains: Network evolution and resilience assessment," Resources Policy, Elsevier, vol. 87(PB).
    11. Anzhi Sheng & Qi Su & Aming Li & Long Wang & Joshua B. Plotkin, 2023. "Constructing temporal networks with bursty activity patterns," Nature Communications, Nature, vol. 14(1), pages 1-10, December.
    12. Sun, Hong-liang & Chen, Duan-bing & He, Jia-lin & Ch’ng, Eugene, 2019. "A voting approach to uncover multiple influential spreaders on weighted networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 519(C), pages 303-312.
    13. Zhao, Jie & Wang, Zhen & Yu, Dengxiu & Cao, Jinde & Cheong, Kang Hao, 2024. "Swarm intelligence for protecting sensitive identities in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 182(C).
    14. Panayotis Christidis & Álvaro Gomez Losada, 2019. "Email Based Institutional Network Analysis: Applications and Risks," Social Sciences, MDPI, vol. 8(11), pages 1-14, November.
    15. Liu, Ying & Tang, Ming & Zhou, Tao & Do, Younghae, 2016. "Identify influential spreaders in complex networks, the role of neighborhood," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 452(C), pages 289-298.
    16. Zhou, Yaoming & Kundu, Tanmoy & Goh, Mark & Sheu, Jiuh-Biing, 2023. "Beyond throughput: Incorporating air transport network topology in airport performance measurement," Journal of Air Transport Management, Elsevier, vol. 112(C).
    17. Das, Saikat & Bose, Indranil & Sarkar, Uttam Kumar, 2023. "Predicting the outbreak of epidemics using a network-based approach," European Journal of Operational Research, Elsevier, vol. 309(2), pages 819-831.
    18. Lazebnik, Teddy, 2023. "Computational applications of extended SIR models: A review focused on airborne pandemics," Ecological Modelling, Elsevier, vol. 483(C).
    19. Luo, Mengzhuo & Liu, Xinzhi & Zhong, Shouming & Cheng, Jun, 2018. "Synchronization of multi-stochastic-link complex networks via aperiodically intermittent control with two different switched periods," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 509(C), pages 20-38.
    20. Xinyu Huang & Dongming Chen & Dongqi Wang & Tao Ren, 2020. "MINE: Identifying Top- k Vital Nodes in Complex Networks via Maximum Influential Neighbors Expansion," Mathematics, MDPI, vol. 8(9), pages 1-25, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:chsofr:v:165:y:2022:i:p1:s0960077922009456. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Thayer, Thomas R. (email available below). General contact details of provider: https://www.journals.elsevier.com/chaos-solitons-and-fractals .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.