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

Evaluation of community vulnerability based on communicability and structural dissimilarity

Author

Listed:
  • Chen, Gaolin
  • Zhou, Shuming
  • Li, Min
  • Zhang, Hong

Abstract

The exploration of community features is a key issue in network science and data mining. As a vital structural characteristic, community vulnerability has been paid great deal of concern. Recent works underline that many internal and external parameters to quantify community vulnerability necessarily improve conformity with topology, but are suffering from a shortage of comprehensiveness. In this paper, we propose a novel metric, namely communication and structural heterogeneity method (CSH), designed to characterize topological information by communicability and structural dissimilarity. CSH is a global path-related strategy which is based on community dissimilarity. Furthermore, intra-link number, average communicability, topological heterogeneity in communities, as well as inter-link number and structural dissimilarity between communities are employed. Thus, a more detailed evaluation of community vulnerability is suggested. The effectiveness and accuracy of CSH are verified by empirical results in real-world networks. Moreover, the propagation dynamic SIR model and simulations of random and deliberate attack are utilized to validate rationality. Meanwhile, the correlation between node importance (vulnerability) and community vulnerability is explored through experiments. The proposed method (CSH) shows its superiority when comparing it to some state-of-the-art methods.

Suggested Citation

  • Chen, Gaolin & Zhou, Shuming & Li, Min & Zhang, Hong, 2022. "Evaluation of community vulnerability based on communicability and structural dissimilarity," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 606(C).
  • Handle: RePEc:eee:phsmap:v:606:y:2022:i:c:s0378437122006707
    DOI: 10.1016/j.physa.2022.128079
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437122006707
    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.2022.128079?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. Lee, Kevin H. & Xue, Lingzhou & Hunter, David R., 2020. "Model-based clustering of time-evolving networks through temporal exponential-family random graph models," Journal of Multivariate Analysis, Elsevier, vol. 175(C).
    2. Bae, Joonhyun & Kim, Sangwook, 2014. "Identifying and ranking influential spreaders in complex networks by neighborhood coreness," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 395(C), pages 549-559.
    3. Zhang, Xiaoge & Mahadevan, Sankaran & Sankararaman, Shankar & Goebel, Kai, 2018. "Resilience-based network design under uncertainty," Reliability Engineering and System Safety, Elsevier, vol. 169(C), pages 364-379.
    4. Sperstad, Iver Bakken & Kjølle, Gerd H. & Gjerde, Oddbjørn, 2020. "A comprehensive framework for vulnerability analysis of extraordinary events in power systems," Reliability Engineering and System Safety, Elsevier, vol. 196(C).
    5. Tiago A. Schieber & Laura Carpi & Albert Díaz-Guilera & Panos M. Pardalos & Cristina Masoller & Martín G. Ravetti, 2017. "Quantification of network structural dissimilarities," Nature Communications, Nature, vol. 8(1), pages 1-10, April.
    6. Marrel, Amandine & Iooss, Bertrand & Laurent, Béatrice & Roustant, Olivier, 2009. "Calculations of Sobol indices for the Gaussian process metamodel," Reliability Engineering and System Safety, Elsevier, vol. 94(3), pages 742-751.
    7. Chen, Duanbing & Lü, Linyuan & Shang, Ming-Sheng & Zhang, Yi-Cheng & Zhou, Tao, 2012. "Identifying influential nodes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(4), pages 1777-1787.
    8. Rocco S., Claudio M. & Ramirez-Marquez, José Emmanuel, 2011. "Vulnerability metrics and analysis for communities in complex networks," Reliability Engineering and System Safety, Elsevier, vol. 96(10), pages 1360-1366.
    9. Wen, Tao & Deng, Yong, 2020. "The vulnerability of communities in complex networks: An entropy approach," Reliability Engineering and System Safety, Elsevier, vol. 196(C).
    10. Ramirez-Marquez, Jose E. & Rocco, Claudio M. & Barker, Kash & Moronta, Jose, 2018. "Quantifying the resilience of community structures in networks," Reliability Engineering and System Safety, Elsevier, vol. 169(C), pages 466-474.
    11. Wei, Daijun & Zhang, Xiaoge & Mahadevan, Sankaran, 2018. "Measuring the vulnerability of community structure in complex networks," Reliability Engineering and System Safety, Elsevier, vol. 174(C), pages 41-52.
    12. Wang, Shuliang & Stanley, H. Eugene & Gao, Yachun, 2018. "A methodological framework for vulnerability analysis of interdependent infrastructure systems under deliberate attacks," Chaos, Solitons & Fractals, Elsevier, vol. 117(C), pages 21-29.
    13. Cerqueti, Roy & Ferraro, Giovanna & Iovanella, Antonio, 2019. "Measuring network resilience through connection patterns," Reliability Engineering and System Safety, Elsevier, vol. 188(C), pages 320-329.
    14. Wandelt, Sebastian & Shi, Xing & Sun, Xiaoqian, 2021. "Estimation and improvement of transportation network robustness by exploiting communities," Reliability Engineering and System Safety, Elsevier, vol. 206(C).
    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. Wen, Tao & Deng, Yong, 2020. "The vulnerability of communities in complex networks: An entropy approach," Reliability Engineering and System Safety, Elsevier, vol. 196(C).
    2. Wen, Tao & Gao, Qiuya & Chen, Yu-wang & Cheong, Kang Hao, 2022. "Exploring the vulnerability of transportation networks by entropy: A case study of Asia–Europe maritime transportation network," Reliability Engineering and System Safety, Elsevier, vol. 226(C).
    3. Xu, Zizhen & Chopra, Shauhrat S., 2022. "Network-based Assessment of Metro Infrastructure with a Spatial–temporal Resilience Cycle Framework," Reliability Engineering and System Safety, Elsevier, vol. 223(C).
    4. 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).
    5. Faxu Li & Hui Xu & Liang Wei & Defang Wang, 2023. "RETRACTED ARTICLE: Identifying vital nodes in hypernetwork based on local centrality," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-13, January.
    6. Claudio M. Rocco & Kash Barker & Jose Moronta, 2022. "Determining the best algorithm to detect community structures in networks: application to power systems," Environment Systems and Decisions, Springer, vol. 42(2), pages 251-264, June.
    7. Namtirtha, Amrita & Dutta, Animesh & Dutta, Biswanath, 2018. "Identifying influential spreaders in complex networks based on kshell hybrid method," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 499(C), pages 310-324.
    8. 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.
    9. 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.
    10. Zareie, Ahmad & Sheikhahmadi, Amir, 2019. "EHC: Extended H-index Centrality measure for identification of users’ spreading influence in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 514(C), pages 141-155.
    11. Wang, Juan & Li, Chao & Xia, Chengyi, 2018. "Improved centrality indicators to characterize the nodal spreading capability in complex networks," Applied Mathematics and Computation, Elsevier, vol. 334(C), pages 388-400.
    12. Xu, Shuang & Wang, Pei, 2017. "Identifying important nodes by adaptive LeaderRank," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 469(C), pages 654-664.
    13. Cerqueti, Roy & Ferraro, Giovanna & Iovanella, Antonio, 2019. "Measuring network resilience through connection patterns," Reliability Engineering and System Safety, Elsevier, vol. 188(C), pages 320-329.
    14. 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).
    15. Huang, Wencheng & Li, Haoran & Yin, Yanhui & Zhang, Zhi & Xie, Anhao & Zhang, Yin & Cheng, Guo, 2024. "Node importance identification of unweighted urban rail transit network: An Adjacency Information Entropy based approach," Reliability Engineering and System Safety, Elsevier, vol. 242(C).
    16. Sheikhahmadi, Amir & Nematbakhsh, Mohammad Ali & Zareie, Ahmad, 2017. "Identification of influential users by neighbors in online social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 486(C), pages 517-534.
    17. 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.
    18. Xu, Guiqiong & Meng, Lei, 2023. "A novel algorithm for identifying influential nodes in complex networks based on local propagation probability model," Chaos, Solitons & Fractals, Elsevier, vol. 168(C).
    19. Wang, Junyi & Hou, Xiaoni & Li, Kezan & Ding, Yong, 2017. "A novel weight neighborhood centrality algorithm for identifying influential spreaders in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 475(C), pages 88-105.
    20. Ai, Jun & He, Tao & Su, Zhan, 2023. "Identifying influential nodes in complex networks based on resource allocation similarity," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 627(C).

    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:606:y:2022:i:c:s0378437122006707. 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.