Transportation dynamics on networks of mobile agents

Nonmonotonic enhancement of diversity-induced resonance in systems of mobile oscillators

Diversity is omnipresent in natural and synthetic extended systems, the phenomenon of diversity-induced resonance (DIR), wherein a moderate degree of the diversity can provoke an optimal collective response, provides researchers a brand-new strategy to amplify and utilize the weak signal. As yet the relevant advances focus mostly on the ideal situations where the interactions among elements are uncorrelated with the physical proximity of agents. Such a consideration overlooks interactions mediated by the motion of agents in space. Here, we investigate the signal response of an ensemble of spatial mobile heterogeneous bistable oscillators with two canonical interacting modes: dynamic and preset. The oscillators are considered as mass points and perform random walks in a two-dimensional square plane. Under the dynamic scheme, the oscillators can only interact with other oscillators within a fixed vision radius. For the preset circumstance, the interaction among oscillators occurs only when all of them are in a predefined region at the same moment. We find that the DIR can be obtained in both situations. Additionally, the strength of resonance nonmonotonically rises with respect to the increase of moving speed, and the optimal resonance is acquired by an intermediate magnitude of speed. Finally, we propose reduced equations to guarantee the occurrence of such mobility-optimized DIR on the basis of the fast switching approximation theory and also examine the robustness of such phenomenon through the excitable FitzHugh-Nagumo model and a different spatial motion mechanism. Our results reveal for the first time that the DIR can be optimized by the spatial mobility and thus has promising potential application in the communication of mobile agents.

Graph Metrics for Network Robustness—A Survey

Research on the robustness of networks, and in particular the Internet, has gained critical importance in recent decades because more and more individuals, societies and firms rely on this global network infrastructure for communication, knowledge transfer, business processes and e-commerce. In particular, modeling the structure of the Internet has inspired several novel graph metrics for assessing important topological robustness features of large complex networks. This survey provides a comparative overview of these metrics, presents their strengths and limitations for analyzing the robustness of the Internet topology, and outlines a conceptual tool set in order to facilitate their future adoption by Internet research and practice but also other areas of network science.

Understanding the Propagation and Control Strategies of Congestion in Urban Rail Transit Based on Epidemiological Dynamics Model

With the construction of the urban rail transit (URT) network, the explosion of passenger volume is more rapid than the increased capacity of the newly built infrastructure, which results in serious passenger flow congestion (PLC). Understanding the propagation process of PLC is the key to formulate sustainable policies for reducing congestion and optimizing management. This study proposes a susceptible-infected-recovered (SIR) model based on the theories of epidemiological dynamics and complex network to analyze the PLC propagation. We simulate the PLC propagation under various situations, and analyze the sensitivity of PLC propagation to model parameters. Finally, the control strategies of restricting PLC propagation are introduced from two aspects, namely, supply control and demand control. The results indicate that both of the two control strategies contribute to relieving congestion pressure. The propagating scope of PLC is more sensitive when taking mild supply control, whereas, the demand control strategy shows some advantages in flexibly implementing and dealing with serious congestion. These results are of important guidance for URT agencies to understand the mechanism of PLC propagation and formulate appropriate congestion control strategies.

Traffic-driven epidemic spreading in correlated networks

In spite of the extensive previous efforts on traffic dynamics and epidemic spreading in complex networks, the problem of traffic-driven epidemic spreading on correlated networks has not been addressed. Interestingly, we find that the epidemic threshold, a fundamental quantity underlying the spreading dynamics, exhibits a nonmonotonic behavior in that it can be minimized for some critical value of the assortativity coefficient, a parameter characterizing the network correlation. To understand this phenomenon, we use the degree-based mean-field theory to calculate the traffic-driven epidemic threshold for correlated networks. The theory predicts that the threshold is inversely proportional to the packet-generation rate and the largest eigenvalue of the betweenness matrix. We obtain consistency between theory and numerics. Our results may provide insights into the important problem of controlling and/or harnessing real-world epidemic spreading dynamics driven by traffic flows.

Controlling extreme events on complex networks

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.

Optimal transport exponent in spatially embedded networks

The imposition of a cost constraint for constructing the optimal navigation structure surely represents a crucial ingredient in the design and development of any realistic navigation network. Previous works have focused on optimal transport in small-world networks built from two-dimensional lattices by adding long-range connections with Manhattan length r(ij) taken from the distribution P(ij)~r(ij)(-α), where α is a variable exponent. It has been shown that, by introducing a cost constraint on the total length of the additional links, regardless of the strategy used by the traveler (independent of whether it is based on local or global knowledge of the network structure), the best transportation condition is obtained with an exponent α=d+1, where d is the dimension of the underlying lattice. Here we present further support, through a high-performance real-time algorithm, on the validity of this conjecture in three-dimensional regular as well as in two-dimensional critical percolation clusters. Our results clearly indicate that cost constraint in the navigation problem provides a proper theoretical framework to justify the evolving topologies of real complex network structures, as recently demonstrated for the networks of the US airports and the human brain activity.

The architecture of dynamic reservoir in the echo state network

Echo state network (ESN) has recently attracted increasing interests because of its superior capability in modeling nonlinear dynamic systems. In the conventional echo state network model, its dynamic reservoir (DR) has a random and sparse topology, which is far from the real biological neural networks from both structural and functional perspectives. We hereby propose three novel types of echo state networks with new dynamic reservoir topologies based on complex network theory, i.e., with a small-world topology, a scale-free topology, and a mixture of small-world and scale-free topologies, respectively. We then analyze the relationship between the dynamic reservoir structure and its prediction capability. We utilize two commonly used time series to evaluate the prediction performance of the three proposed echo state networks and compare them to the conventional model. We also use independent and identically distributed time series to analyze the short-term memory and prediction precision of these echo state networks. Furthermore, we study the ratio of scale-free topology and the small-world topology in the mixed-topology network, and examine its influence on the performance of the echo state networks. Our simulation results show that the proposed echo state network models have better prediction capabilities, a wider spectral radius, but retain almost the same short-term memory capacity as compared to the conventional echo state network model. We also find that the smaller the ratio of the scale-free topology over the small-world topology, the better the memory capacities.

Control of epidemic spreading on complex networks by local traffic dynamics

Despite extensive work on traffic dynamics and epidemic spreading on complex networks, the interplay between these two types of dynamical processes has not received adequate attention. We study the effect of local-routing-based traffic dynamics on epidemic spreading. For the case of unbounded node-delivery capacity, where the traffic is free of congestion, we obtain analytic and numerical results indicating that the epidemic threshold can be maximized by an optimal routing protocol. This means that epidemic spreading can be effectively controlled by local traffic dynamics. For the case of bounded delivery capacity, numerical results and qualitative arguments suggest that traffic congestion can suppress epidemic spreading. Our results provide quantitative insight into the nontrivial role of traffic dynamics associated with a local-routing scheme in the epidemic spreading.