IDEAS home Printed from https://ideas.repec.org/a/eee/chsofr/v201y2025ip1s0960077925011762.html

Estimating nodal spreading influence using partial temporal networks

Author

Listed:
  • Mao, Tianrui
  • Zhang, Shilun
  • Hanjalic, Alan
  • Wang, Huijuan

Abstract

Networks facilitate the spread of information and epidemics. The average number of nodes infected via a spreading process on a network starting from a single seed node over a given long period is called the influence of that node. Estimating nodal influence early in time is essential for the epidemic/misinformation mitigation. Influence estimation has been investigated in static networks, which identifies the relation between topological properties of a node and its influence and assumes the networks are completely known. However, the networks underlying spreading processes such as social interactions are not static but temporal networks, whose links are activated or deactivated over time. When predicting nodal influence in the long-term future, the temporal network is usually only observable till the time of prediction and only locally around the node due to data accessibility. To bridge this gap, we address the question of how to utilize the partially observed temporal network (local and of short duration) around each node, to estimate the ranking of nodes in spreading influence on the full network over a long period. This would also enable us to understand which network properties of a node, in its partially observed temporal network determine its influence. Centrality metrics (nodal properties) have been proposed recently in temporal networks. However, using such a metric derived for each node from its partial network to estimate the ranking of nodes in influence is likely to be limiting. This is because the spread of information is possibly through any time-respecting path, beyond the shortest time-respecting path considered by existing metrics. To address this disparity, we systematically propose a set of novel nodal centrality metrics that encode diverse properties of (time-respecting) walks to predict nodal influence rankings. The proposed metrics derived from partial network information, in general, outperform classic centrality metrics utilizing either full or partial temporal network information. It is found that distinct centrality metrics perform the best depending on the infection probability of the spreading process. For a broad range of the infection probability, a node tends to be influential if it can reach many distinct nodes via time-respecting walks and if these nodes can be reached early in time.

