2016/01/25 by Pascal Held, Held, Pascal, Rudolf Kruse +1
Computer Science · Physics and Astronomy · #Anomaly Detection Techniques and Applications #FOS: Computer and information sciences #FOS: Physical sciences #Physics and Society (physics.soc-ph) #Social and Information Networks (cs.SI) #Text and Document Classification Technologies #Video Analysis and Summarization #cs.SI #physics.soc-ph
paper · pdf · doi:10.48550/arxiv.1601.06527
Presented as poster at the NetSciX 2016
arxiv created 2016/01/25 · openalex publication_date 2016/01/25 · arxiv updated 2016/01/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Community and cluster detection is a popular field of social network analysis. Most algorithms focus on static graphs or series of snapshots. In this paper we present an algorithm, which detects communities in dynamic graphs. The method is based on shortest paths to high-connected nodes, so called hubs. Due to local message passing we can update the clustering results with low computational power. The presented algorithm is compared with other for some static social networks. The reached modularity is not as high as the Louvain method, but even higher then spectral clustering. For large-scale real-world datasets with given ground truth, we could reconstruct most of the given community structure. The advantage of the algorithm is the good performance in dynamic scenarios.