Background
In 2015, the Zika arbovirus (ZIKV) began circulating in the Americas, rapidly expanding its global geographic range in explosive outbreaks. Unusual among mosquito-borne diseases, ZIKV has been shown to also be sexually transmitted, although sustained autochthonous transmission due to sexual transmission alone has not been observed, indicating the reproduction number (R0) for sexual transmission alone is less than 1. Critical to the assessment of outbreak risk, estimation of the potential attack rates, and assessment of control measures, are estimates of the basic reproduction number, R0.
Methods
We estimated the R0 of the 2015 ZIKV outbreak in Barranquilla, Colombia, through an analysis of the exponential rise in clinically identified ZIKV cases (n = 359 to the end of November, 2015).
Findings
The rate of exponential rise in cases was ρ = 0.076 days[superscript −1], with 95% CI [0.066,0.087] days[superscript −1]. We used a vector-borne disease model with additional direct transmission to estimate the R0; assuming the R0 of sexual transmission alone is less than 1, we estimated the total R0 = 3.8 [2.4,5.6], and that the fraction of cases due to sexual transmission was 0.23 [0.01,0.47] with 95% confidence.
Interpretation
This is among the first estimates of R0 for a ZIKV outbreak in the Americas, and also among the first quantifications of the relative impact of sexual transmission.

Antiviral resistance in influenza is rampant and has the possibility of causing major morbidity and mortality. Previous models have identified treatment regimes to minimize total infections and keep resistance low. However, the bulk of these studies have ignored stochasticity and heterogeneous contact structures. Here we develop a network model of influenza transmission with treatment and resistance, and present both standard mean-field approximations as well as simulated dynamics. We find differences in the final epidemic sizes for identical transmission parameters (bistability) leading to different optimal treatment timing depending on the number initially infected. We also find, contrary to previous results, that treatment targeted by number of contacts per individual (node degree) gives rise to more resistance at lower levels of treatment than non-targeted treatment. Finally we highlight important differences between the two methods of analysis (mean-field versus stochastic simulations), and show where traditional mean-field approximations fail. Our results have important implications not only for the timing and distribution of influenza chemotherapy, but also for mathematical epidemiological modeling in general. Antiviral resistance in influenza may carry large consequences for pandemic mitigation efforts, and models ignoring contact heterogeneity and stochasticity may provide misleading policy recommendations.

Community associated methicillin-resistant Staphylococcus aureus (CA-MRSA) has become a major cause of skin and soft tissue infections (SSTIs) in the US. We developed an age-structured compartmental model to study the spread of CA-MRSA at the population level and assess the effect of control intervention strategies. We used Monte-Carlo Markov Chain (MCMC) techniques to parameterize our model using monthly time series data on SSTIs incidence in children (≤19 years) during January 2004 -December 2006 in Maricopa County, Arizona. Our model-based forecast for the period January 2007–December 2008 also provided a good fit to data. We also carried out an uncertainty and sensitivity analysis on the control reproduction number, R_c which we estimated at 1.3 (95% CI [1.2,1.4]) based on the model fit to data. Using our calibrated model, we evaluated the effect of typical intervention strategies namely reducing the contact rate of infected individuals owing to awareness of infection and decolonization strategies targeting symptomatic infected individuals on both and the long-term disease dynamics. We also evaluated the impact of hypothetical decolonization strategies targeting asymptomatic colonized individuals. We found that strategies focused on infected individuals were not capable of achieving disease control when implemented alone or in combination. In contrast, our results suggest that decolonization strategies targeting the pediatric population colonized with CA-MRSA have the potential of achieving disease elimination.

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.

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.

Asteroids provide fundamental clues to the formation and evolution of planetesimals. Collisional models based on the depletion of the primordial main belt of asteroids predict 10–15 craters >400 km should have formed on Ceres, the largest object between Mars and Jupiter, over the last 4.55 Gyr. Likewise, an extrapolation from the asteroid Vesta would require at least 6–7 such basins. However, Ceres’ surface appears devoid of impact craters >∼280 km. Here, we show a significant depletion of cerean craters down to 100–150 km in diameter. The overall scarcity of recognizable large craters is incompatible with collisional models, even in the case of a late implantation of Ceres in the main belt, a possibility raised by the presence of ammoniated phyllosilicates. Our results indicate that a significant population of large craters has been obliterated, implying that long-wavelength topography viscously relaxed or that Ceres experienced protracted widespread resurfacing.

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.