Community detection via network node vector label propagation

The discovery and analysis of community structure in complex networks is a hot topic in recent years. A community detection method called NVP is proposed based on the node vector label propagation rate of network nodes. The algorithm determines the centers by looking for NGC nodes, use the concept that the inner product of the node vector in the approximate modularity is greater than 0 to divide the initial community, and then divides the final community according to the relevant content of the label propagation rate. Experimental results show that the algorithm can effectively identify the community structure of various real-world networks and computer-generated networks. In addition, this algorithm can also obtain higher NMI values than DPC, FG, LE and DCN algorithms. • Determine the central of the network by the NGC node of the every node in the network. • Define the node vector label rate of network based on the modularity. • This algorithm works well for different networks (real-world networks and computer generated network).