Information routing is one of the most important problems in large communication networks. In this paper we propose a novel routing strategy in which the optimal paths between all pairs of nodes are chosen according to a cost function that incorporates degrees of nodes in paths. Results on large...

In this paper, we propose a new routing strategy based on the minimum information path, named the optimal routing (OR) strategy, to improve the transportation capacity of scale-free networks. We define the average routing centrality degree of the node to analyze the traffic load on nodes of...

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

In this paper, the adaptive synchronization of neural networks with time-varying delay and distributed delay is discussed. Based on the LaSalle invariant principle of functional differential equations and the adaptive feedback control technique, some sufficient conditions for adaptive...

Most existing research on the vulnerability of power grids based on complex networks ignores the electrical characteristics and the capacity of generators and load. In this paper, the electrical betweenness is defined by considering the maximal demand of load and the capacity of generators in...