Published in
American Physical Society, Physical review E: Statistical, nonlinear, and soft matter physics, 1(80), 2009
DOI: 10.1103/physreve.80.016105
Links
- ORCID
- American Physical Society
- [arxiv.org] | PDF
- [www.researchgate.net] | PDF
- [arxiv.org] | PDF
- [spiral.imperial.ac.uk] | PDF
Tools
Line Graphs, Link Partitions and Overlapping Communities
Full text: Download
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. ; Comment: 9 pages, 7 figures. Version 2 includes minor changes to text and references and some improved figures