IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0292018.html

A network community structure similarity index for weighted networks

Author

Listed:
  • Milad Malekzadeh
  • Jed A Long

Abstract

Identification of communities in complex systems is an essential part of network analysis. Accordingly, measuring similarities between communities is a fundamental part of analysing community structure in different, yet related, networks. Commonly used methods for quantifying network community similarity fail to consider the effects of edge weights. Existing methods remain limited when the two networks being compared have different numbers of nodes. In this study, we address these issues by proposing a novel network community structure similarity index (NCSSI) based on the edit distance concept. NCSSI is proposed as a similarity index for comparing network communities. The NCSSI incorporates both community labels and edge weights. The NCSSI can also be employed to assess the similarity between two communities with varying numbers of nodes. We test the proposed method using simulated data and case-study analysis of New York Yellow Taxi flows and compare the results with that of other commonly used methods (i.e., mutual information and the Jaccard index). Our results highlight how NCSSI effectively captures the impact of both label and edge weight changes and their impacts on community structure, which are not captured in existing approaches. In conclusion, NCSSI offers a new approach that incorporates both label and weight variations for community similarity measurement in complex networks.

Suggested Citation

  • Milad Malekzadeh & Jed A Long, 2023. "A network community structure similarity index for weighted networks," PLOS ONE, Public Library of Science, vol. 18(11), pages 1-17, November.
  • Handle: RePEc:plo:pone00:0292018
    DOI: 10.1371/journal.pone.0292018
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0292018
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0292018&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0292018?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
    ---><---

    References listed on IDEAS

    as
    1. Fan, Ying & Li, Menghui & Zhang, Peng & Wu, Jinshan & Di, Zengru, 2007. "Accuracy and precision of methods for community identification in weighted networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 377(1), pages 363-372.
    2. Zhang, Peng & Li, Menghui & Wu, Jinshan & Di, Zengru & Fan, Ying, 2006. "The analysis and dissimilarity comparison of community structure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 367(C), pages 577-585.
    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. Nie, Tingyuan & Fan, Bo & Wang, Zhenhao, 2022. "Complexity and robustness of weighted circuit network of placement," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 598(C).
    2. Zhou, Kuang & Martin, Arnaud & Pan, Quan, 2015. "A similarity-based community detection method with multiple prototype representation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 438(C), pages 519-531.
    3. Li, Xiaojia & Li, Menghui & Hu, Yanqing & Di, Zengru & Fan, Ying, 2010. "Detecting community structure from coherent oscillation of excitable systems," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(1), pages 164-170.
    4. Zhang, Dawei & Xie, Fuding & Zhang, Yong & Dong, Fangyan & Hirota, Kaoru, 2010. "Fuzzy analysis of community detection in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(22), pages 5319-5327.

    More about this item

    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:plo:pone00:0292018. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.