Article Sidebar

Download
PDF
Statistic
Read Counter : 45 Download : 39

Main Article Content

Abstract

Community detection in complex networks needs methods that are not only structurally good, but also computationally efficient, stable, and interpretable. This study introduces a centroid-based community detection framework called Longest Distance Node Head Technique (LDNHT), where the first centroid is chosen randomly, and the others are determined by maximizing the total shortest-path distances from existing centroids. The method was tested on Facebook, Power-Grid, Wiki-Vote, and Gnutella networks in comparison with Random Node Head Technique (RNHT), Highest Degree Node Head Technique (HDNHT), classical max-min distance seeding, Louvain, and Fast-Greedy community detection. The stochastic methods were tested on more than 35 seeded runs, and the deterministic baselines were performed under the same experimental protocol. The modularity, External Connection Ratio (ECR), conductance, coverage, and runtime were used to assess partition quality. On Power-Grid and Wiki-Vote, its performance was significantly better than RNHT, HDNHT, and MAXMIN in terms of ECR and coverage, while Louvain and Fast-Greedy generally achieved higher modularity. Sensitivity analysis showed that the number of repeated initializations had a small impact, with the dependence on the first random centroid decreasing significantly with repeated initializations, and the benefit diminishing after about 20 internal iterations. The empirical scalability experiments on sparse networks showed approximately linear behavior, with a log-log slope of 0.911. Overall, LDNHT offers a comprehensible cumulative geodesic-dispersion strategy whose effectiveness is dependent on network structure and parameter configuration.

Keywords

Community detection Complex networks LDNHT Geodesic distance Graph partitioning

Article Details

How to Cite
Amedapu, S. ., & Velusamy R , L. . (2026). An intelligent distance-driven community detection framework for complex networks using the longest distance node head technique (LDNHT). Future Technology, 5(4), 199–210. Retrieved from https://fupubco.com/futech/article/view/1018
Download Citation
Endnote/Zotero/Mendeley (RIS)
BibTeX
Bookmark and Share

