A Community Detection Algorithm Based on Markov Random Walks Ants in Complex Network
- 5 Downloads
Complex networks display community structures. Nodes within groups are densely connected but among groups are sparsely connected. In this paper, an algorithm is presented for community detection named Markov Random Walks Ants (MRWA). The algorithm is inspired by Markov random walks model theory, and the probability of ants located in any node within a cluster will be greater than that located outside the cluster. Through the random walks, the network structure is revealed. The algorithm is a stochastic method which uses the information collected during the traverses of the ants in the network. The algorithm is validated on different datasets including computer-generated networks and real-world networks. The outcome shows the algorithm performs moderately quickly when providing an acceptable time complexity and its result appears good in practice.
Key wordscomplex network community detection Markov chain random walk
CLC numberTP 391
Unable to display preview. Download preview PDF.
- SU C, JIA X T, XIE X Z, et al. A new randomwalk based label propagation community detection algorithm [C]//IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology. Singapore: IEEE, 2015: 137–140.Google Scholar
- KUNCHEVA Z, MONTANA G. Community detection in multiplex networks using locally adaptive random walks [C]//IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining. Pairs, France: ACM, 2015: 1308–1315.Google Scholar
- LUSSEAU D. The emergent properties of a dolphin social network [J]. Proceedings of the Royal Society of London. Series B: Biological Sciences, 2003, 270(Sup2): 186–188.Google Scholar