Complementary Strengths: Combining Geometric and Topological Approaches for Community Detection
Jelena Losic
TL;DR
This paper addresses the lack of a universal approach to community detection by proposing a hybrid framework that combines geometric projections (spectral or force-directed embeddings) with Topological Data Analysis via ToMATo. By embedding networks into low-dimensional spaces where density basins correspond to communities, and applying a persistence-based clustering, the method leverages both geometric and topological strengths. Results show the hybrid approach can match or exceed traditional modularity-based methods on modular networks and outperform them on certain real-world networks, depending on the embedding. The work advocates for adaptive, geometry-informed hybrid algorithms that select projection strategies based on network structure to improve robustness, interpretability, and scalability in community detection.
Abstract
The optimal strategy for community detection in complex networks is not universal, but depends critically on the network's underlying structural properties. Although popular graph-theoretic methods, such as Louvain, optimize for modularity, they can overlook nuanced, geometric community structures. Conversely, topological data analysis (TDA) methods such as ToMATo are powerful in identifying density-defined clusters in embedded data but can be sensitive to initial projection. We propose a unified framework that integrates both paradigms to take advantage of their complementary advantages. Our method uses spectral embedding to capture the network's geometric skeleton, creating a landscape where communities manifest as density basins. The ToMATo algorithm then provides a topologically-grounded and parameter-aware method to extract persistent clusters from this landscape. Our comprehensive analysis across synthetic benchmarks shows that this hybrid approach is highly robust: it performs on par with Louvain on modular networks. These results argue for a new class of hybrid algorithms that select strategies based on network geometry, moving beyond one-size-fits-all solutions.