References

  1. M. Girvan and M. E. J. Newman, “Community structure in social and biological networks,” Proc. Natl. Acad. Sci. USA, vol. 99, no. 12, pp. 7821–7826, 2002.
  2. V. A. Traag, L. Waltman, and N. J. van Eck, “From Louvain to Leiden: Guaranteeing well-connected communities,” Sci. Rep., vol. 9, art. 5233, 2019.
  3. S. Gupta and S. Deodhar, “Understanding digitally enabled complex networks: A plural granulation based hybrid community detection approach,” Inf. Technol. People, vol. 37, no. 2, pp. 919–943, 2024.
  4. A. Bouyer, P. Shahgholi, B. Arasteh, A. G. Oskouei, and X. Liu, “Community detection via core node identification and local label diffusion with GraphSAGE boundary refinement in complex networks,” J. Netw. Comput. Appl., vol. 235, art. 104399, 2025.
  5. P. Danner and H. de Meer, “Community detection in energy networks based on energy self-sufficiency and dynamic flexibility activation,” in Proc. 16th ACM Int. Conf. Future Sustain. Energy Syst. (E-Energy), 2025, pp. 564–576.
  6. T. Hachaj and J. Wąs, “Rough neighborhood graph: A method for proximity modeling and data clustering,” Appl. Soft Comput., vol. 171, art. 112789, 2025.
  7. C. He, X. Fei, Q. Cheng, H. Li, and Y. Tang, “A survey of community detection in complex networks using nonnegative matrix factorization,” IEEE Access, vol. 10, pp. 103232–103257, 2022.
  8. B. Saha, “Complex networks, communities, and clustering: A survey of community detection techniques,” J. Netw. Comput. Appl., vol. 215, art. 103612, 2023.
  9. F. Dabaghi-Zarandi, M. Sadeghi, and M. R. Meybodi, “Community detection in complex networks using local and global information,” Appl. Intell., vol. 52, no. 10, pp. 11423–11438, 2022.
  10. J. Yao, H. Liu, and Y. Zhang, “Community detection method for complex networks based on node influence analysis,” Symmetry, vol. 16, no. 6, art. 754, 2024.
  11. L. Waltman and N. J. van Eck, “A smart local moving algorithm for large-scale modularity-based community detection,” Eur. Phys. J. B, vol. 86, no. 11, art. 471, 2013.
  12. J. Yang, J. McAuley, and J. Leskovec, “Community detection in networks with node attributes,” in Proc. IEEE 13th Int. Conf. Data Mining (ICDM), 2013, pp. 1151–1156.
  13. J. Xie and B. K. Szymanski, “LabelRank: A stabilized label propagation algorithm for community detection in networks,” in Proc. IEEE 2nd Netw. Sci. Workshop (NSW), 2013, pp. 138–143.
  14. G. Cordasco and L. Gargano, “Label propagation algorithm: A semi-synchronous approach,” Int. J. Soc. Netw. Min., vol. 1, no. 1, pp. 3–26, 2012.
  15. A. Grover and J. Leskovec, “node2vec: Scalable feature learning for networks,” in Proc. 22nd ACM SIGKDD Int. Conf. Knowl. Discov. Data Min., 2016, pp. 855–864.
  16. T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” arXiv preprint arXiv:1609.02907, 2016.
  17. L. Lü, D. Chen, X. L. Ren, Q. M. Zhang, Y. C. Zhang, and T. Zhou, “Vital nodes identification in complex networks,” Phys. Rep., vol. 650, pp. 1–63, 2016.
  18. D. Chen, L. Lü, M. S. Shang, Y. C. Zhang, and T. Zhou, “Identifying influential nodes in complex networks,” Physica A, vol. 391, no. 4, pp. 1777–1787, 2012.
  19. G. Rossetti and R. Cazabet, “Community discovery in dynamic networks: A survey,” ACM Comput. Surv., vol. 51, no. 2, art. 35, 2018.
  20. A. Lancichinetti, S. Fortunato, and F. Radicchi, “Benchmark graphs for testing community detection algorithms,” Phys. Rev. E, vol. 78, no. 4, art. 046110, 2008.
  21. J. Leskovec and R. Sosič, “SNAP: A general-purpose network analysis and graph-mining library,” ACM Trans. Intell. Syst. Technol., vol. 8, no. 1, pp. 1–20, 2016.
  22. M. N. Al-Andoli, S. C. Tan, W. P. Cheah, and S. Y. Tan, “A review on community detection in large complex networks from conventional to deep learning methods: A call for the use of parallel meta-heuristic algorithms,” IEEE Access, vol. 9, pp. 96501–96527, 2021.
  23. E. Karampour, M. R. Malek, and M. Eidi, “Discrete Ricci flow: A powerful method for community detection in location-based social networks,” Comput. Electr. Eng., vol. 123, art. 110302, 2025.
  24. A. Amini, M. Paez, and L. Lin, “Hierarchical stochastic block model for community detection in multiplex networks,” Bayesian Anal., vol. 19, no. 1, pp. 319–345, 2024.
  25. A. Kumar, A. Kumari, P. Kumar, and R. Dohare, “Overlapping community detection with a new modularity measure in directed weighted networks,” Data Min. Knowl. Discov., vol. 39, no. 6, art. 77, 2025.
  26. Ü. Işlak and B. Yeşiloğlu, “Analysis of clustering and degree index in random graphs and complex networks,” J. Appl. Probab., vol. 61, no. 4, pp. 1–31, 2024.
  27. M. V. Sankar, B. Ravindran, and S. Shivashankar, “CEIL: A scalable, resolution-limit-free approach for detecting communities in large networks,” in Proc. 24th Int. Joint Conf. Artif. Intell. (IJCAI), 2015, pp. 2097–2103.
  28. J. Leskovec and R. Sosič, “SNAP: A general-purpose network analysis and graph-mining library,” ACM Trans. Intell. Syst. Technol., vol. 8, no. 1, pp. 1–20, 2016. [Online]. Available: https://snap.stanford.edu/data/
  29. J. Leskovec and A. Krevl, “SNAP Datasets: Wiki-Vote network dataset,” 2014. [Online]. Available: https://snap.stanford.edu/data/wiki-Vote.html
  30. J. Leskovec and A. Krevl, “SNAP Datasets: Gnutella peer-to-peer network (p2p-Gnutella08),” 2014. [Online]. Available: https://snap.stanford.edu/data/p2p-Gnutella08.html
  31. R. A. Rossi and N. K. Ahmed, “The network data repository with interactive graph analytics and visualization,” in Proc. AAAI Conf. Artif. Intell., 2015. [Online]. Available: https://networkrepository.com/inf-power.php
  32. T. F. Gonzalez, “Clustering to minimize the maximum intercluster distance,” Theor. Comput. Sci., vol. 38, pp. 293–306, 1985, doi: 10.1016/0304-3975(85)90224-5.