In this paper, we propose a novel measure that integrates both the concept of closed walks and clustering coefficients to replace the edge betweenness in the well-known divisive hierarchical clustering algorithm, the Girvan and Newman method (GN). The edges with the lowest value are removed...

Divisive algorithms are of great importance for community detection in complex networks. One algorithm proposed by Girvan and Newman (GN) based on an edge centrality named betweenness, is a typical representative of this field. Here we studied three edge centralities based on network topology,...

Influence maximization problem is about finding a small set of nodes from the social network as seed set so as to maximize the range of information diffusion. In this paper, the theory of coritivity and method of finding core nodes in networks are introduced to deal with this problem. From the...