Finding overlapping communities in networks using evolutionary method
arXiv:1302.6738 · doi:10.1016/j.physa.2015.09.031
Abstract
Community structure is a typical property of many real-world networks, and has become a key to understand the dynamics of the networked systems. In these networks most nodes apparently lie in a community while there often exists a few nodes straddling several communities. An ideal algorithm for community detection is preferable which can identify the overlapping communities in such networks. To represent an overlapping division we develop a encoding schema composed of two segments, the first one represents a disjoint partition and the second one represents a extension of the partition that allows of multiple memberships. We give a measure for the informativeness of a node, and present an evolutionary method for detecting the overlapping communities in a network.
References in corpus (13)
- Modularity and community structure in networks
- Uncovering the overlapping community structure of complex networks in nature and society
- Finding community structure in networks using the eigenvectors of matrices
- Resolution limit in community detection
- Comparing community structure identification
- Statistical Mechanics of Community Detection
- Finding statistically significant communities in networks
- Community structure in directed networks
- Modularity and community detection in bipartite networks
- Analysis of the structure of complex networks at different resolution levels
- Size reduction of complex networks preserving modularity
- Surprise maximization reveals the community structure of complex networks
- A New Comparative Definition of Community and Corresponding Identifying Algorithm