The label propagation algorithm (LPA) has been proved to be a fast and effective methodfor detecting communities in large complex networks. However, its performance is subjectto the non-stable and trivial solutions of the problem. In this paper, we propose amodified label propagation algorithm LPAf to efficiently detect community structures innetworks. Instead of the majority voting rule of the basic LPA, LPAf updates the label ofa node by considering the compression of a description of random walks on a network. Amulti-step greedy agglomerativ...
