Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2506.01752 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911275670306816 |
|---|---|
| author | Santos, Guilherme O. Vieira, Lucas S. Rossetti, Giulio Ferreira, Carlos H. G. Moreira, Gladston |
| author_facet | Santos, Guilherme O. Vieira, Lucas S. Rossetti, Giulio Ferreira, Carlos H. G. Moreira, Gladston |
| contents | Community detection in complex networks is fundamental across social, biological, and technological domains. While traditional single-objective methods like Louvain and Leiden are computationally efficient, they suffer from resolution bias and structural degeneracy. Multi-objective evolutionary algorithms (MOEAs) address these limitations by simultaneously optimizing conflicting structural criteria, however, their high computational costs have historically limited their application to small networks. We present HP-MOCD, a High-Performance Evolutionary Multiobjective Community Detection Algorithm built on Non-dominated Sorting Genetic Algorithm II (NSGA-II), which overcomes these barriers through topology-aware genetic operators, full parallelization, and bit-level optimizations, achieving theoretical O(GN_p|V|) complexity. We conduct experiments on both synthetic and real-world networks. Results demonstrate strong scalability, with HP-MOCD processing networks of over 1,000,000 nodes while maintaining high quality across varying noise levels. It outperforms other MOEAs by more than 531 times in runtime on synthetic datasets, achieving runtimes as low as 57 seconds for graphs with 40,000 nodes on moderately powered hardware. Across 14 real-world networks, HP-MOCD was the only MOEA capable of processing the six largest datasets within a reasonable time, with results competitive with single-objective approaches. Unlike single-solution methods, HP-MOCD produces a Pareto Front, enabling individual-specific trade-offs and providing decision-makers with a spectrum of high-quality community structures. It introduces the first open-source Python MOEA library compatible with networkx and igraph for large-scale community detection. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_01752 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A High-Performance Evolutionary Multiobjective Community Detection Algorithm Santos, Guilherme O. Vieira, Lucas S. Rossetti, Giulio Ferreira, Carlos H. G. Moreira, Gladston Social and Information Networks Community detection in complex networks is fundamental across social, biological, and technological domains. While traditional single-objective methods like Louvain and Leiden are computationally efficient, they suffer from resolution bias and structural degeneracy. Multi-objective evolutionary algorithms (MOEAs) address these limitations by simultaneously optimizing conflicting structural criteria, however, their high computational costs have historically limited their application to small networks. We present HP-MOCD, a High-Performance Evolutionary Multiobjective Community Detection Algorithm built on Non-dominated Sorting Genetic Algorithm II (NSGA-II), which overcomes these barriers through topology-aware genetic operators, full parallelization, and bit-level optimizations, achieving theoretical O(GN_p|V|) complexity. We conduct experiments on both synthetic and real-world networks. Results demonstrate strong scalability, with HP-MOCD processing networks of over 1,000,000 nodes while maintaining high quality across varying noise levels. It outperforms other MOEAs by more than 531 times in runtime on synthetic datasets, achieving runtimes as low as 57 seconds for graphs with 40,000 nodes on moderately powered hardware. Across 14 real-world networks, HP-MOCD was the only MOEA capable of processing the six largest datasets within a reasonable time, with results competitive with single-objective approaches. Unlike single-solution methods, HP-MOCD produces a Pareto Front, enabling individual-specific trade-offs and providing decision-makers with a spectrum of high-quality community structures. It introduces the first open-source Python MOEA library compatible with networkx and igraph for large-scale community detection. |
| title | A High-Performance Evolutionary Multiobjective Community Detection Algorithm |
| topic | Social and Information Networks |
| url | https://arxiv.org/abs/2506.01752 |