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

Lineage

This plugin identifies the ancestors and descendants of a node (identified by the user) in a directed graph (not suitable for undirected graphs). Usage: After installing the plugin, the Lineage option can be found in the statistics menu. The user is asked to submit a node (use the Id, not the Label!) and the plugin [...]

More Info

Weighted Cluster Coefficient

This plugin allows to calculate the Weighted Cluster Coefficient for every node and the average value. The weighted clustering capture more precisely the effective level of cohesiveness and affinity due to the interaction strength. Reference: A. Barrat and M. Barthelemy and R. Pastor-Satorras and A. Vespignani (2004). The architecture of complex weighted networks. Proceedings of [...]

More Info

Weakly connected components using disjoint set

This is a copy of Gephi internal Connected Components statistics module, only using much faster algorithm to obtain weakly connected components. It was redirected here from a pull request (https://github.com/gephi/gephi/pull/747) due to lack of time for proper testing that would be required to integrate it into the main program.

More Info