ASU Scholarship Showcase

Two classes of scaling behaviours, namely the super-linear scaling of links or activities, and the sub-linear scaling of area, diversity, or time elapsed with respect to size have been found to prevail in the growth of complex networked systems. Despite some pioneering modelling approaches proposed for specific systems, whether there exists some general mechanisms that account for the origins of such scaling behaviours in different contexts, especially in socioeconomic systems, remains an open question. We address this problem by introducing a geometric network model without free parameter, finding that both super-linear and sub-linear scaling behaviours can be simultaneously reproduced and that the scaling exponents are exclusively determined by the dimension of the Euclidean space in which the network is embedded. We implement some realistic extensions to the basic model to offer more accurate predictions for cities of various scaling behaviours and the Zipf distribution reported in the literature and observed in our empirical studies. All of the empirical results can be precisely recovered by our model with analytical predictions of all major properties. By virtue of these general findings concerning scaling behaviour, our models with simple mechanisms gain new insights into the evolution and development of complex networked systems.

The threat of West Nile virus (WNV) epidemics with increasingly severe neuroinvasive infections demands the development and licensing of effective vaccines. To date, vaccine candidates based on inactivated, live-attenuated, or chimeric virus, and viral DNA and WNV protein subunits have been developed. Some have been approved for veterinary use or are under clinical investigation, yet no vaccine has been licensed for human use. Reaching the milestone of a commercialized human vaccine, however, may largely depend on the economics of vaccine production. Analysis suggests that currently only novel low-cost production technologies would allow vaccination to outcompete the cost of surveillance and clinical treatment. Here, we review progress using plants to address the economic challenges of WNV vaccine production. The advantages of plants as hosts for vaccine production in cost, speed and scalability, especially those of viral vector-based transient expression systems, are discussed. The progress in developing WNV subunit vaccines in plants is reviewed within the context of their expression, characterization, downstream processing, and immunogenicity in animal models. The development of vaccines based on enveloped and non-enveloped virus-like particles is also discussed. These advancements suggest that plants may provide a production platform that offers potent, safe and affordable human vaccines against WNV.

Previously, our group engineered a plant-derived monoclonal antibody (MAb) (pHu-E16) that efficiently treated West Nile virus (WNV) infection in mice. In this study, we developed several pHu-E16 variants to improve its efficacy. These variants included a single-chain variable fragment (scFv) of pHu-E16 fused to the heavy chain (HC) constant domains (CH1-3) of human IgG (pHu-E16scFv-CH1-3) and a tetravalent molecule (Tetra pHu-E16) assembled from pHu-E16scFv-CH1-3 with a second pHu-E16scFv fused to the light chain (LC) constant region. pHu-E16scFv-CH1-3 and Tetra pHu-E16 were efficiently expressed and assembled in plants. To assess the impact of differences in N-linked glycosylation on pHu-E16 variant assembly and function, we expressed additional pHu-E16 variants with various combinations of HC and LC components.

Our study revealed that proper pairing of HC and LC was essential for the complete N-glycan processing of antibodies in both plant and animal cells. Associated with their distinct N-glycoforms, pHu-E16, pHu-E16scFv-CH1-3 and Tetra pHu-E16 exhibited differential binding to C1q and specific Fcγ receptors (FcγR). Notably, none of the plant-derived Hu-E16 variants showed antibody-dependent enhancement (ADE) activity in CD32A+ human cells, suggesting the potential of plant-produced antibodies to minimize the adverse effect of ADE. Importantly, all plant-derived MAb variants exhibited at least equivalent in vitro neutralization and in vivo protection in mice compared to mammalian cell-produced Hu-E16. This study demonstrates the capacity of plants to express and assemble a large, complex and functional IgG-like tetravalent mAb variant and also provides insight into the relationship between MAb N-glycosylation, FcγR and C1q binding, and ADE. These new insights may allow the development of safer and cost effective MAb-based therapeutics for flaviviruses, and possibly other pathogens.