Suggested Citation

  • Mao, Tianrui & Zhang, Shilun & Hanjalic, Alan & Wang, Huijuan, 2025. "Estimating nodal spreading influence using partial temporal networks," Chaos, Solitons & Fractals, Elsevier, vol. 201(P1).
  • Handle: RePEc:eee:chsofr:v:201:y:2025:i:p1:s0960077925011762
    DOI: 10.1016/j.chaos.2025.117163
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.chaos.2025.117163?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Gert Sabidussi, 1966. "The centrality index of a graph," Psychometrika, Springer;The Psychometric Society, vol. 31(4), pages 581-603, December.
    2. Julie Fournet & Alain Barrat, 2014. "Contact Patterns among High School Students," PLOS ONE, Public Library of Science, vol. 9(9), pages 1-17, September.
    3. Luca Gallo & Lucas Lacasa & Vito Latora & Federico Battiston, 2024. "Higher-order correlations reveal complex memory in temporal hypergraphs," Nature Communications, Nature, vol. 15(1), pages 1-7, December.
    4. Iacopo Iacopini & Márton Karsai & Alain Barrat, 2024. "The temporal dynamics of group interactions in higher-order social networks," Nature Communications, Nature, vol. 15(1), pages 1-11, December.
    5. Ciro Cattuto & Wouter Van den Broeck & Alain Barrat & Vittoria Colizza & Jean-François Pinton & Alessandro Vespignani, 2010. "Dynamics of Person-to-Person Interactions from Distributed RFID Sensor Networks," PLOS ONE, Public Library of Science, vol. 5(7), pages 1-9, July.
    6. 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).
    7. 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.
    8. 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).
    9. HA (Bart) Peters & Alberto Ceria & Huijuan Wang, 2025. "Higher-order temporal network prediction and interpretation," PLOS ONE, Public Library of Science, vol. 20(5), pages 1-22, May.
    10. Cong Li & Qian Li & Piet Mieghem & H. Stanley & Huijuan Wang, 2015. "Correlation between centrality metrics and their application to the opinion model," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 88(3), pages 1-13, March.
    Full references (including those not matched with items on IDEAS)

    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. Yuan, Liang & Wu, Jiao & Xu, Kesheng & Zheng, Muhua, 2025. "The recurrence of groups inhibits the information spreading under higher-order interactions," Chaos, Solitons & Fractals, Elsevier, vol. 194(C).
    2. 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.
    3. 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).
    4. repec:plo:pone00:0131469 is not listed on IDEAS
    5. Gail E. Potter & Nicole Bohme Carnegie & Jonathan D. Sugimoto & Aldiouma Diallo & John C. Victor & Kathleen M. Neuzil & M. Elizabeth Halloran, 2022. "Using social contact data to improve the overall effect estimate of a cluster‐randomized influenza vaccination program in Senegal," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 71(1), pages 70-90, January.
    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. Abreu, Mariana Piaia & Del-Vecchio, Renata R. & Grassi, Rosanna, 2020. "Analysis of productive structure applying network theory: The Brazilian case," Structural Change and Economic Dynamics, Elsevier, vol. 53(C), pages 281-291.
    8. Funel, Agostino, 2022. "A method to compute the communicability of nodes through causal paths in temporal networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 593(C).
    9. Aming Li & Yang-Yu Liu, 2020. "Controlling Network Dynamics," Advances in Complex Systems (ACS), World Scientific Publishing Co. Pte. Ltd., vol. 22(07n08), pages 1-19, February.
    10. Fogel, Kathy & Jandik, Tomas & McCumber, William R., 2018. "CFO social capital and private debt," Journal of Corporate Finance, Elsevier, vol. 52(C), pages 28-52.
    11. Gregory, Steve, 2012. "Ordered community structure in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(8), pages 2752-2763.
    12. De Martino, Giuseppe & Spina, Serena, 2015. "Exploiting the time-dynamics of news diffusion on the Internet through a generalized Susceptible–Infected model," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 438(C), pages 634-644.
    13. Hyuk-Soo Kwon & Jihong Lee & Sokbae Lee & Ryungha Oh, 2022. "Knowledge spillovers and patent citations: trends in geographic localization, 1976–2015," Economics of Innovation and New Technology, Taylor & Francis Journals, vol. 31(3), pages 123-147, April.
    14. Kobayashi, Teruyoshi & Takaguchi, Taro, 2018. "Identifying relationship lending in the interbank market: A network approach," Journal of Banking & Finance, Elsevier, vol. 97(C), pages 20-36.
    15. Zheng, Wei & Wei, Sheng, 2024. "A ‘node-place-network-city’ framework to examine HSR station area development dynamics: Station typologies and development strategies," Journal of Transport Geography, Elsevier, vol. 120(C).
    16. Fang, Ming & Francis, Bill & Hasan, Iftekhar & Wu, Qiang, 2022. "External social networks and earnings management," The British Accounting Review, Elsevier, vol. 54(2).
    17. Mario V. Tomasello & Mauro Napoletano & Antonios Garas & Frank Schweitzer, 2017. "The rise and fall of R&D networks," Industrial and Corporate Change, Oxford University Press and the Associazione ICC, vol. 26(4), pages 617-646.
    18. Manuel, Paul & Brešar, Boštjan & Klavžar, Sandi, 2022. "The geodesic-transversal problem," Applied Mathematics and Computation, Elsevier, vol. 413(C).
    19. Tao, Qizhi & Li, Haoyu & Wu, Qun & Zhang, Ting & Zhu, Yingjun, 2019. "The dark side of board network centrality: Evidence from merger performance," Journal of Business Research, Elsevier, vol. 104(C), pages 215-232.
    20. repec:dau:papers:123456789/7616 is not listed on IDEAS
    21. Jackie Krafft & Francesco Quatraro, 2011. "The Dynamics of Technological Knowledge: From Linearity to Recombination," Chapters, in: Cristiano Antonelli (ed.), Handbook on the Economic Complexity of Technological Change, chapter 7, Edward Elgar Publishing.
    22. Prosper D Akrobotu & Tamsin E James & Christian F A Negre & Susan M Mniszewski, 2022. "A QUBO formulation for top-τ eigencentrality nodes," PLOS ONE, Public Library of Science, vol. 17(7), pages 1-18, July.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:201:y:2025:i:p1:s0960077925011762. 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.