Evans, Tim Overlapping Communities, Edge Partitions and Line Graphs <p>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.</p> <p>Our basic C++ code, linegraphcreator, is available on figshare.com</p> Complex Networks;community detection;clustering;overlapping communities;Statistics;Numerical Analysis;Condensed Matter Physics;Computational Physics;Theoretical Computer Science;Sociology 2014-09-26
    https://figshare.com/articles/presentation/Overlapping_Communities_Edge_Partitions_and_Line_Graphs/95479
10.6084/m9.figshare.95479.v1