Overlapping community detection via link partition of asymmetric weighted graph

Link partition clusters edges of a complex network to discover its overlapping communities. Due to Its effectiveness, link partition has attracted much attentions from the network science community. However, since link partition assigns each edge of a network to unique community, it cannot detect the disjoint communities. To overcome this deficiency, this paper proposes a link partition on asymmetric weighted graph (LPAWG) method for detecting overlapping communities. Particularly, LPAWG divides each edge into two parts to distinguish the roles of connected nodes. This strategy biases edges to a specific node and helps assigning each node to its affiliated community. Since LPAWG introduces more edges than those in the original network, it cannot efficiently detect communities from some networks with relative large amount of edges. We therefore aggregate the line graph of LPAWG to shrink its scale. Experimental results of community detection on both synthetic datasets and the realworld networks show the effectiveness of LPAWG comparing with the representative methods.