EntropyWalker, a Fast Algorithm for Small Community Detection in Large Graphs

2015/05/10 by Luis Argerich, Argerich, Luis
Computer Science · Physics and Astronomy · #Complex Network Analysis Techniques #Data Visualization and Analytics #FOS: Computer and information sciences #FOS: Physical sciences #Opinion Dynamics and Social Influence #Physics and Society (physics.soc-ph) #Social and Information Networks (cs.SI)

paper · pdf · doi:10.48550/arxiv.1505.02406

openalex publication_date 2015/05/10 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28

Abstract

This report presents a very simple algorithm for overlaping community-detection in large graphs under constraints such as the minimum and maximum number of members allowed. The algorithm is based on the simulation of random walks and measures the entropy of each random walk to detect the discovery of a community.

Related

• Community Detection Using Slow Mixing Markov Models
• The Computer Science and Physics of Community Detection: Landscapes, Phase Transitions, and Hardness
• An improvement on the Louvain algorithm using random walks
• Computing communities in large networks using random walks (long version)
• Community Detection in Large-Scale Complex Networks via Structural Entropy Game