{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T06:17:40Z","timestamp":1770877060472,"version":"3.50.1"},"reference-count":30,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers"],"abstract":"<jats:p>Community detection plays a central role in understanding the modular structure of complex networks. This work introduces Spider Community Detection, a hybrid local\u2013global algorithm that constructs communities through a depth-bounded geodesic expansion process. Each spider originates from a structurally strong seed node selected using a composite score based on degree, triangle participation, and local clustering. From each seed, the algorithm grows a localized spider-shaped subgraph through bounded breadth-first exploration, where candidate nodes are evaluated using true modularity gain together with a triangle-closure signal. After the initial spider construction, the method applies modularity-guided attachment of the remaining vertices, Louvain-style local refinement, and greedy merge matching under conductance constraints to reconcile local structure with global partition coherence. Experimental evaluations on real and benchmark datasets, including Karate Club, High School, Political Blogs, Cora, and DBLP, show that Spider produces partitions that are competitive with the established methods in terms of ground-truth recovery and structural quality, while yielding communities with sharp boundaries under conductance-sensitive evaluation.<\/jats:p>","DOI":"10.3390\/computers15020083","type":"journal-article","created":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T10:48:01Z","timestamp":1770115681000},"page":"83","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Spider Community Detection: Seeded Geodesic Expansion with Modularity-Guided Refinement and Greedy Merge Matching"],"prefix":"10.3390","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7260-4186","authenticated-orcid":false,"given":"Hovhannes A.","family":"Harutyunyan","sequence":"first","affiliation":[{"name":"Department of Computer Science and Software Engineering, Concordia University, Montreal, QC H3G 1M8, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2546-9676","authenticated-orcid":false,"given":"Parsa","family":"Kamalipour","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Software Engineering, Concordia University, Montreal, QC H3G 1M8, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2026,2,1]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","article-title":"Community detection in graphs","volume":"486","author":"Fortunato","year":"2010","journal-title":"Phys. Rep."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"8577","DOI":"10.1073\/pnas.0601602103","article-title":"Modularity and community structure in networks","volume":"103","author":"Newman","year":"2006","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","article-title":"Finding and evaluating community structure in networks","volume":"69","author":"Newman","year":"2004","journal-title":"Phys. Rev. E"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","article-title":"Fast unfolding of communities in large networks","volume":"2008","author":"Blondel","year":"2008","journal-title":"J. Stat. Mech. Theory Exp."},{"key":"ref_5","unstructured":"Ng, A.Y., Jordan, M.I., and Weiss, Y. (2002, January 3\u20135). On spectral clustering: Analysis and an algorithm. Proceedings of the Advances in Neural Information Processing Systems, Vancouver, BC, Canada."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1073\/pnas.0605965104","article-title":"Resolution limit in community detection","volume":"104","author":"Fortunato","year":"2007","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"036106","DOI":"10.1103\/PhysRevE.76.036106","article-title":"Near linear time algorithm to detect community structures in large-scale networks","volume":"76","author":"Raghavan","year":"2007","journal-title":"Phys. Rev. E"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1118","DOI":"10.1073\/pnas.0706851105","article-title":"Maps of random walks on complex networks reveal community structure","volume":"105","author":"Rosvall","year":"2008","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Lancichinetti, A., Radicchi, F., Ramasco, J.J., and Fortunato, S. (2011). Finding statistically significant communities in networks. PLoS ONE, 6.","DOI":"10.1371\/journal.pone.0018961"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1706","DOI":"10.1016\/j.physa.2008.12.021","article-title":"Detect overlapping and hierarchical community structure in networks","volume":"388","author":"Shen","year":"2009","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physrep.2016.09.002","article-title":"Community detection in networks: A user guide","volume":"659","author":"Fortunato","year":"2016","journal-title":"Phys. Rep."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1038\/nature09182","article-title":"Link communities reveal multiscale complexity in networks","volume":"466","author":"Ahn","year":"2010","journal-title":"Nature"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"056117","DOI":"10.1103\/PhysRevE.80.056117","article-title":"Community detection algorithms: A comparative analysis","volume":"80","author":"Lancichinetti","year":"2009","journal-title":"Phys. Rev. E"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1126\/science.aad9029","article-title":"Higher-order organization of complex networks","volume":"353","author":"Benson","year":"2016","journal-title":"Science"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"2809","DOI":"10.1007\/s10878-021-00794-2","article-title":"A new metric to compare local community detection algorithms in social networks using geodesic distance","volume":"44","author":"Bakhtar","year":"2022","journal-title":"J. Comb. Optim."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"P09008","DOI":"10.1088\/1742-5468\/2005\/09\/P09008","article-title":"Comparing community structure identification","volume":"2005","author":"Danon","year":"2005","journal-title":"J. Stat. Mech. Theory Exp."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Andersen, R., Chung, F., and Lang, K. (2006, January 21\u201324). Local graph partitioning using PageRank vectors. Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201906), Berkeley, CA, USA.","DOI":"10.1109\/FOCS.2006.44"},{"key":"ref_18","unstructured":"Andersen, R., and Lang, K.J. (July, January 28). Communities from seed sets. Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Paris, France."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"5233","DOI":"10.1038\/s41598-019-41695-z","article-title":"From Louvain to Leiden: Guaranteeing well-connected communities","volume":"9","author":"Traag","year":"2019","journal-title":"Sci. Rep."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Li, D., Kosugi, S., Zhang, Y., Okumura, M., Xia, F., and Jiang, R. (2025, January 13\u201317). Revisiting Dynamic Graph Clustering via Matrix Factorization. Proceedings of the ACM on Web Conference 2025, Taipei, Taiwan.","DOI":"10.1145\/3696410.3714646"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1653","DOI":"10.1109\/TCYB.2021.3107679","article-title":"Joint Learning of Feature Extraction and Clustering for Large-Scale Temporal Networks","volume":"53","author":"Li","year":"2023","journal-title":"IEEE Trans. Cybern."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","article-title":"An information flow model for conflict and fission in small groups","volume":"33","author":"Zachary","year":"1977","journal-title":"J. Anthropol. Res."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Mastrandrea, R., Fournet, J., and Barrat, A. (2015). Contact patterns in a high school: A comparison between data collected using wearable sensors, contact diaries and friendship surveys. PLoS ONE, 10.","DOI":"10.1371\/journal.pone.0136497"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Stehl\u00e9, J., Voirin, N., Barrat, A., Cattuto, C., Isella, L., Pinton, J.F., Quaggiotto, M., Van den Broeck, W., Regis, C., and Lina, B. (2011). High-resolution measurements of face-to-face contact patterns in a primary school. PLoS ONE, 6.","DOI":"10.1371\/journal.pone.0023176"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Adamic, L.A., and Glance, N. (2005, January 21). The political blogosphere and the 2004 US election: Divided they blog. Proceedings of the 3rd International Workshop on Link Discovery, Chicago, IL, USA.","DOI":"10.1145\/1134271.1134277"},{"key":"ref_26","first-page":"93","article-title":"Collective classification in network data","volume":"29","author":"Sen","year":"2008","journal-title":"AI Mag."},{"key":"ref_27","unstructured":"Leskovec, J., and Krevl, A. (2025, September 15). SNAP: Stanford Large Network Dataset Collection. Available online: https:\/\/snap.stanford.edu\/data."},{"key":"ref_28","unstructured":"Ley, M. (September, January 30). DBLP\u2014Some lessons learned. Proceedings of the VLDB Endowment, Hong Kong, China."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"033015","DOI":"10.1088\/1367-2630\/11\/3\/033015","article-title":"Detecting the overlapping and hierarchical community structure in complex networks","volume":"11","author":"Lancichinetti","year":"2009","journal-title":"New J. Phys."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"026132","DOI":"10.1103\/PhysRevE.72.026132","article-title":"Finding local community structure in networks","volume":"72","author":"Clauset","year":"2005","journal-title":"Phys. Rev. E"}],"container-title":["Computers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-431X\/15\/2\/83\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T05:24:43Z","timestamp":1770873883000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-431X\/15\/2\/83"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,1]]},"references-count":30,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2026,2]]}},"alternative-id":["computers15020083"],"URL":"https:\/\/doi.org\/10.3390\/computers15020083","relation":{},"ISSN":["2073-431X"],"issn-type":[{"value":"2073-431X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,1]]}}}