# Dynamic Clustering in Social Networks using Louvain and Infomap Method

arXiv: https://arxiv.org/abs/1603.02413 · HTML: https://mlsanity.com/paper/1603.02413/

## Key facts

- Cited by 9 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 8 Mar 2016.

## Built on by (most cited first, 9 of 9)

- [SINGA-Easy: An Easy-to-Use Framework for MultiModal Analysis](https://mlsanity.com/paper/2108.02572/) (2021)
- [VisualTextRank: Unsupervised Graph-based Content Extraction for Automating Ad Text to Image Search](https://mlsanity.com/paper/2108.02725/) (2021)
- [Text is NOT Enough: Integrating Visual Impressions into Open-domain Dialogue Generation](https://mlsanity.com/paper/2109.05778/) (2021)
- [Discovering Personalized Semantics for Soft Attributes in Recommender Systems using Concept Activation Vectors](https://mlsanity.com/paper/2202.02830/) (2022)
- [Reinforced MOOCs Concept Recommendation in Heterogeneous Information Networks](https://mlsanity.com/paper/2203.11011/) (2022)
- [Explanation-Guided Fairness Testing through Genetic Algorithm](https://mlsanity.com/paper/2205.08335/) (2022)
- [Using Graph Neural Networks for Program Termination](https://mlsanity.com/paper/2207.14648/) (2022)
- [Tribe or Not? Critical Inspection of Group Differences Using TribalGram](https://mlsanity.com/paper/2303.09664/) (2023)
- [Utilizing AI and Social Media Analytics to Discover Adverse Side Effects of GLP-1 Receptor Agonists](https://mlsanity.com/paper/2404.01358/) (2024)

## Abstract (arXiv)

Finding communities or clusters in social networks is a fa- mous topic in social network analysis. Most algorithms are limited to static snapshots, so they cannot handle dynamics within the underlying graph. In this paper we present a modification of the Louvain community detec- tion method to handle changes in the graph without rerunning the full algorithm. Also, we adapted the Louvain greedy approach to optimize the Infomap measure. The main idea is, to recalculate only a small area around the changes. Depending on the graph size and the amount of changes, this yields a massive runtime decrease. As validation data, we provide a graph generator, which produces spe- cific community structures, at given times and also intermediate steps to transform the graph from one to another specific graph. Experiments show that runtime decrease is possible without much loss of quality. These values depend on the reprocessed area inside the graph.