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

A new method for quantifying network cyclic structure to improve community detection

Author

Listed:
  • Moradi-Jamei, Behnaz
  • Shakeri, Heman
  • Poggi-Corradini, Pietro
  • Higgins, Michael J.

Abstract

A distinguishing property of communities in networks is that cycles are more prevalent within communities than across communities. Thus, the detection of these communities may be aided through the incorporation of measures of the local “richness” of the cyclic structure. In this paper, we introduce renewal non-backtracking random walks (RNBRW) as a way of quantifying this structure. RNBRW gives a weight to each edge equal to the probability that a non-backtracking random walk completes a cycle with that edge. Hence, edges with larger weights may be thought of as more important to the formation of cycles. Of note, since separate random walks can be performed in parallel, RNBRW weights can be estimated very quickly, even for large graphs. We give simulation results showing that pre-weighting edges through RNBRW may substantially improve the performance of common community detection algorithms. Our results suggest that RNBRW is especially efficient for the challenging case of detecting communities in sparse graphs.

Suggested Citation

  • Moradi-Jamei, Behnaz & Shakeri, Heman & Poggi-Corradini, Pietro & Higgins, Michael J., 2021. "A new method for quantifying network cyclic structure to improve community detection," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 561(C).
    • Handle: RePEc:eee:phsmap:v:561:y:2021:i:c:s0378437120305847
    DOI: 10.1016/j.physa.2020.125116
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437120305847
    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.125116?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. Sun, Peng Gang, 2014. "Weighting links based on edge centrality for community detection," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 394(C), pages 346-357.
    2. Zhang, Peng & Wang, Jinliang & Li, Xiaojia & Li, Menghui & Di, Zengru & Fan, Ying, 2008. "Clustering coefficient and community structure of bipartite networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(27), pages 6869-6875.
    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. Fessina, Massimiliano & Zaccaria, Andrea & Cimini, Giulio & Squartini, Tiziano, 2024. "Pattern-detection in the global automotive industry: A manufacturer-supplier-product network analysis," Chaos, Solitons & Fractals, Elsevier, vol. 181(C).
    2. 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.
    3. He, Dongxiao & Wang, Hongcui & Jin, Di & Liu, Baolin, 2016. "A model framework for the enhancement of community detection in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 461(C), pages 602-612.
    4. Chen, Chunchun & Zhu, Wenjie & Peng, Bo, 2022. "Differentiated graph regularized non-negative matrix factorization for semi-supervised community detection," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 604(C).
    5. Li, Kaiwen & Liu, Kai & Wang, Ming, 2021. "Robustness of the Chinese power grid to cascading failures under attack and defense strategies," International Journal of Critical Infrastructure Protection, Elsevier, vol. 33(C).
    6. Gu, Ke & Fan, Ying & Zeng, An & Zhou, Jianlin & Di, Zengru, 2018. "Analysis on large-scale rating systems based on the signed network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 507(C), pages 99-109.
    7. Wang, Chao & Liu, Xiaoxing & Chen, Boyi & Li, Menyu, 2023. "Topological properties of reconstructed credit networks and banking systemic risk," The North American Journal of Economics and Finance, Elsevier, vol. 66(C).
    8. 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.
    9. Ramadiah, Amanah & Caccioli, Fabio & Fricke, Daniel, 2019. "Reconstructing and stress testing credit networks," LSE Research Online Documents on Economics 118938, London School of Economics and Political Science, LSE Library.
    10. Sun, Hong-liang & Ch’ng, Eugene & Yong, Xi & Garibaldi, Jonathan M. & See, Simon & Chen, Duan-bing, 2018. "A fast community detection method in bipartite networks by distance dynamics," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 496(C), pages 108-120.
    11. Ramadiah, Amanah & Caccioli, Fabio & Fricke, Daniel, 2020. "Reconstructing and stress testing credit networks," Journal of Economic Dynamics and Control, Elsevier, vol. 111(C).
    12. Sun, Peng Gang & Sun, Xiya, 2017. "Complete graph model for community detection," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 471(C), pages 88-97.
    13. Long, Yong-Shang & Jia, Zhen & Wang, Ying-Ying, 2018. "Coarse graining method based on generalized degree in complex network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 505(C), pages 655-665.
    14. Cui, Yaozu & Wang, Xingyuan, 2016. "Detecting one-mode communities in bipartite networks by bipartite clustering triangular," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 457(C), pages 307-315.
    15. Cui, Yaozu & Wang, Xingyuan, 2014. "Uncovering overlapping community structures by the key bi-community and intimate degree in bipartite networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 407(C), pages 7-14.
    16. Hu, Fang & Liu, Yuhua, 2016. "A new algorithm CNM-Centrality of detecting communities based on node centrality," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 446(C), pages 138-151.
    17. Liebig, Jessica & Rao, Asha, 2016. "Predicting item popularity: Analysing local clustering behaviour of users," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 442(C), pages 523-531.
    18. Neelu Chaudhary & Hardeo Kumar Thakur & Rinky Dwivedi, 2022. "An ensemble model to optimize modularity in dynamic bipartite networks," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 13(5), pages 2248-2260, October.
    19. Sho Tsugawa & Yukihiro Matsumoto & Hiroyuki Ohsaki, 2015. "On the robustness of centrality measures against link weight quantization in social networks," Computational and Mathematical Organization Theory, Springer, vol. 21(3), pages 318-339, September.
    20. Qiao, Jian & Meng, Ying-Ying & Chen, Hsinchun & Huang, Hong-Qiao & Li, Guo-Ying, 2016. "Modeling one-mode projection of bipartite networks by tagging vertex information," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 457(C), pages 270-279.

    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:eee:phsmap:v:561:y:2021:i:c:s0378437120305847. 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.