ASU Scholarship Showcase

A major conundrum in evolution is that, despite natural selection, polymorphism is still omnipresent in nature: Numerous species exhibit multiple morphs, namely several abundant values of an important trait. Polymorphism is particularly prevalent in asymmetric traits, which are beneficial to their carrier in disruptive competitive interference but at the same time bear disadvantages in other aspects, such as greater mortality or lower fecundity. Here we focus on asymmetric traits in which a better competitor disperses fewer offspring in the absence of competition. We report a general pattern in which polymorphic populations emerge when disruptive selection increases: The stronger the selection, the greater the number of morphs that evolve. This pattern is general and is insensitive to the form of the fitness function. The pattern is somewhat counterintuitive since directional selection is excepted to sharpen the trait distribution and thereby reduce its diversity (but note that similar patterns were suggested in studies that demonstrated increased biodiversity as local selection increases in ecological communities). We explain the underlying mechanism in which stronger selection drives the population towards more competitive values of the trait, which in turn reduces the population density, thereby enabling lesser competitors to stably persist with reduced need to directly compete. Thus, we believe that the pattern is more general and may apply to asymmetric traits more broadly. This robust pattern suggests a comparative, unified explanation to a variety of polymorphic traits in nature.

Background: Increasing our understanding of the factors affecting the severity of the 2009 A/H1N1 influenza pandemic in different regions of the world could lead to improved clinical practice and mitigation strategies for future influenza pandemics. Even though a number of studies have shed light into the risk factors associated with severe outcomes of 2009 A/H1N1 influenza infections in different populations (e.g., [1-5]), analyses of the determinants of mortality risk spanning multiple pandemic waves and geographic regions are scarce. Between-country differences in the mortality burden of the 2009 pandemic could be linked to differences in influenza case management, underlying population health, or intrinsic differences in disease transmission [6]. Additional studies elucidating the determinants of disease severity globally are warranted to guide prevention efforts in future influenza pandemics.

In Mexico, the 2009 A/H1N1 influenza pandemic was characterized by a three-wave pattern occurring in the spring, summer, and fall of 2009 with substantial geographical heterogeneity [7]. A recent study suggests that Mexico experienced high excess mortality burden during the 2009 A/H1N1 influenza pandemic relative to other countries [6]. However, an assessment of potential factors that contributed to the relatively high pandemic death toll in Mexico are lacking. Here, we fill this gap by analyzing a large series of laboratory-confirmed A/H1N1 influenza cases, hospitalizations, and deaths monitored by the Mexican Social Security medical system during April 1 through December 31, 2009 in Mexico. In particular, we quantify the association between disease severity, hospital admission delays, and neuraminidase inhibitor use by demographic characteristics, pandemic wave, and geographic regions of Mexico.

Methods: We analyzed a large series of laboratory-confirmed pandemic A/H1N1 influenza cases from a prospective surveillance system maintained by the Mexican Social Security system, April-December 2009. We considered a spectrum of disease severity encompassing outpatient visits, hospitalizations, and deaths, and recorded demographic and geographic information on individual patients. We assessed the impact of neuraminidase inhibitor treatment and hospital admission delay (≤ > 2 days after disease onset) on the risk of death by multivariate logistic regression.

Results: Approximately 50% of all A/H1N1-positive patients received antiviral medication during the Spring and Summer 2009 pandemic waves in Mexico while only 9% of A/H1N1 cases received antiviral medications during the fall wave (P < 0.0001). After adjustment for age, gender, and geography, antiviral treatment significantly reduced the risk of death (OR = 0.52 (95% CI: 0.30, 0.90)) while longer hospital admission delays increased the risk of death by 2.8-fold (95% CI: 2.25, 3.41).

Conclusions: Our findings underscore the potential impact of decreasing admission delays and increasing antiviral use to mitigate the mortality burden of future influenza pandemics.

Tree-like structures are ubiquitous in nature. In particular, neuronal axons and dendrites have tree-like geometries that mediate electrical signaling within and between cells. Electrical activity in neuronal trees is typically modeled using coupled cable equations on multi-compartment representations, where each compartment represents a small segment of the neuronal membrane. The geometry of each compartment is usually defined as a cylinder or, at best, a surface of revolution based on a linear approximation of the radial change in the neurite. The resulting geometry of the model neuron is coarse, with non-smooth or even discontinuous jumps at the boundaries between compartments. We propose a hyperbolic approximation to model the geometry of neurite compartments, a branched, multi-compartment extension, and a simple graphical approach to calculate steady-state solutions of an associated system of coupled cable equations. A simple case of transient solutions is also briefly discussed.

We formulate an in silico model of pathogen avoidance mechanism and investigate its impact on defensive behavioural measures (e.g., spontaneous social exclusions and distancing, crowd avoidance and voluntary vaccination adaptation). In particular, we use SIR(B)S (e.g., susceptible-infected-recovered with additional behavioural component) model to investigate the impact of homo-psychologicus aspects of epidemics. We focus on reactionary behavioural changes, which apply to both social distancing and voluntary vaccination participations. Our analyses reveal complex relationships between spontaneous and uncoordinated behavioural changes, the emergence of its contagion properties, and mitigation of infectious diseases. We find that the presence of effective behavioural changes can impede the persistence of disease. Furthermore, it was found that under perfect effective behavioural change, there are three regions in the response factor (e.g., imitation and/or reactionary) and behavioural scale factor (e.g., global/local) factors ρ–α behavioural space. Mainly, (1) disease is always endemic even in the presence of behavioural change, (2) behavioural-prevalence plasticity is observed and disease can sometimes be eradication, and (3) elimination of endemic disease under permanence of permanent behavioural change is achieved. These results suggest that preventive behavioural changes (e.g., non-pharmaceutical prophylactic measures, social distancing and exclusion, crowd avoidance) are influenced by individual differences in perception of risks and are a salient feature of epidemics. Additionally, these findings indicates that care needs to be taken when considering the effect of adaptive behavioural change in predicting the course of epidemics, and as well as the interpretation and development of the public health measures that account for spontaneous behavioural changes.

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.

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.