Fast community structure local uncovering by independent vertex-centred process
arXiv:1509.03500
Abstract
This paper addresses the task of community detection and proposes a local approach based on a distributed list building, where each vertex broadcasts basic information that only depends on its degree and that of its neighbours. A decentralised external process then unveils the community structure. The relevance of the proposed method is experimentally shown on both artificial and real data.
2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, Aug 2015, Paris, France. Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
References in corpus (8)
- Fast unfolding of communities in large networks
- Community detection in graphs
- 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
- Resolution limit in community detection
- Community detection in networks: Structural communities versus ground truth
- Deciphering Network Community Structure by Surprise