Local community extraction in directed networks
arXiv:1508.02177 · doi:10.1016/j.physa.2016.01.101
Abstract
Network is a simple but powerful representation of real-world complex systems. Network community analysis has become an invaluable tool to explore and reveal the internal organization of nodes. However, only a few methods were directly designed for community-detection in directed networks. In this article, we introduce the concept of local community structure in directed networks and provide a generic criterion to describe a local community with two properties. We further propose a stochastic optimization algorithm to rapidly detect a local community, which allows for uncovering the directional modular characteristics in directed networks. Numerical results show that the proposed method can resolve detailed local communities with directional information and provide more structural characteristics of directed networks than previous methods.
8 pages, 6 figures
References in corpus (11)
- Modularity and community structure in networks
- Maps of random walks on complex networks reveal community structure
- Resolution limit in community detection
- Community structure in directed networks
- Clustering and Community Detection in Directed Networks: A Survey
- Mixture models and exploratory analysis in networks
- Clique Graphs and Overlapping Communities
- Role-based similarity in directed networks
- Cycle flow based module detection in directed recurrence networks
- Scalable Spectral Algorithms for Community Detection in Directed Networks
- A neurodynamic framework for local community extraction in networks