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

Assessing the stability of collaboration networks: A structural cohesion analysis perspective

Author

Listed:
  • Zhang, Dayong
  • Men, Hao
  • Zhang, Zhaoxin

Abstract

In collaboration networks, a stable structure can lead to trust and enhance group members’ ties, in turn reducing conflicts and promoting communication and cooperation. Therefore, network stability assessment, especially for collaboration networks, is essential for facilitating the achievement of group goals. However, most previous studies have considered only a fundamental understanding of network stability from the perspective of network connectivity or interpersonal relationships. Few studies have been conducted to reveal the influence of endogenous structural cohesion on network stability. In fact, greater structural cohesion indicates greater adaptability in uncertain environments. Thus, we propose evaluating the stability of collaboration networks from a structural cohesion perspective. Our study focuses on two dimensions of structural cohesion: core member identification and structural robustness measurements. Considering the unique structure of collaboration networks, a new algorithm, named the improved K-shell decomposition algorithm, is proposed to identify the core member set embedded in the innermost layer of a network. Compared with traditional identification algorithms, our algorithm can achieve a better trade-off between computational accuracy and computational complexity. Experimental results obtained on real-world networks verify the performance of our algorithm. In addition, it was found that the stability of collaboration networks can be effectively improved through targeted prevention efforts at the core members identified by our algorithm.

