Overlapping Communities, Edge Partitions and Line Graphs
This talk (given at ECCS 2009 at Warwick University) describes Weighted line graphs which provide an alternative, valuable representation of a network's topology. These have important applications in community detection. 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 long-standing problem of the detection of overlapping communities.
Our basic C++ code, linegraphcreator, is available on figshare.com