Skip to content

Clique Percolation Method (CPM) is a gephi plugin for finding overlapping communities.

Notifications You must be signed in to change notification settings

mirsamantajbakhsh/CliquePercolationMethod

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

13 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Clique Percolation Method

The Clique Percolation Method (CPM) is a Gephi plugin designed for finding overlapping communities in networks. This method detects communities of size k and constructs a clique graph based on cliques of the same size. The plugin transforms the original graph into a clique graph with k nodes.

Algorithm

The algorithm is straightforward:

  1. Find all cliques of size k in the graph.
  2. Create a new graph where nodes represent cliques of size k.
  3. Add edges between nodes (cliques) that share k-1 common nodes.
  4. Each connected component in this graph represents a community.

History

I developed this plugin during my PhD studies at Urmia University in the field of IT. While working on community detection, I realized that there was no existing Gephi plugin to visualize overlapping communities. Consequently, I created this plugin for Gephi.

Initially, the plugin was compatible with Gephi version 0.8.2. However, my student, Ebrahim Shami, updated it for Gephi 10.0 as part of the Complex Networks course at Urmia University.

$ whoami
mirsamantajbakhsh

I currently serve as an Assistant Professor in Computer Engineering at Urmia University. My research interests include Social Network Analysis, Big Data Mining, NLP, and, outside academia, playing the guitar, enjoying nature, and exploring Android development. You can find more about me on my website.

Sample Run

I tested this plugin using the "Les Misérables" sample graph in Gephi.

Output Graph

The HTML report:

Clique Detection started. Nodes with <b>2</b> edges will not be included.

Found Cliques of size 3.
Now creating a new graph...
Clearing the old graph... [✔]
Creating new nodes... [✔]
Detecting and creating edges... [✔]
Redrawing the new graph... [✔]
Done!

Reference:
Palla, Gergely, Imre Derényi, Illés Farkas, and Tamás Vicsek. "Uncovering the overlapping community structure of complex networks in nature and society." Nature 435, no. 7043 (2005): 814-818

And here is the output graph: Les Misérables Graph

Zoomed view: Zoomed Graph

Data records: Data Records

Download

You can find the latest version of the plugin on the RELEASE page.

Reference

Palla, Gergely, Imre Derényi, Illés Farkas, and Tamás Vicsek. "Uncovering the overlapping community structure of complex networks in nature and society." Nature 435, no. 7043 (2005): 814-818. : Gephi Plugins Repository : Gephi Plugin Development Guidelines : nbm-maven-plugin Documentation : Gephi : Urmia University

About

Clique Percolation Method (CPM) is a gephi plugin for finding overlapping communities.

Resources

Stars

Watchers

Forks

Packages

No packages published

Languages