Finding community structure using the ordered random graph model
arXiv:2210.08989 · doi:10.1103/PhysRevE.108.014303
Abstract
Visualization of the adjacency matrix enables us to capture macroscopic features of a network when the matrix elements are aligned properly. Community structure, a network consisting of several densely connected components, is a particularly important feature, and the structure can be identified through the adjacency matrix when it is close to a block-diagonal form. However, classical ordering algorithms for matrices fail to align matrix elements such that the community structure is visible. In this study, we propose an ordering algorithm based on the maximum-likelihood estimate of the ordered random graph model. We show that the proposed method allows us to more clearly identify community structures than the existing ordering algorithms.
14 pages, 12 figures
References in corpus (10)
- Modularity and community structure in networks
- Maps of random walks on complex networks reveal community structure
- Stochastic blockmodels and community structure in networks
- Community detection in networks: A user guide
- Extracting the hierarchical organization of complex systems
- 20 years of network community detection
- Clique Graphs and Overlapping Communities
- Think Locally, Act Locally: The Detection of Small, Medium-Sized, and Large Communities in Large Networks
- Model selection and hypothesis testing for large-scale network models with overlapping groups
- Consistency between ordering and clustering methods for graphs