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

A spectral method to detect community structure based on the communicability modularity

Author

Listed:
  • Xu, Ying

Abstract

Community detection in complex networks is a topic of high interest in many fields. In this paper, we propose a new algorithm based on the communicability of vertices, rather than the most weakly connected vertex pairs or a number of edges between communities. Furthermore, the accuracy and efficiency of this algorithm are tested by some representative real-world networks and computer-generated networks(GN networks). The experimental results indicate that the proposed algorithm can accurately and effectively detect the community structure in these networks with higher values of modularity.

Suggested Citation

  • Xu, Ying, 2020. "A spectral method to detect community structure based on the communicability modularity," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 537(C).
  • Handle: RePEc:eee:phsmap:v:537:y:2020:i:c:s037843711931564x
    DOI: 10.1016/j.physa.2019.122751
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037843711931564X
    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.2019.122751?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. 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.
    2. Mehrle, David & Strosser, Amy & Harkin, Anthony, 2015. "Walk-modularity and community structure in networks," Network Science, Cambridge University Press, vol. 3(3), pages 348-360, September.
    3. Xu, Ying, 2019. "Community detection based on network communicability distance," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 515(C), pages 112-118.
    4. David Liben‐Nowell & Jon Kleinberg, 2007. "The link‐prediction problem for social networks," Journal of the American Society for Information Science and Technology, Association for Information Science & Technology, vol. 58(7), pages 1019-1031, May.
    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. Agrawal, Smita & Patel, Atul, 2021. "SAG Cluster: An unsupervised graph clustering based on collaborative similarity for community detection in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 563(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. Chen, Xing & Wu, Tao & Xian, Xingping & Wang, Chao & Yuan, Ye & Ming, Guannan, 2020. "Enhancing robustness of link prediction for noisy complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 555(C).
    2. Yifei Zhou & Shaoyong Li & Yaping Liu, 2020. "Graph-based Method for App Usage Prediction with Attributed Heterogeneous Network Embedding," Future Internet, MDPI, vol. 12(3), pages 1-16, March.
    3. Zhang, Yun & Liu, Yongguo & Li, Jieting & Zhu, Jiajing & Yang, Changhong & Yang, Wen & Wen, Chuanbiao, 2020. "WOCDA: A whale optimization based community detection algorithm," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 539(C).
    4. Rezvanian, Alireza & Meybodi, Mohammad Reza, 2015. "Sampling social networks using shortest paths," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 424(C), pages 254-268.
    5. Nora Connor & Albert Barberán & Aaron Clauset, 2017. "Using null models to infer microbial co-occurrence networks," PLOS ONE, Public Library of Science, vol. 12(5), pages 1-23, May.
    6. Leto Peel & Tiago P. Peixoto & Manlio De Domenico, 2022. "Statistical inference links data and theory in network science," Nature Communications, Nature, vol. 13(1), pages 1-15, December.
    7. Rafiee, Samira & Salavati, Chiman & Abdollahpouri, Alireza, 2020. "CNDP: Link prediction based on common neighbors degree penalization," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 539(C).
    8. Bikramjit Das & Tiandong Wang & Gengling Dai, 2022. "Asymptotic Behavior of Common Connections in Sparse Random Networks," Methodology and Computing in Applied Probability, Springer, vol. 24(3), pages 2071-2092, September.
    9. Liu, X. & Murata, T., 2010. "Advanced modularity-specialized label propagation algorithm for detecting communities in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(7), pages 1493-1500.
    10. Lee, Yan-Li & Zhou, Tao, 2021. "Collaborative filtering approach to link prediction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 578(C).
    11. Greg Morrison & L Mahadevan, 2012. "Discovering Communities through Friendship," PLOS ONE, Public Library of Science, vol. 7(7), pages 1-9, July.
    12. Etienne Côme & Nicolas Jouvin & Pierre Latouche & Charles Bouveyron, 2021. "Hierarchical clustering with discrete latent variable models and the integrated classification likelihood," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 15(4), pages 957-986, December.
    13. Liu, Zhenfeng & Feng, Jian & Uden, Lorna, 2023. "Technology opportunity analysis using hierarchical semantic networks and dual link prediction," Technovation, Elsevier, vol. 128(C).
    14. 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.
    15. Shugang Li & Ziming Wang & Beiyan Zhang & Boyi Zhu & Zhifang Wen & Zhaoxu Yu, 2022. "The Research of “Products Rapidly Attracting Users” Based on the Fully Integrated Link Prediction Algorithm," Mathematics, MDPI, vol. 10(14), pages 1-19, July.
    16. 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.
    17. Chunjiang Liu & Yikun Han & Haiyun Xu & Shihan Yang & Kaidi Wang & Yongye Su, 2024. "A Community Detection and Graph-Neural-Network-Based Link Prediction Approach for Scientific Literature," Mathematics, MDPI, vol. 12(3), pages 1-20, January.
    18. 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.
    19. Hu, Fang & Liu, Jia & Li, Liuhuan & Liang, Jun, 2020. "Community detection in complex networks using Node2vec with spectral clustering," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 545(C).
    20. Giorgos Stamatelatos & George Drosatos & Sotirios Gyftopoulos & Helen Briola & Pavlos S. Efraimidis, 2021. "Point-of-interest lists and their potential in recommendation systems," Information Technology & Tourism, Springer, vol. 23(2), pages 209-239, June.

    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:537:y:2020:i:c:s037843711931564x. 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.