Some overlapping community detection algorithms (Until 2016). by Yulin Che (https://github.com/CheYulin) for the PhD qualification exam (survey on community detection algorithms)

A NetworkX implementation of "Ego-splitting Framework: from Non-Overlapping to Overlapping Clusters" (KDD 2017).

TILES: an algorithm for community discovery in dynamic social networks

Python implementation of Newman's spectral methods to maximize modularity.

DEMON: a local-first discovery method for overlapping communities.

Eva: Community Discovery for Labeled Graphs (networkx implementation)

A python script for detecting communities in graphs using the clique percolation method.

A Python implementation of improved Label Propagation Algorithm.

Label propagation algorithm for community detection based on node importance and label influence

Code necessary to reproduce the experimentation presented in "A Multi-Objective Genetic Algorithm for Detecting Dynamic Communities using a Local Search driven Immigrant’s Scheme"

Repository to reproduce "Cascade-based Echo Chamber Detection" accepted at CIKM2022

DAOC (Deterministic and Agglomerative Overlapping Clustering algorithm): Stable Clustering of Large Networks

APAL: Adjacency Propagation Algorithm for overlapping community detection

CoEuS: Community Detection via Seed-set Expansion on Graph Streams

社区发现

Super.Complex is a supervised machine learning algorithm for community detection in networks. It learns information from known communities and uses this information to find new communities on the network.

Exhaustive search for the best Minimally Complex spin Model: "community detection" in binary data.

A summary of the work done for the June 2021 FOSSEE Research Internship in R.

ComSim : community detection algorithm using cycle and node's similarity

[TKDD'23] Demo code of the paper entitled "Towards a Better Trade-Off between Quality and Efficiency of Community Detection: An Inductive Embedding Method across Graphs", which has been accepted by ACM TKDD