Iterative embedding and reweighting of complex networks reveals community structure
arXiv:2402.10813 · doi:10.1038/s41598-024-68152-w
Abstract
Graph embeddings learn the structure of networks and represent it in low-dimensional vector spaces. Community structure is one of the features that are recognized and reproduced by embeddings. We show that an iterative procedure, in which a graph is repeatedly embedded and its links are reweighted based on the geometric proximity between the nodes, reinforces intra-community links and weakens inter-community links, making the clusters of the initial network more visible and more easily detectable. The geometric separation between the communities can become so strong that even a very simple parsing of the links may recover the communities as isolated components with surprisingly high precision. Furthermore, when used as a pre-processing step, our embedding and reweighting procedure can improve the performance of traditional community detection algorithms.
arXiv comment41 pages, 20 figures
References in corpus (24)
- Fast unfolding of communities in large networks
- Community structure in social and biological networks
- Finding and evaluating community structure in networks
- Community detection in graphs
- DeepWalk: Online Learning of Social Representations
- Near linear time algorithm to detect community structures in large-scale networks
- Benchmark graphs for testing community detection algorithms
- Resolution limit in community detection
- Link Prediction in Complex Networks: A Survey
- Analysis of weighted networks
- Community detection in networks: A user guide
- Hyperbolic Geometry of Complex Networks
- High-resolution measurements of face-to-face contact patterns in a primary school
- Random walks and diffusion on networks
- Accelerated Hierarchical Density Clustering
- Multilevel compression of random walks on networks reveals hierarchical organization in large integrated systems
- Node Classification in Social Networks
- Machine learning meets network science: dimensionality reduction for fast and efficient embedding of networks in the hyperbolic space
- 20 years of network community detection
- Resilience of networks with community structure behaves as if under an external field
- Element-centric clustering comparison unifies overlaps and hierarchy
- Characterizing the analogy between hyperbolic embedding and community structure of complex networks
- Community detection in networks using graph embeddings
- Model-independent methods for embedding directed networks into Euclidean and hyperbolic spaces