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...

How to measure the similarity between nodes is of great importance for fuzzy clustering when we use the approach to uncover communities in complex networks. In this paper, we first measure the similarity between nodes in a network based on edge centralities and model the network as a fuzzy...

Link weights have the equally important position as links in complex networks, and they are closely associated with each other for the emergence of communities. How to assign link weights to make a clear distinction between internal links of communities and external links connecting communities...

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...