We study the competition and strategy selections between a class of generalized zero-determinant (ZD) strategies and the classic strategies of always cooperate (AllC), always defect (AllD), tit-for-tat (TFT), and win-stay-lose-shift (WSLS) strategies in an iterated prisoner’s dilemma...

Identifying influential nodes in complex networks has attracted much attention because of its great theoretical significance and wide application. Existing methods consider the edges equally when designing identifying methods for the unweighted networks. In this paper, we propose an edge...

In this paper, we propose a new method to evaluate the importance of nodes in a given network. The proposed method is based on the PageRank algorithm. However, we have made necessary improvements to combine the importance of the node itself and that of its community status. First, we propose an...

Recent years have witnessed a growing recognition on the community detection in networks. Diverse techniques have been devoted to uncovering community structures in complex networks and amongst which are the density-based methods. Density-based avenues are very popular in data clustering field....

In this paper we present weighted Koch networks based on classic Koch networks. A new method is used to determine the average receiving time (ART), whose key step is to write the sum of mean first-passage times (MFPTs) for all nodes to absorption at the trap located at a hub node as a recursive...

The excitation intervention of strategic alliance may change with the changes in the parameters of circumstance (e.g., external alliance tasks). As a result, the stable cooperation between members may suffer a complete unplanned betrayal at last. However, current perspectives on strategic...

In this paper, a framework is given to model the network of networks and to investigate the vulnerability of the network of networks subjected to failures. Because there are several redundant systems in infrastructure systems, the dependent intensity between two networks is introduced and...

This paper investigates robust and fast consensus of multi-agent systems subject to external attacks. The strategy of connecting neighbor set is proposed to recover the connectivity of the resulting interconnected network, to improve the robustness against next external attacks, and to guarantee...

By analyzing the data of top 500 Chinese firms from the year 2002 to 2007, we reveal that their revenues and ranks obey the Zipf’s law with exponent of 1 for each year. This result confirms the universality of firm size character which has been presented in many other empirical works, since...

Recently, cities have become larger and larger, and more and more people are living in large cities. This phenomenon has caused serious traffic congestion which is very detrimental to the development of large cities. In this context, the subway has become the most effective solution for...