Line Graphs, Link Partitions and Overlapping Communities
arXiv:0903.2181 · doi:10.1103/PhysRevE.80.016105
Abstract
In this paper, we use a partition of the links of a network in order to uncover its community structure. This approach allows for communities to overlap at nodes, so that nodes may be in more than one community. We do this by making a node partition of the line graph of the original network. In this way we show that any algorithm which produces a partition of nodes can be used to produce a partition of links. We discuss the role of the degree heterogeneity and propose a weighted version of the line graph in order to account for this.
9 pages, 7 figures. Version 2 includes minor changes to text and references and some improved figures
References in corpus (6)
- Fast unfolding of communities in large networks
- Uncovering the overlapping community structure of complex networks in nature and society
- Detecting the overlapping and hierarchical community structure of complex networks
- Analysis of the structure of complex networks at different resolution levels
- Extending the definition of modularity to directed graphs with overlapping communities
- Communities, Knowledge Creation, and Information Diffusion