This Gephi plug-in implements the Link Communities algorithm proposed in the paper below.
Yong-Yeol Ahn, James P. Bagrow & Sune Lehmann, Link communities reveal multiscale complexity in networks, Nature 466, 761–764 (05 August 2010) Paper
The algorithm purpose is to reveal communities in undirected and unweigthed networks. It is an agglomerative method (like hierarchical clustering) that compares two links and, if similarity value is below a fixed threshold, puts those links into the same community. This method maintains communities overlap, because a node can belong to multiple links and so to different communities.
Once the metric is computed, users should go to Partition → Edges → select Community. For a best visualization users can apply any visualization layout that Gephi provides, such as Force Atlas 2.
This plugin has been developed by Danilo Domenino and Massimiliano Vella, under the supervision of Prof. Giancarlo Ruffo (for more information on related activities, see: http://arcs.di.unito.it).