An improved label propagation algorithm using average node energy in complex networks

Detecting overlapping community structure can give a significant insight into structural and functional properties in complex networks. In this Letter, we propose an improved label propagation algorithm (LPA) to uncover overlapping community structure. After mapping nodes into random variables, the algorithm calculates variance of each node and the proposed average node energy. The nodes whose variances are less than a tunable threshold are regarded as bridge nodes and meanwhile changing the given threshold can uncover some latent bridge node. Simulation results in real-world and artificial networks show that the improved algorithm is efficient in revealing overlapping community structures.

[1]  Steve Gregory,et al.  Finding overlapping communities in networks by label propagation , 2009, ArXiv.

[2]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  M. Newman,et al.  Finding community structure in very large networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  M. Fiedler Algebraic connectivity of graphs , 1973 .

[5]  Rubén J. Sánchez-García,et al.  Hierarchical Spectral Clustering of Power Grids , 2014, IEEE Transactions on Power Systems.

[6]  Andrea Lancichinetti,et al.  Detecting the overlapping and hierarchical community structure in complex networks , 2008, 0802.1218.

[7]  T. Vicsek,et al.  Uncovering the overlapping community structure of complex networks in nature and society , 2005, Nature.

[8]  H. Stanley,et al.  Robustness of network of networks under targeted attack. , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Qingfu Zhang,et al.  Community detection in networks by using multiobjective evolutionary algorithm with decomposition , 2012 .

[11]  Réka Albert,et al.  Near linear time algorithm to detect community structures in large-scale networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  Santo Fortunato,et al.  Finding Statistically Significant Communities in Networks , 2010, PloS one.

[13]  Jianxi Gao,et al.  Collective Motion in a Network of Self-Propelled Agent Systems , 2015, PloS one.

[14]  Albert-László Barabási,et al.  Universal resilience patterns in complex networks , 2016, Nature.

[15]  P. Latouche,et al.  Overlapping stochastic block models with application to the French political blogosphere , 2009, 0910.2098.

[16]  F. Radicchi,et al.  Benchmark graphs for testing community detection algorithms. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[17]  Zheng Xie,et al.  Community Detection by Neighborhood Similarity , 2012 .