Evolutionary dynamical models for cyclic competitions of three species (e.g., rock, paper, and scissors, or RPS) provide a paradigm, at the microscopic level of individual interactions, to address many issues in coexistence and biodiversity. Real ecosystems often involve competitions among more than three species. By extending the RPS game model to five (rock-paper-scissors-lizard-Spock, or RPSLS) mobile species, we uncover a fundamental type of mesoscopic interactions among subgroups of species. In particular, competitions at the microscopic level lead to the emergence of various local groups in different regions of the space, each involving three species. It is the interactions among the groups that fundamentally determine how many species can coexist. In fact, as the mobility is increased from zero, two transitions can occur: one from a five- to a three-species coexistence state and another from the latter to a uniform, single-species state. We develop a mean-field theory to show that, in order to understand the first transition, group interactions at the mesoscopic scale must be taken into account. Our findings suggest, more broadly, the importance of mesoscopic interactions in coexistence of great many species.

We develop a general framework to analyze the controllability of multiplex networks using multiple-relation networks and multiple-layer networks with interlayer couplings as two classes of prototypical systems. In the former, networks associated with different physical variables share the same set of nodes and in the latter, diffusion processes take place. We find that, for a multiple-relation network, a layer exists that dominantly determines the controllability of the whole network and, for a multiple-layer network, a small fraction of the interconnections can enhance the controllability remarkably. Our theory is generally applicable to other types of multiplex networks as well, leading to significant insights into the control of complex network systems with diverse structures and interacting patterns.

Online social networks have become increasingly ubiquitous and understanding their structural, dynamical, and scaling properties not only is of fundamental interest but also has a broad range of applications. Such networks can be extremely dynamic, generated almost instantaneously by, for example, breaking-news items. We investigate a common class of online social networks, the user-user retweeting networks, by analyzing the empirical data collected from Sina Weibo (a massive twitter-like microblogging social network in China) with respect to the topic of the 2011 Japan earthquake. We uncover a number of algebraic scaling relations governing the growth and structure of the network and develop a probabilistic model that captures the basic dynamical features of the system. The model is capable of reproducing all the empirical results. Our analysis not only reveals the basic mechanisms underlying the dynamics of the retweeting networks, but also provides general insights into the control of information spreading on such networks.

A fundamental result in the evolutionary-game paradigm of cyclic competition in spatially extended ecological systems, as represented by the classic Reichenbach-Mobilia-Frey (RMF) model, is that high mobility tends to hamper or even exclude species coexistence. This result was obtained under the hypothesis that individuals move randomly without taking into account the suitability of their local environment. We incorporate local habitat suitability into the RMF model and investigate its effect on coexistence. In particular, we hypothesize the use of “basic instinct” of an individual to determine its movement at any time step. That is, an individual is more likely to move when the local habitat becomes hostile and is no longer favorable for survival and growth. We show that, when such local habitat suitability is taken into account, robust coexistence can emerge even in the high-mobility regime where extinction is certain in the RMF model. A surprising finding is that coexistence is accompanied by the occurrence of substantial empty space in the system. Reexamination of the RMF model confirms the necessity and the important role of empty space in coexistence. Our study implies that adaptation/movements according to local habitat suitability are a fundamental factor to promote species coexistence and, consequently, biodiversity.

How effective are governmental incentives to achieve widespread vaccination coverage so as to prevent epidemic outbreak? The answer largely depends on the complex interplay among the type of incentive, individual behavioral responses, and the intrinsic epidemic dynamics. By incorporating evolutionary games into epidemic dynamics, we investigate the effects of two types of incentives strategies: partial-subsidy policy in which certain fraction of the cost of vaccination is offset, and free-subsidy policy in which donees are randomly selected and vaccinated at no cost. Through mean-field analysis and computations, we find that, under the partial-subsidy policy, the vaccination coverage depends monotonically on the sensitivity of individuals to payoff difference, but the dependence is non-monotonous for the free-subsidy policy. Due to the role models of the donees for relatively irrational individuals and the unchanged strategies of the donees for rational individuals, the free-subsidy policy can in general lead to higher vaccination coverage. Our findings indicate that any disease-control policy should be exercised with extreme care: its success depends on the complex interplay among the intrinsic mathematical rules of epidemic spreading, governmental policies, and behavioral responses of individuals.

