An efficient community detection method based on rank centrality

► This work improves the performance of K-means algorithm in community detection. ► The proposed method is faster than another improved algorithm K-means++. ► This algorithm can be used in directed and weighted networks. ► The proposed method can be extended to detect overlapping communities in the networks. ► Compared with other state-of-the-art algorithms, our method is more robust.