Identifying a set of influential spreaders in complex networks plays a crucial role in effective information spreading. A simple strategy is to choose top-r ranked nodes as spreaders according to influence ranking method such as PageRank, ClusterRank and k-shell decomposition. Besides, some heuristic methods such as hill-climbing, SPIN, degree discount and independent set based are also proposed. However, these approaches suffer from a possibility that some spreaders are so close together that they overlap sphere of influence or time consuming. In this report, we present a simply yet effectively iterative method named VoteRank to identify a set of decentralized spreaders with the best spreading ability. In this approach, all nodes vote in a spreader in each turn, and the voting ability of neighbors of elected spreader will be decreased in subsequent turn. Experimental results on four real networks show that under Susceptible-Infected-Recovered (SIR) and Susceptible-Infected (SI) models, VoteRank outperforms the traditional benchmark methods on both spreading rate and final affected scale. What’s more, VoteRank has superior computational efficiency.

The dynamics of human mobility characterizes the trajectories that humans follow during their daily activities and is the foundation of processes from epidemic spreading to traffic prediction and information recommendation. In this paper, we investigate a massive data set of human activity, including both online behavior of browsing websites and offline one of visiting towers based mobile terminations. The non-Markovian character observed from both online and offline cases is suggested by the scaling law in the distribution of dwelling time at individual and collective levels, respectively. Furthermore, we argue that the lower entropy and higher predictability in human mobility for both online and offline cases may originate from this non-Markovian character. However, the distributions of individual entropy and predictability show the different degrees of non-Markovian character between online and offline cases. To account for non-Markovian character in human mobility, we apply a protype model with three basic ingredients, namely, preferential return, inertial effect, and exploration to reproduce the dynamic process of online and offline human mobilities. The simulations show that the model has an ability to obtain characters much closer to empirical observations.

Research on human behavior has attracted increasing attention recently because of its scientific significance and potential applications. Some empirical results have indicated that the timing of many human activities follows non-Poisson statistics. We analyze a real-life huge dataset of short message communication with 6326713 users and 37577781 records during the 2006 Chinese New Year. The results show that the number of short message sendings, the interevent time between two consecutive short message sendings and the response time all follow heavy-tailed distribution. We further observe a strongly positive correlation between the activity and the powerlaw exponent of the interevent time distribution. In addition, the short message communication system displays a bursty property yet no memory effects, which is in particular different from some well-studied human-activited systems such as email-sending, library-loaning and file printing.

No abstract