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

Exploring the optimal network topology for spreading dynamics

Author

Listed:
  • Wang, Dong
  • Small, Michael
  • Zhao, Yi

Abstract

Complex networks are a useful method to model many real-world systems from society to biology. Spreading dynamics of complex networks has attracted more and more attention and is currently an area of intense interest. In this study, by applying a perturbation approach to an individual-based susceptible–infected–susceptible (SIS) model, we derive an estimation of the incremental spreading prevalence after the network adds a single link and then propose a strategy to find the corresponding optimal link to promote spreading prevalence. Through theoretical analysis, we notice that the proposed strategy can be approximately interpreted by the eigenvector centrality when the infection probability is near the spreading critical point. By comparing the incremental prevalence of several typical synthetic and real networks, we find that the proposed strategy is superior to other methods such as linking nodes with the highest degree and eigenvector centrality. Moreover, the optimal link structure has degree mixing characteristics distinguishable for different spreading parameters. We further demonstrate this finding based on the degree-preserving network configuration model with different rich-club and assortativity coefficients.

Suggested Citation

  • Wang, Dong & Small, Michael & Zhao, Yi, 2021. "Exploring the optimal network topology for spreading dynamics," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 564(C).
  • Handle: RePEc:eee:phsmap:v:564:y:2021:i:c:s0378437120308335
    DOI: 10.1016/j.physa.2020.125535
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437120308335
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

    File URL: https://libkey.io/10.1016/j.physa.2020.125535?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. Leo Katz, 1953. "A new status index derived from sociometric analysis," Psychometrika, Springer;The Psychometric Society, vol. 18(1), pages 39-43, March.
    2. Flaviano Morone & Hernán A. Makse, 2015. "Influence maximization in complex networks through optimal percolation," Nature, Nature, vol. 524(7563), pages 65-68, August.
    3. P. Van Mieghem & H. Wang & X. Ge & S. Tang & F. A. Kuipers, 2010. "Influence of assortativity and degree-preserving rewiring on the spectra of networks," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 76(4), pages 643-652, August.
    4. Gino Ferraro & Andrea Moreno & Byungjoon Min & Flaviano Morone & Úrsula Pérez-Ramírez & Laura Pérez-Cervera & Lucas C. Parra & Andrei Holodny & Santiago Canals & Hernán A. Makse, 2018. "Publisher Correction: Finding influential nodes for integration in brain networks using optimal percolation theory," Nature Communications, Nature, vol. 9(1), pages 1-1, December.
    5. Linyuan Lü & Tao Zhou & Qian-Ming Zhang & H. Eugene Stanley, 2016. "The H-index of a network node and its relation to degree and coreness," Nature Communications, Nature, vol. 7(1), pages 1-7, April.
    6. Gino Del Ferraro & Andrea Moreno & Byungjoon Min & Flaviano Morone & Úrsula Pérez-Ramírez & Laura Pérez-Cervera & Lucas C. Parra & Andrei Holodny & Santiago Canals & Hernán A. Makse, 2018. "Finding influential nodes for integration in brain networks using optimal percolation theory," Nature Communications, Nature, vol. 9(1), pages 1-12, December.
    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. Zhang, Yifan & Ng, S. Thomas, 2021. "Unveiling the rich-club phenomenon in urban mobility networks through the spatiotemporal characteristics of passenger flow," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 584(C).
    2. Wan, Jinming & Ichinose, Genki & Small, Michael & Sayama, Hiroki & Moreno, Yamir & Cheng, Changqing, 2022. "Multilayer networks with higher-order interaction reveal the impact of collective behavior on epidemic dynamics," Chaos, Solitons & Fractals, Elsevier, vol. 164(C).
    3. Zhao, Dandan & Li, Runchao & Peng, Hao & Zhong, Ming & Wang, Wei, 2022. "Percolation on simplicial complexes," Applied Mathematics and Computation, Elsevier, vol. 431(C).
    4. Zhao, Dandan & Li, Runchao & Peng, Hao & Zhong, Ming & Wang, Wei, 2022. "Higher-order percolation in simplicial complexes," Chaos, Solitons & Fractals, Elsevier, vol. 155(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. Liu, Xiang-Chun & Zhu, Xu-Zhen & Tian, Hui & Zhang, Zeng-Ping & Wang, Wei, 2019. "Identifying localized influential spreaders of information spreading," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 519(C), pages 92-97.
    2. Hou, Lei, 2022. "Network versus content: The effectiveness in identifying opinion leaders in an online social network with empirical evaluation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 592(C).
    3. Zhai, Li & Yan, Xiangbin & Zhang, Guojing, 2018. "Bi-directional h-index: A new measure of node centrality in weighted and directed networks," Journal of Informetrics, Elsevier, vol. 12(1), pages 299-314.
    4. Yu, Senbin & Gao, Liang & Xu, Lida & Gao, Zi-You, 2019. "Identifying influential spreaders based on indirect spreading in neighborhood," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 418-425.
    5. Wandelt, Sebastian & Sun, Xiaoqian & Zhang, Anming, 2023. "Towards analyzing the robustness of the Integrated Global Transportation Network Abstraction (IGTNA)," Transportation Research Part A: Policy and Practice, Elsevier, vol. 178(C).
    6. Wang, Zhixiao & Zhao, Ya & Xi, Jingke & Du, Changjiang, 2016. "Fast ranking influential nodes in complex networks using a k-shell iteration factor," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 461(C), pages 171-181.
    7. Xu, Shuqi & Mariani, Manuel Sebastian & Lü, Linyuan & Medo, Matúš, 2020. "Unbiased evaluation of ranking metrics reveals consistent performance in science and technology citation data," Journal of Informetrics, Elsevier, vol. 14(1).
    8. Zhong, Lin-Feng & Shang, Ming-Sheng & Chen, Xiao-Long & Cai, Shi-Ming, 2018. "Identifying the influential nodes via eigen-centrality from the differences and similarities of structure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 510(C), pages 77-82.
    9. Bao, Zhong-Kui & Ma, Chuang & Xiang, Bing-Bing & Zhang, Hai-Feng, 2017. "Identification of influential nodes in complex networks: Method from spreading probability viewpoint," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 468(C), pages 391-397.
    10. Wu, Rui-Jie & Kong, Yi-Xiu & Di, Zengru & Zhang, Yi-Cheng & Shi, Gui-Yuan, 2022. "Analytical solution to the k-core pruning process," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 608(P1).
    11. Dong, Lijun & Wang, Yi & Liu, Ran & Pi, Benjie & Wu, Liuyi, 2016. "Toward edge minability for role mining in bipartite networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 462(C), pages 274-286.
    12. Sun, Peng Gang & Che, Wanping & Quan, Yining & Wang, Shuzhen & Miao, Qiguang, 2022. "Random networks are heterogeneous exhibiting a multi-scaling law," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 587(C).
    13. 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.
    14. Ye, Yucheng & Xu, Shuqi & Mariani, Manuel Sebastian & Lü, Linyuan, 2022. "Forecasting countries' gross domestic product from patent data," Chaos, Solitons & Fractals, Elsevier, vol. 160(C).
    15. Meisam Akbarzadeh & Soroush Memarmontazerin & Sybil Derrible & Sayed Farzin Salehi Reihani, 2019. "The role of travel demand and network centrality on the connectivity and resilience of an urban street system," Transportation, Springer, vol. 46(4), pages 1127-1141, August.
    16. Zhong, Lin-Feng & Liu, Quan-Hui & Wang, Wei & Cai, Shi-Min, 2018. "Comprehensive influence of local and global characteristics on identifying the influential nodes," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 511(C), pages 78-84.
    17. Annamaria Ficara & Francesco Curreri & Giacomo Fiumara & Pasquale De Meo & Antonio Liotta, 2022. "Covert Network Construction, Disruption, and Resilience: A Survey," Mathematics, MDPI, vol. 10(16), pages 1-43, August.
    18. Xu, Shuang & Wang, Pei & Zhang, Chunxia, 2019. "Identification of influential spreaders in bipartite networks:A singular value decomposition approach," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 513(C), pages 297-306.
    19. 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).
    20. Yao, Yabing & Zhang, Ruisheng & Yang, Fan & Tang, Jianxin & Yuan, Yongna & Hu, Rongjing, 2018. "Link prediction in complex networks based on the interactions among paths," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 510(C), pages 52-67.

    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:phsmap:v:564:y:2021:i:c:s0378437120308335. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    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.