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.

There is a need for indicators of transportation-land use system quality that are understandable to a wide range of stakeholders, and which can provide immediate feedback on the quality of interactively designed scenarios. Location-based accessibility indicators are promising candidates, but indicator values can vary strongly depending on time of day and transfer wait times. Capturing this variation increases complexity, slowing down calculations. We present new methods for rapid yet rigorous computation of accessibility metrics, allowing immediate feedback during early-stage transit planning, while being rigorous enough for final analyses. Our approach is statistical, characterizing the uncertainty and variability in accessibility metrics due to differences in departure time and headway-based scenario specification. The analysis is carried out on a detailed multi-modal network model including both public transportation and streets. Land use data are represented at high resolution. These methods have been implemented as open-source software running on commodity cloud infrastructure. Networks are constructed from standard open data sources, and scenarios are built in a map-based web interface. We conclude with a case study, describing how these methods were applied in a long-term transportation planning process for metropolitan Amsterdam.

Accessibility is increasingly used as a metric when evaluating changes to public transport systems. Transit travel times contain variation depending on when one departs relative to when a transit vehicle arrives, and how well transfers are coordinated given a particular timetable. In addition, there is necessarily uncertainty in the value of the accessibility metric during sketch planning processes, due to scenarios which are underspecified because detailed schedule information is not yet available. This article presents a method to extend the concept of "reliable" accessibility to transit to address the first issue, and create confidence intervals and hypothesis tests to address the second.

Controlling complex networks has become a forefront research area in network science and engineering. Recent efforts have led to theoretical frameworks of controllability to fully control a network through steering a minimum set of driver nodes. However, in realistic situations not every node is accessible or can be externally driven, raising the fundamental issue of control efficacy: if driving signals are applied to an arbitrary subset of nodes, how many other nodes can be controlled? We develop a framework to determine the control efficacy for undirected networks of arbitrary topology. Mathematically, based on non-singular transformation, we prove a theorem to determine rigorously the control efficacy of the network and to identify the nodes that can be controlled for any given driver nodes. Physically, we develop the picture of diffusion that views the control process as a signal diffused from input signals to the set of controllable nodes. The combination of mathematical theory and physical reasoning allows us not only to determine the control efficacy for model complex networks and a large number of empirical networks, but also to uncover phenomena in network control, e.g., hub nodes in general possess lower control centrality than an average node in undirected networks.

A challenging problem in network science is to control complex networks. In existing frameworks of structural or exact controllability, the ability to steer a complex network toward any desired state is measured by the minimum number of required driver nodes. However, if we implement actual control by imposing input signals on the minimum set of driver nodes, an unexpected phenomenon arises: due to computational or experimental error there is a great probability that convergence to the final state cannot be achieved. In fact, the associated control cost can become unbearably large, effectively preventing actual control from being realized physically. The difficulty is particularly severe when the network is deemed controllable with a small number of drivers. Here we develop a physical controllability framework based on the probability of achieving actual control. Using a recently identified fundamental chain structure underlying the control energy, we offer strategies to turn physically uncontrollable networks into physically controllable ones by imposing slightly augmented set of input signals on properly chosen nodes. Our findings indicate that, although full control can be theoretically guaranteed by the prevailing structural controllability theory, it is necessary to balance the number of driver nodes and control cost to achieve physical control.

In spite of the recent interest and advances in linear controllability of complex networks, controlling nonlinear network dynamics remains an outstanding problem. Here we develop an experimentally feasible control framework for nonlinear dynamical networks that exhibit multistability. The control objective is to apply parameter perturbation to drive the system from one attractor to another, assuming that the former is undesired and the latter is desired. To make our framework practically meaningful, we consider restricted parameter perturbation by imposing two constraints: it must be experimentally realizable and applied only temporarily. We introduce the concept of attractor network, which allows us to formulate a quantifiable controllability framework for nonlinear dynamical networks: a network is more controllable if the attractor network is more strongly connected. We test our control framework using examples from various models of experimental gene regulatory networks and demonstrate the beneficial role of noise in facilitating control.

Network reconstruction is a fundamental problem for understanding many complex systems with unknown interaction structures. In many complex systems, there are indirect interactions between two individuals without immediate connection but with common neighbors. Despite recent advances in network reconstruction, we continue to lack an approach for reconstructing complex networks with indirect interactions. Here we introduce a two-step strategy to resolve the reconstruction problem, where in the first step, we recover both direct and indirect interactions by employing the Lasso to solve a sparse signal reconstruction problem, and in the second step, we use matrix transformation and optimization to distinguish between direct and indirect interactions. The network structure corresponding to direct interactions can be fully uncovered. We exploit the public goods game occurring on complex networks as a paradigm for characterizing indirect interactions and test our reconstruction approach. We find that high reconstruction accuracy can be achieved for both homogeneous and heterogeneous networks, and a number of empirical networks in spite of insufficient data measurement contaminated by noise. Although a general framework for reconstructing complex networks with arbitrary types of indirect interactions is yet lacking, our approach opens new routes to separate direct and indirect interactions in a representative complex system.

Our ability to uncover complex network structure and dynamics from data is fundamental to understanding and controlling collective dynamics in complex systems. Despite recent progress in this area, reconstructing networks with stochastic dynamical processes from limited time series remains to be an outstanding problem. Here we develop a framework based on compressed sensing to reconstruct complex networks on which stochastic spreading dynamics take place. We apply the methodology to a large number of model and real networks, finding that a full reconstruction of inhomogeneous interactions can be achieved from small amounts of polarized (binary) data, a virtue of compressed sensing. Further, we demonstrate that a hidden source that triggers the spreading process but is externally inaccessible can be ascertained and located with high confidence in the absence of direct routes of propagation from it. Our approach thus establishes a paradigm for tracing and controlling epidemic invasion and information diffusion in complex networked systems.

Much of the socioeconomic life in the United States occurs in its urban areas. While an urban economy is defined to a large extent by its network of occupational specializations, an examination of this important network is absent from the considerable body of work on the determinants of urban economic performance. Here we develop a structure-based analysis addressing how the network of interdependencies among occupational specializations affects the ease with which urban economies can transform themselves. While most occupational specializations exhibit positive relationships between one another, many exhibit negative ones, and the balance between the two partially explains the productivity of an urban economy. The current set of occupational specializations of an urban economy and its location in the occupation space constrain its future development paths. Important tradeoffs exist between different alternatives for altering an occupational specialization pattern, both at a single occupation and an entire occupational portfolio levels.

Background: Hemorrhagic fever with renal syndrome (HFRS), a rodent-borne infectious disease, is one of the most serious public health threats in China. Increasing our understanding of the spatial and temporal patterns of HFRS infections could guide local prevention and control strategies.

Methodology/Principal Findings: We employed statistical models to analyze HFRS case data together with environmental data from the Dongting Lake district during 2005–2010. Specifically, time-specific ecologic niche models (ENMs) were used to quantify and identify risk factors associated with HFRS transmission as well as forecast seasonal variation in risk across geographic areas. Results showed that the Maximum Entropy model provided the best predictive ability (AUC = 0.755). Time-specific Maximum Entropy models showed that the potential risk areas of HFRS significantly varied across seasons. High-risk areas were mainly found in the southeastern and southwestern areas of the Dongting Lake district. Our findings based on models focused on the spring and winter seasons showed particularly good performance. The potential risk areas were smaller in March, May and August compared with those identified for June, July and October to December. Both normalized difference vegetation index (NDVI) and land use types were found to be the dominant risk factors.

Conclusions/Significance: Our findings indicate that time-specific ENMs provide a useful tool to forecast the spatial and temporal risk of HFRS.