Skip to content

Clique Percolation Method

Choose a tag to compare

View all tags
@angelosalatino angelosalatino released this 21 May 13:10
· 5 commits to main since this release
v0.1
499ae52
This commit was created on GitHub.com and signed with GitHub’s verified signature. The key has expired.
GPG key ID: 4AEE18F83AFDEB23
Expired
Verified
Learn about vigilant mode.

Clique Percolation Method (CPM) is an algorithm for finding overlapping communities within networks, intruduced by Palla et al. (2005, see references). This implementation in Python, firstly detects communities of size k, then creates a clique graph. Each community will be represented by each connected component in the clique graph.

Assets 2
Loading