Extreme events, a type of collective behavior in complex networked dynamical systems, often can have catastrophic consequences. To develop effective strategies to control extreme events is of fundamental importance and practical interest. Utilizing transportation dynamics on complex networks as a prototypical setting, we find that making the network “mobile” can effectively suppress extreme events. A striking, resonance-like phenomenon is uncovered, where an optimal degree of mobility exists for which the probability of extreme events is minimized. We derive an analytic theory to understand the mechanism of control at a detailed and quantitative level, and validate the theory numerically. Implications of our finding to current areas such as cybersecurity are discussed.

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

Dynamical systems based on the minority game (MG) have been a paradigm for gaining significant insights into a variety of social and biological behaviors. Recently, a grouping phenomenon has been unveiled in MG systems of multiple resources (strategies) in which the strategies spontaneously break into an even number of groups, each exhibiting an identical oscillation pattern in the attendance of game players. Here we report our finding of spontaneous breakup of resources into three groups, each exhibiting period-three oscillations. An analysis is developed to understand the emergence of the striking phenomenon of triple grouping and period-three oscillations. In the presence of random disturbances, the triple-group/period-three state becomes transient, and we obtain explicit formula for the average transient lifetime using two methods of approximation. Our finding indicates that, period-three oscillation, regarded as one of the most fundamental behaviors in smooth nonlinear dynamical systems, can also occur in much more complex, evolutionary-game dynamical systems. Our result also provides a plausible insight for the occurrence of triple grouping observed, for example, in the U.S. housing market.

Understanding the dynamics of human movements is key to issues of significant current interest such as behavioral prediction, recommendation, and control of epidemic spreading. We collect and analyze big data sets of human movements in both cyberspace (through browsing of websites) and physical space (through mobile towers) and find a superlinear scaling relation between the mean frequency of visit〈f〉and its fluctuation σ : σ ∼〈f⟩^β with β ≈ 1.2. The probability distribution of the visiting frequency is found to be a stretched exponential function. We develop a model incorporating two essential ingredients, preferential return and exploration, and show that these are necessary for generating the scaling relation extracted from real data. A striking finding is that human movements in cyberspace and physical space are strongly correlated, indicating a distinctive behavioral identifying characteristic and implying that the behaviors in one space can be used to predict those in the other.

Resource allocation takes place in various types of real-world complex systems such as urban traffic, social services institutions, economical and ecosystems. Mathematically, the dynamical process of resource allocation can be modeled as minority games. Spontaneous evolution of the resource allocation dynamics, however, often leads to a harmful herding behavior accompanied by strong fluctuations in which a large majority of agents crowd temporarily for a few resources, leaving many others unused. Developing effective control methods to suppress and eliminate herding is an important but open problem. Here we develop a pinning control method, that the fluctuations of the system consist of intrinsic and systematic components allows us to design a control scheme with separated control variables. A striking finding is the universal existence of an optimal pinning fraction to minimize the variance of the system, regardless of the pinning patterns and the network topology. We carry out a generally applicable theory to explain the emergence of optimal pinning and to predict the dependence of the optimal pinning fraction on the network topology. Our work represents a general framework to deal with the broader problem of controlling collective dynamics in complex systems with potential applications in social, economical and political systems.

A relatively unexplored issue in cybersecurity science and engineering is whether there exist intrinsic patterns of cyberattacks. Conventional wisdom favors absence of such patterns due to the overwhelming complexity of the modern cyberspace. Surprisingly, through a detailed analysis of an extensive data set that records the time-dependent frequencies of attacks over a relatively wide range of consecutive IP addresses, we successfully uncover intrinsic spatiotemporal patterns underlying cyberattacks, where the term “spatio” refers to the IP address space. In particular, we focus on analyzing macroscopic properties of the attack traffic flows and identify two main patterns with distinct spatiotemporal characteristics: deterministic and stochastic. Strikingly, there are very few sets of major attackers committing almost all the attacks, since their attack “fingerprints” and target selection scheme can be unequivocally identified according to the very limited number of unique spatiotemporal characteristics, each of which only exists on a consecutive IP region and differs significantly from the others. We utilize a number of quantitative measures, including the flux-fluctuation law, the Markov state transition probability matrix, and predictability measures, to characterize the attack patterns in a comprehensive manner. A general finding is that the attack patterns possess high degrees of predictability, potentially paving the way to anticipating and, consequently, mitigating or even preventing large-scale cyberattacks using macroscopic approaches.

Supply-demand processes take place on a large variety of real-world networked systems ranging from power grids and the internet to social networking and urban systems. In a modern infrastructure, supply-demand systems are constantly expanding, leading to constant increase in load requirement for resources and consequently, to problems such as low efficiency, resource scarcity, and partial system failures. Under certain conditions global catastrophe on the scale of the whole system can occur through the dynamical process of cascading failures. We investigate optimization and resilience of time-varying supply-demand systems by constructing network models of such systems, where resources are transported from the supplier sites to users through various links. Here by optimization we mean minimization of the maximum load on links, and system resilience can be characterized using the cascading failure size of users who fail to connect with suppliers.

We consider two representative classes of supply schemes: load driven supply and fix fraction supply. Our findings are: (1) optimized systems are more robust since relatively smaller cascading failures occur when triggered by external perturbation to the links; (2) a large fraction of links can be free of load if resources are directed to transport through the shortest paths; (3) redundant links in the performance of the system can help to reroute the traffic but may undesirably transmit and enlarge the failure size of the system; (4) the patterns of cascading failures depend strongly upon the capacity of links; (5) the specific location of the trigger determines the specific route of cascading failure, but has little effect on the final cascading size; (6) system expansion typically reduces the efficiency; and (7) when the locations of the suppliers are optimized over a long expanding period, fewer suppliers are required. These results hold for heterogeneous networks in general, providing insights into designing optimal and resilient complex supply-demand systems that expand constantly in time.