ASU Scholarship Showcase

The ongoing Zika virus (ZIKV) epidemic in the Americas poses a major global public health emergency. While ZIKV is transmitted from human to human by bites of Aedes mosquitoes, recent evidence indicates that ZIKV can also be transmitted via sexual contact with cases of sexually transmitted ZIKV reported in Argentina, Canada, Chile, France, Italy, New Zealand, Peru, Portugal, and the USA. Yet, the role of sexual transmission on the spread and control of ZIKV infection is not well-understood. We introduce a mathematical model to investigate the impact of mosquito-borne and sexual transmission on the spread and control of ZIKV and calibrate the model to ZIKV epidemic data from Brazil, Colombia, and El Salvador. Parameter estimates yielded a basic reproduction number R_0 = 2.055 (95% CI: 0.523–6.300), in which the percentage contribution of sexual transmission is 3.044% (95% CI: 0.123–45.73). Our sensitivity analyses indicate that R_0 is most sensitive to the biting rate and mortality rate of mosquitoes while sexual transmission increases the risk of infection and epidemic size and prolongs the outbreak. Prevention and control efforts against ZIKV should target both the mosquito-borne and sexual transmission routes.

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.

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.

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.

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.

Gompertz’s empirical equation remains the most popular one in describing cancer cell population growth in a wide spectrum of bio-medical situations due to its good fit to data and simplicity. Many efforts were documented in the literature aimed at understanding the mechanisms that may support Gompertz’s elegant model equation. One of the most convincing efforts was carried out by Gyllenberg and Webb. They divide the cancer cell population into the proliferative cells and the quiescent cells. In their two dimensional model, the dead cells are assumed to be removed from the tumor instantly. In this paper, we modify their model by keeping track of the dead cells remaining in the tumor. We perform mathematical and computational studies on this three dimensional model and compare the model dynamics to that of the model of Gyllenberg and Webb. Our mathematical findings suggest that if an avascular tumor grows according to our three-compartment model, then as the death rate of quiescent cells decreases to zero, the percentage of proliferative cells also approaches to zero. Moreover, a slow dying quiescent population will increase the size of the tumor. On the other hand, while the tumor size does not depend on the dead cell removal rate, its early and intermediate growth stages are very sensitive to it.

Background: Androgens bind to the androgen receptor (AR) in prostate cells and are essential survival factors for healthy prostate epithelium. Most untreated prostate cancers retain some dependence upon the AR and respond, at least transiently, to androgen ablation therapy. However, the relationship between endogenous androgen levels and cancer etiology is unclear. High levels of androgens have traditionally been viewed as driving abnormal proliferation leading to cancer, but it has also been suggested that low levels of androgen could induce selective pressure for abnormal cells. We formulate a mathematical model of androgen regulated prostate growth to study the effects of abnormal androgen levels on selection for pre-malignant phenotypes in early prostate cancer development.

Results: We find that cell turnover rate increases with decreasing androgen levels, which may increase the rate of mutation and malignant evolution. We model the evolution of a heterogeneous prostate cell population using a continuous state-transition model. Using this model we study selection for AR expression under different androgen levels and find that low androgen environments, caused either by low serum testosterone or by reduced 5α-reductase activity, select more strongly for elevated AR expression than do normal environments. High androgen actually slightly reduces selective pressure for AR upregulation. Moreover, our results suggest that an aberrant androgen environment may delay progression to a malignant phenotype, but result in a more dangerous cancer should one arise.

Conclusions: The model represents a useful initial framework for understanding the role of androgens in prostate cancer etiology, and it suggests that low androgen levels can increase selection for phenotypes resistant to hormonal therapy that may also be more aggressive. Moreover, clinical treatment with 5α-reductase inhibitors such as finasteride may increase the incidence of therapy resistant cancers.

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.

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.