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