ASU Scholarship Showcase

We develop a general framework to analyze the controllability of multiplex networks using multiple-relation networks and multiple-layer networks with interlayer couplings as two classes of prototypical systems. In the former, networks associated with different physical variables share the same set of nodes and in the latter, diffusion processes take place. We find that, for a multiple-relation network, a layer exists that dominantly determines the controllability of the whole network and, for a multiple-layer network, a small fraction of the interconnections can enhance the controllability remarkably. Our theory is generally applicable to other types of multiplex networks as well, leading to significant insights into the control of complex network systems with diverse structures and interacting patterns.

Quantifying the interactions of bacteria with external ligands is fundamental to the understanding of pathogenesis, antibiotic resistance, immune evasion, and mechanism of antimicrobial action. Due to inherent cell-to-cell heterogeneity in a microbial population, each bacterium interacts differently with its environment. This large variability is washed out in bulk assays, and there is a need of techniques that can quantify interactions of bacteria with ligands at the single bacterium level. In this work, we present a label-free and real-time plasmonic imaging technique to measure the binding kinetics of ligand interactions with single bacteria, and perform statistical analysis of the heterogeneity. Using the technique, we have studied interactions of antibodies with single Escherichia coli O157:H7 cells and demonstrated a capability of determining the binding kinetic constants of single live bacteria with ligands, and quantify heterogeneity in a microbial population.

Background:
Ketogenic diets are high fat and low carbohydrate or very low carbohydrate diets, which render high production of ketones upon consumption known as nutritional ketosis (NK). Ketosis is also produced during fasting periods, which is known as fasting ketosis (FK). Recently, the combinations of NK and FK, as well as NK alone, have been used as resources for weight loss management and treatment of epilepsy.

Methods:
A crossover study design was applied to 11 healthy individuals, who maintained moderately sedentary lifestyle, and consumed three types of diet randomly assigned over a three-week period. All participants completed the diets in a randomized and counterbalanced fashion. Each weekly diet protocol included three phases: Phase 1 - A mixed diet with ratio of fat: (carbohydrate + protein) by mass of 0.18 or the equivalence of 29% energy from fat from Day 1 to Day 5. Phase 2- A mixed or a high-fat diet with ratio of fat: (carbohydrate + protein) by mass of approximately 0.18, 1.63, or 3.80 on Day 6 or the equivalence of 29%, 79%, or 90% energy from fat, respectively. Phase 3 - A fasting diet with no calorie intake on Day 7. Caloric intake from diets on Day 1 to Day 6 was equal to each individual’s energy expenditure. On Day 7, ketone buildup from FK was measured.

Results:
A statistically significant effect of Phase 2 (Day 6) diet was found on FK of Day 7, as indicated by repeated analysis of variance (ANOVA), F(2,20) = 6.73, p < 0.0058. Using a Fisher LDS pair-wise comparison, higher significant levels of acetone buildup were found for diets with 79% fat content and 90% fat content vs. 29% fat content (with p = 0.00159**, and 0.04435**, respectively), with no significant difference between diets with 79% fat content and 90% fat content. In addition, independent of the diet, a significantly higher ketone buildup capability of subjects with higher resting energy expenditure (R[superscript 2] = 0.92), and lower body mass index (R[superscript 2] = 0.71) was observed during FK.

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.

Many drugs are effective in the early stage of treatment, but patients develop drug resistance after a certain period of treatment, causing failure of the therapy. An important example is Herceptin, a popular monoclonal antibody drug for breast cancer by specifically targeting human epidermal growth factor receptor 2 (Her2). Here we demonstrate a quantitative binding kinetics analysis of drug-target interactions to investigate the molecular scale origin of drug resistance. Using a surface plasmon resonance imaging, we measured the in situ Herceptin-Her2 binding kinetics in single intact cancer cells for the first time, and observed significantly weakened Herceptin-Her2 interactions in Herceptin-resistant cells, compared to those in Herceptin-sensitive cells. We further showed that the steric hindrance of Mucin-4, a membrane protein, was responsible for the altered drug-receptor binding. This effect of a third molecule on drug-receptor interactions cannot be studied using traditional purified protein methods, demonstrating the importance of the present intact cell-based binding kinetics analysis.

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.

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.

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.

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.