Suggested Citation

  • Zhang, Dayong & Men, Hao & Zhang, Zhaoxin, 2024. "Assessing the stability of collaboration networks: A structural cohesion analysis perspective," Journal of Informetrics, Elsevier, vol. 18(1).
  • Handle: RePEc:eee:infome:v:18:y:2024:i:1:s1751157724000038
    DOI: 10.1016/j.joi.2024.101490
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.joi.2024.101490?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. 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.
    2. Flaviano Morone & Hernán A. Makse, 2015. "Correction: Corrigendum: Influence maximization in complex networks through optimal percolation," Nature, Nature, vol. 527(7579), pages 544-544, November.
    3. Crucitti, Paolo & Latora, Vito & Marchiori, Massimo & Rapisarda, Andrea, 2004. "Error and attack tolerance of complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 340(1), pages 388-394.
    4. Jalili, Mahdi, 2011. "Error and attack tolerance of small-worldness in complex networks," Journal of Informetrics, Elsevier, vol. 5(3), pages 422-430.
    5. Pinto, Pablo E. & Vallone, Andres & Honores, Guillermo, 2019. "The structure of collaboration networks: Findings from three decades of co-invention patents in Chile," Journal of Informetrics, Elsevier, vol. 13(4).
    6. Sergey V. Buldyrev & Roni Parshani & Gerald Paul & H. Eugene Stanley & Shlomo Havlin, 2010. "Catastrophic cascade of failures in interdependent networks," Nature, Nature, vol. 464(7291), pages 1025-1028, April.
    7. Pablo M. Gleiser & Leon Danon, 2003. "Community Structure In Jazz," Advances in Complex Systems (ACS), World Scientific Publishing Co. Pte. Ltd., vol. 6(04), pages 565-573.
    8. Hatani, Faith & McGaughey, Sara L., 2013. "Network cohesion in global expansion: An evolutionary view," Journal of World Business, Elsevier, vol. 48(4), pages 455-465.
    9. Réka Albert & Hawoong Jeong & Albert-László Barabási, 2000. "Error and attack tolerance of complex networks," Nature, Nature, vol. 406(6794), pages 378-382, July.
    10. Flaviano Morone & Hernán A. Makse, 2015. "Influence maximization in complex networks through optimal percolation," Nature, Nature, vol. 524(7563), pages 65-68, August.
    11. Mani , Dalhia & Moody , James, 2014. "Moving Beyond Stylized Economic Network Models: The Hybrid World of the Indian Firm Ownership Network," HEC Research Papers Series 1031, HEC Paris.
    12. Valente, Thomas W. & Coronges, Kathryn A. & Stevens, Gregory D. & Cousineau, Michael R., 2008. "Collaboration and competition in a children's health initiative coalition: A network analysis," Evaluation and Program Planning, Elsevier, vol. 31(4), pages 392-402, November.
    13. Tony H. Grubesic & Timothy C. Matisziw & Alan T. Murray & Diane Snediker, 2008. "Comparative Approaches for Assessing Network Vulnerability," International Regional Science Review, , vol. 31(1), pages 88-112, January.
    14. 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.
    15. Zhai, Li & Yan, Xiangbin, 2022. "A directed collaboration network for exploring the order of scientific collaboration," Journal of Informetrics, Elsevier, vol. 16(4).
    16. Viana, Matheus P. & Amancio, Diego R. & da F. Costa, Luciano, 2013. "On time-varying collaboration networks," Journal of Informetrics, Elsevier, vol. 7(2), pages 371-378.
    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. Gangwal, Utkarsh & Singh, Mayank & Pandey, Pradumn Kumar & Kamboj, Deepak & Chatterjee, Samrat & Bhatia, Udit, 2022. "Identifying early-warning indicators of onset of sudden collapse in networked infrastructure systems against sequential disruptions," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 591(C).
    2. 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.
    3. 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).
    4. Wen, Tao & Chen, Yu-wang & Syed, Tahir abbas & Wu, Ting, 2024. "ERIUE: Evidential reasoning-based influential users evaluation in social networks," Omega, Elsevier, vol. 122(C).
    5. Hao, Yucheng & Jia, Limin & Wang, Yanhui, 2020. "Edge attack strategies in interdependent scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 540(C).
    6. Aybike Ulusan & Ozlem Ergun, 2018. "Restoration of services in disrupted infrastructure systems: A network science approach," PLOS ONE, Public Library of Science, vol. 13(2), pages 1-28, February.
    7. 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.
    8. Wu, Tao & Xian, Xingping & Zhong, Linfeng & Xiong, Xi & Stanley, H. Eugene, 2018. "Power iteration ranking via hybrid diffusion for vital nodes identification," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 506(C), pages 802-815.
    9. Fan, Dongming & Sun, Bo & Dui, Hongyan & Zhong, Jilong & Wang, Ziyao & Ren, Yi & Wang, Zili, 2022. "A modified connectivity link addition strategy to improve the resilience of multiplex networks against attacks," Reliability Engineering and System Safety, Elsevier, vol. 221(C).
    10. Zhe Li & Xinyu Huang, 2023. "Identifying Influential Spreaders Using Local Information," Mathematics, MDPI, vol. 11(6), pages 1-14, March.
    11. Wang, Jingjing & Xu, Shuqi & Mariani, Manuel S. & Lü, Linyuan, 2021. "The local structure of citation networks uncovers expert-selected milestone papers," Journal of Informetrics, Elsevier, vol. 15(4).
    12. 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.
    13. Jiang, Zhong-Yuan & Zeng, Yong & Liu, Zhi-Hong & Ma, Jian-Feng, 2019. "Identifying critical nodes’ group in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 514(C), pages 121-132.
    14. 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.
    15. Kashyap, G. & Ambika, G., 2019. "Link deletion in directed complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 514(C), pages 631-643.
    16. Xiao-Long Ren & Niels Gleinig & Dijana Tolić & Nino Antulov-Fantulin, 2018. "Underestimated Cost of Targeted Attacks on Complex Networks," Complexity, Hindawi, vol. 2018, pages 1-15, January.
    17. Li Zeng & Changjun Fan & Chao Chen, 2023. "Leveraging Minimum Nodes for Optimum Key Player Identification in Complex Networks: A Deep Reinforcement Learning Strategy with Structured Reward Shaping," Mathematics, MDPI, vol. 11(17), pages 1-13, August.
    18. Kim, Dong Hwan & Eisenberg, Daniel A. & Chun, Yeong Han & Park, Jeryang, 2017. "Network topology and resilience analysis of South Korean power grid," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 465(C), pages 13-24.
    19. Almeira, Nahuel & Perotti, Juan Ignacio & Chacoma, Andrés & Billoni, Orlando Vito, 2021. "Explosive dismantling of two-dimensional random lattices under betweenness centrality attacks," Chaos, Solitons & Fractals, Elsevier, vol. 153(P1).
    20. Lv, Changchun & Yuan, Ziwei & Si, Shubin & Duan, Dongli, 2021. "Robustness of scale-free networks with dynamical behavior against multi-node perturbation," Chaos, Solitons & Fractals, Elsevier, vol. 152(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:infome:v:18:y:2024:i:1:s1751157724000038. 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.elsevier.com/locate/joi .

    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.