In this paper, we propose a weighted modularity QW based on the similarity of weights on edges and a threshold coefficient ζ to evaluate the equivalence of edge weights. Simulations on benchmark networks and real networks show that optimization on the modularity enable us to obtain groups of...

In this paper, we focus on the search ability of Brownian particles with an adaptive mechanism. In the adaptive mechanism, nodes are allowed to be able to change their own accepting probability according to their congestion states. Two searching-traffic models, the static one in which nodes have...

Community detection is a topic of considerable recent interest within complex networks, but most methods proposed so far are divisive and agglomerative methods which delete only one edge each time to split the network, or agglomerating only one node each time until no individual node remains....