The relation between flux and fluctuation is fundamental to complex physical systems that support and transport flows. A recently obtained law predicts monotonous enhancement of fluctuation as the average flux is increased, which in principle is valid but only for large systems. For realistic complex systems of small sizes, this law breaks down when both the average flux and fluctuation become large. Here we demonstrate the failure of this law in small systems using real data and model complex networked systems, derive analytically a modified flux-fluctuation law, and validate it through computations of a large number of complex networked systems. Our law is more general in that its predictions agree with numerics and it reduces naturally to the previous law in the limit of large system size, leading to new insights into the flow dynamics in small-size complex systems with significant implications for the statistical and scaling behaviors of small systems, a topic of great recent interest.

Evolutionary games model a common type of interactions in a variety of complex, networked, natural systems and social systems. Given such a system, uncovering the interacting structure of the underlying network is key to understanding its collective dynamics. Based on compressive sensing, we develop an efficient approach to reconstructing complex networks under game-based interactions from small amounts of data. The method is validated by using a variety of model networks and by conducting an actual experiment to reconstruct a social network. While most existing methods in this area assume oscillator networks that generate continuous-time data, our work successfully demonstrates that the extremely challenging problem of reverse engineering of complex networks can also be addressed even when the underlying dynamical processes are governed by realistic, evolutionary-game type of interactions in discrete time.

Locating sources of diffusion and spreading from minimum data is a significant problem in network science with great applied values to the society. However, a general theoretical framework dealing with optimal source localization is lacking. Combining the controllability theory for complex networks and compressive sensing, we develop a framework with high efficiency and robustness for optimal source localization in arbitrary weighted networks with arbitrary distribution of sources. We offer a minimum output analysis to quantify the source locatability through a minimal number of messenger nodes that produce sufficient measurement for fully locating the sources. When the minimum messenger nodes are discerned, the problem of optimal source localization becomes one of sparse signal reconstruction, which can be solved using compressive sensing. Application of our framework to model and empirical networks demonstrates that sources in homogeneous and denser networks are more readily to be located. A surprising finding is that, for a connected undirected network with random link weights and weak noise, a single messenger node is sufficient for locating any number of sources. The framework deepens our understanding of the network source localization problem and offers efficient tools with broad applications.

Evolutionary games of cyclic competitions have been extensively studied to gain insights into one of the most fundamental phenomena in nature: biodiversity that seems to be excluded by the principle of natural selection. The Rock-Paper-Scissors (RPS) game of three species and its extensions [e.g., the Rock-Paper-Scissors-Lizard-Spock (RPSLS) game] are paradigmatic models in this field. In all previous studies, the intrinsic symmetry associated with cyclic competitions imposes a limitation on the resulting coexistence states, leading to only selective types of such states. We investigate the effect of nonuniform intraspecific competitions on coexistence and find that a wider spectrum of coexistence states can emerge and persist. This surprising finding is substantiated using three classes of cyclic game models through stability analysis, Monte Carlo simulations and continuous spatiotemporal dynamical evolution from partial differential equations. Our finding indicates that intraspecific competitions or alternative symmetry-breaking mechanisms can promote biodiversity to a broader extent than previously thought.

Dynamical processes occurring on the edges in complex networks are relevant to a variety of real-world situations. Despite recent advances, a framework for edge controllability is still required for complex networks of arbitrary structure and interaction strength. Generalizing a previously introduced class of processes for edge dynamics, the switchboard dynamics, and exploit- ing the exact controllability theory, we develop a universal framework in which the controllability of any node is exclusively determined by its local weighted structure. This framework enables us to identify a unique set of critical nodes for control, to derive analytic formulas and articulate efficient algorithms to determine the exact upper and lower controllability bounds, and to evaluate strongly structural controllability of any given network. Applying our framework to a large number of model and real-world networks, we find that the interaction strength plays a more significant role in edge controllability than the network structure does, due to a vast range between the bounds determined mainly by the interaction strength. Moreover, transcriptional regulatory networks and electronic circuits are much more strongly structurally controllable (SSC) than other types of real-world networks, directed networks are more SSC than undirected networks, and sparse networks are typically more SSC than dense networks.