Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10481918 | Physica A: Statistical Mechanics and its Applications | 2013 | 17 Pages |
Abstract
In this paper, we propose a novel algorithm that is able to detect overlapping and non-overlapping community structures in complex networks. This algorithm uses a number of agents for investigation of the input network. These agents consider different nodes' closeness in their investigations. Various experiments are carried out on both synthetic and real-world networks that prove that the proposed algorithm outperforms most state-of-the-art algorithms of this field both in terms of the accuracy and execution time.
Related Topics
Physical Sciences and Engineering
Mathematics
Mathematical Physics
Authors
Reza Badie, Abolfazl Aleahmad, Masoud Asadpour, Maseud Rahgozar,