Fluid Communities: A Competitive, Scalable and Diverse Community Detection Algorithm
arXiv:1703.09307
Abstract
We introduce a community detection algorithm (Fluid Communities) based on the idea of fluids interacting in an environment, expanding and contracting as a result of that interaction. Fluid Communities is based on the propagation methodology, which represents the state-of-the-art in terms of computational cost and scalability. While being highly efficient, Fluid Communities is able to find communities in synthetic graphs with an accuracy close to the current best alternatives. Additionally, Fluid Communities is the first propagation-based algorithm capable of identifying a variable number of communities in network. To illustrate the relevance of the algorithm, we evaluate the diversity of the communities found by Fluid Communities, and find them to be significantly different from the ones found by alternative methods.
Accepted at the 6th International Conference on Complex Networks and Their Applications
References in corpus (12)
- Fast unfolding of communities in large networks
- Community detection in graphs
- Finding community structure in networks using the eigenvectors of matrices
- Maps of random walks on complex networks reveal community structure
- Near linear time algorithm to detect community structures in large-scale networks
- Benchmark graphs for testing community detection algorithms
- Community detection algorithms: a comparative analysis
- Statistical Mechanics of Community Detection
- The map equation
- An information-theoretic framework for resolving community structure in complex networks
- Towards real-time community detection in large networks
- Unfolding communities in large complex networks: Combining defensive and offensive label propagation for core extraction