title: Discovering communities in complex networks by edge label propagation.
abstract: The discovery of the community structure of real-world networks is still an open problem. Many methods have been proposed to shed light on this problem, and most of these have focused on discovering node community. However, link community is also a powerful framework for discovering overlapping communities. Here we present a novel edge label propagation algorithm (ELPA), which combines the natural advantage of link communities with the efficiency of the label propagation algorithm (LPA). ELPA can discover both link communities and node communities. We evaluated ELPA on both synthetic and real-world networks, and compared it with five state-of-the-art methods. The results demonstrate that ELPA performs competitively with other algorithms.
authors.affiliation: Department of Automation, Shanghai Jiao Tong University, Shanghai 200240, China.
authors.forename: Wei
authors.initials: W
authors.lastname: Liu
authors.affiliation: School of Computer Science, Central China Normal University, Wuhan, Hubei 430079, China.
authors.forename: Xingpeng
authors.initials: X
authors.lastname: Jiang
authors.affiliation: Department of Molecular, Cell and Developmental Biology, University of California, Los Angeles 90055, CA.
authors.forename: Matteo
authors.initials: M
authors.lastname: Pellegrini
authors.affiliation: Department of Automation, Shanghai Jiao Tong University, Shanghai 200240, China.
authors.forename: Xiaofan
authors.initials: X
authors.lastname: Wang