Cancer therapy selects for cancer cells resistant to treatment, a process that is fundamentally evolutionary. To what extent, however, is the evolutionary perspective employed in research on therapeutic resistance and relapse? We analyzed 6,228 papers on therapeutic resistance and/or relapse in cancers and found that the use of evolution terms in abstracts has remained at about 1% since the 1980s. However, detailed coding of 22 recent papers revealed a higher proportion of papers using evolutionary methods or evolutionary theory, although this number is still less than 10%. Despite the fact that relapse and therapeutic resistance is essentially an evolutionary process, it appears that this framework has not permeated research. This represents an unrealized opportunity for advances in research on therapeutic resistance.

Background: Medical and public health scientists are using evolution to devise new strategies to solve major health problems. But based on a 2003 survey, medical curricula may not adequately prepare physicians to evaluate and extend these advances. This study assessed the change in coverage of evolution in North American medical schools since 2003 and identified opportunities for enriching medical education.

Methods: In 2013, curriculum deans for all North American medical schools were invited to rate curricular coverage and perceived importance of 12 core principles, the extent of anticipated controversy from adding evolution, and the usefulness of 13 teaching resources. Differences between schools were assessed by Pearson’s chi-square test, Student’s t-test, and Spearman’s correlation. Open-ended questions sought insight into perceived barriers and benefits.

Results: Despite repeated follow-up, 60 schools (39%) responded to the survey. There was no evidence of sample bias. The three evolutionary principles rated most important were antibiotic resistance, environmental mismatch, and somatic selection in cancer. While importance and coverage of principles were correlated (r = 0.76, P < 0.01), coverage (at least moderate) lagged behind importance (at least moderate) by an average of 21% (SD = 6%). Compared to 2003, a range of evolutionary principles were covered by 4 to 74% more schools. Nearly half (48%) of responders anticipated igniting controversy at their medical school if they added evolution to their curriculum. The teaching resources ranked most useful were model test questions and answers, case studies, and model curricula for existing courses/rotations. Limited resources (faculty expertise) were cited as the major barrier to adding more evolution, but benefits included a deeper understanding and improved patient care.

Conclusion: North American medical schools have increased the evolution content in their curricula over the past decade. However, coverage is not commensurate with importance. At a few medical schools, anticipated controversy impedes teaching more evolution. Efforts to improve evolution education in medical schools should be directed toward boosting faculty expertise and crafting resources that can be easily integrated into existing curricula.

Given a complex geospatial network with nodes distributed in a two-dimensional region of physical space, can the locations of the nodes be determined and their connection patterns be uncovered based solely on data? We consider the realistic situation where time series/signals can be collected from a single location. A key challenge is that the signals collected are necessarily time delayed, due to the varying physical distances from the nodes to the data collection centre. To meet this challenge, we develop a compressive-sensing-based approach enabling reconstruction of the full topology of the underlying geospatial network and more importantly, accurate estimate of the time delays. A standard triangularization algorithm can then be employed to find the physical locations of the nodes in the network. We further demonstrate successful detection of a hidden node (or a hidden source or threat), from which no signal can be obtained, through accurate detection of all its neighbouring nodes. As a geospatial network has the feature that a node tends to connect with geophysically nearby nodes, the localized region that contains the hidden node can be identified.

Recent works revealed that the energy required to control a complex network depends on the number of driving signals and the energy distribution follows an algebraic scaling law. If one implements control using a small number of drivers, e.g. as determined by the structural controllability theory, there is a high probability that the energy will diverge. We develop a physical theory to explain the scaling behaviour through identification of the fundamental structural elements, the longest control chains (LCCs), that dominate the control energy. Based on the LCCs, we articulate a strategy to drastically reduce the control energy (e.g. in a large number of real-world networks). Owing to their structural nature, the LCCs may shed light on energy issues associated with control of nonlinear dynamical 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.

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.