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

Community detection using boundary nodes in complex networks

Author

Listed:
  • Tasgin, Mursel
  • Bingol, Haluk O.

Abstract

We propose a new local community detection algorithm that finds communities by identifying borderlines between them using boundary nodes. Our method performs label propagation for community detection, where nodes decide their labels based on the largest “benefit score” exhibited by their immediate neighbors as an attractor to their communities. We try different metrics and find that using the number of common neighbors as benefit scores leads to better decisions for community structure. The proposed algorithm has a local approach and focuses only on boundary nodes during iterations of label propagation, which eliminates unnecessary steps and shortens the overall execution time. It preserves small communities as well as big ones and can outperform other algorithms in terms of the quality of the identified communities, especially when the community structure is subtle. The algorithm has a distributed nature and can be used on large networks in a parallel fashion.

Suggested Citation

  • Tasgin, Mursel & Bingol, Haluk O., 2019. "Community detection using boundary nodes in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 513(C), pages 315-324.
    • Handle: RePEc:eee:phsmap:v:513:y:2019:i:c:p:315-324
    DOI: 10.1016/j.physa.2018.09.044
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437118311658
    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.2018.09.044?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. Michael T. SCHAUB & Jean-Charles DELVENNE, 2017. "The many facets of community detection in complex networks," LIDAM Reprints CORE 2890, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. Eustace, Justine & Wang, Xingyuan & Cui, Yaozu, 2015. "Community detection using local neighborhood in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 436(C), pages 665-677.
    3. Tasgin, Mursel & Bingol, Haluk O., 2018. "Community detection using preference networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 495(C), pages 126-136.
    4. Andrea Lancichinetti & Filippo Radicchi & José J Ramasco & Santo Fortunato, 2011. "Finding Statistically Significant Communities in Networks," PLOS ONE, Public Library of Science, vol. 6(4), pages 1-18, April.
    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. Aghaalizadeh, Saeid & Afshord, Saeid Taghavi & Bouyer, Asgarali & Anari, Babak, 2021. "A three-stage algorithm for local community detection based on the high node importance ranking in social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 563(C).
    2. Steffi Siegert & Mikael Holmgren Caicedo & Maria Mårtensson Hansson, 2020. "Boundaryless Twitter Use: On the Affordances of Social Media," Social Sciences, MDPI, vol. 9(11), pages 1-18, November.

    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. Wu, Jianshe & Zhang, Long & Li, Yong & Jiao, Yang, 2016. "Partition signed social networks via clustering dynamics," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 443(C), pages 568-582.
    2. Garza, Sara E. & Schaeffer, Satu Elisa, 2019. "Community detection with the Label Propagation Algorithm: A survey," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 534(C).
    3. Yang, Jin-Xuan & Zhang, Xiao-Dong, 2017. "Finding overlapping communities using seed set," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 467(C), pages 96-106.
    4. Gregory, Steve, 2012. "Ordered community structure in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(8), pages 2752-2763.
    5. Ke Hu & Ju Xiang & Yun-Xia Yu & Liang Tang & Qin Xiang & Jian-Ming Li & Yong-Hong Tang & Yong-Jun Chen & Yan Zhang, 2020. "Significance-based multi-scale method for network community detection and its application in disease-gene prediction," PLOS ONE, Public Library of Science, vol. 15(3), pages 1-24, March.
    6. Zhu, Jiajing & Liu, Yongguo & Zhang, Yun & Liu, Xiaofeng & Xiao, Yonghua & Wang, Shidong & Wu, Xindong, 2017. "Exploring anti-community structure in networks with application to incompatibility of traditional Chinese medicine," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 486(C), pages 31-43.
    7. Chang, Y.F. & Han, S.K. & Wang, X.D., 2018. "The way to uncover community structure with core and diversity," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 501(C), pages 111-119.
    8. Wu, Zhihao & Lin, Youfang & Wan, Huaiyu & Tian, Shengfeng & Hu, Keyun, 2012. "Efficient overlapping community detection in huge real-world networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(7), pages 2475-2490.
    9. 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.
    10. Vanessa Ioannoni & Tommaso Vitale & Corrado Costa & Iris Elliott, 2020. "Depicting communities of Romani studies: on the who, when and where of Roma related scientific publications," Scientometrics, Springer;Akadémiai Kiadó, vol. 122(3), pages 1473-1490, March.
    11. Greg Morrison & L Mahadevan, 2012. "Discovering Communities through Friendship," PLOS ONE, Public Library of Science, vol. 7(7), pages 1-9, July.
    12. Jiang, Yawen & Jia, Caiyan & Yu, Jian, 2013. "An efficient community detection method based on rank centrality," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(9), pages 2182-2194.
    13. Franke, R., 2016. "CHIMERA: Top-down model for hierarchical, overlapping and directed cluster structures in directed and weighted complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 461(C), pages 384-408.
    14. Chagas, Guilherme Oliveira & Lorena, Luiz Antonio Nogueira & dos Santos, Rafael Duarte Coelho, 2022. "A hybrid heuristic for overlapping community detection through the conductance minimization," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 592(C).
    15. Dugué, Nicolas & Perez, Anthony, 2022. "Direction matters in complex networks: A theoretical and applied study for greedy modularity optimization," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 603(C).
    16. Badie, Reza & Aleahmad, Abolfazl & Asadpour, Masoud & Rahgozar, Maseud, 2013. "An efficient agent-based algorithm for overlapping community detection using nodes’ closeness," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(20), pages 5231-5247.
    17. Klapka, Pavel & Kraft, Stanislav & Halás, Marián, 2020. "Network based definition of functional regions: A graph theory approach for spatial distribution of traffic flows," Journal of Transport Geography, Elsevier, vol. 88(C).
    18. Yerali Gandica & Marco Valerio Geraci & Sophie Béreau & Jean-Yves Gnabo, 2018. "Fragmentation, integration and macroprudential surveillance of the US financial industry: Insights from network science," PLOS ONE, Public Library of Science, vol. 13(4), pages 1-23, April.
    19. Wang, Yuyao & Bu, Zhan & Yang, Huan & Li, Hui-Jia & Cao, Jie, 2021. "An effective and scalable overlapping community detection approach: Integrating social identity model and game theory," Applied Mathematics and Computation, Elsevier, vol. 390(C).
    20. Fu, Xianghua & Liu, Liandong & Wang, Chao, 2013. "Detection of community overlap according to belief propagation and conflict," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(4), pages 941-952.

    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:513:y:2019:i:c:p:315-324. 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.