Line graphs of weighted networks for overlapping communities
Abstract
In this paper, we develop the idea to partition the edges of a weighted graph in order to uncover overlapping communities of its nodes. Our approach is based on the construction of different types of weighted line graphs, i.e. graphs whose nodes are the links of the original graph, that encapsulate differently the relations between the edges. Weighted line graphs are argued to provide an alternative, valuable representation of the system’s topology, and are shown to have important applications in community detection, as the usual node partition of a line graph naturally leads to an edge partition of the original graph. This identification allows us to use traditional partitioning methods in order to address the longstanding problem of the detection of overlapping communities. We apply it to the analysis of different social and geographical networks.
 Publication:

European Physical Journal B
 Pub Date:
 September 2010
 DOI:
 10.1140/epjb/e2010002618
 arXiv:
 arXiv:0912.4389
 Bibcode:
 2010EPJB...77..265E
 Keywords:

 Physics  Data Analysis;
 Statistics and Probability;
 Computer Science  Data Structures and Algorithms;
 Physics  Physics and Society
 EPrint:
 8 Pages. New title and text revisions to emphasise differences from earlier papers