Gephi.org | Download Gephi | Blog | Gephi Store | Wiki | Forum | Support | Bugtracker

Look for Gephi Plugins

Popular Keywords

Close Search

Link Communities

Link Communities
12 votes, 4.67 avg. rating (92% score)

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).

Similar Plugins

Social Network Analysis

This plugin allows compute metrics, which can be used in Social Network Analysis. This version contains: Erdös number – idea of “The Small-World Phenomenon”. Can be visualized using Layered Layout Plugin Neighborhood Overlap and Embeddedness – identification of strong and weak ties, local bridges Clustering Coefficient

More Info

Edge Betweenness Metric

Edge Betweenness plugin for Gephi. This plugin allows compute Edge Betweenness metric, which can be used in Social Network Analysis. Edge betweenness of an edge as the number of shortest paths between pairs of nodes that run along it.

More Info

Multimode Networks Transformations

This plugin allows multimode networks projection. For example: you can project your bipartite (2-mode) graph to monopartite (one-mode) graph. The projection/transformation is based on the matrix multiplication approach and allows different types of transformations. Not only bipartite graphs. The limitation is matrix multiplication – large matrix multiplication takes time and memory.

More Info