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.

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.

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.

Bismuth drugs, despite being clinically used for decades, surprisingly remain in use and effective for the treatment of Helicobacter pylori infection, even for resistant strains when co-administrated with antibiotics. However, the molecular mechanisms underlying the clinically sustained susceptibility of H. pylori to bismuth drugs remain elusive. Herein, we report that integration of in-house metalloproteomics and quantitative proteomics allows comprehensive uncovering of the bismuth-associated proteomes, including 63 bismuth-binding and 119 bismuth-regulated proteins from Helicobacter pylori, with over 60% being annotated with catalytic functions. Through bioinformatics analysis in combination with bioassays, we demonstrated that bismuth drugs disrupted multiple essential pathways in the pathogen, including ROS defence and pH buffering, by binding and functional perturbation of a number of key enzymes. Moreover, we discovered that HpDnaK may serve as a new target of bismuth drugs to inhibit bacterium-host cell adhesion. The integrative approach we report, herein, provides a novel strategy to unveil the molecular mechanisms of antimicrobial metals against pathogens in general. This study sheds light on the design of new types of antimicrobial agents with multiple targets to tackle the current crisis of antimicrobial resistance.

Competing endogenous RNAs (ceRNAs) are RNA molecules that sequester shared microRNAs (miRNAs) thereby affecting the expression of other targets of the miRNAs. Whether genetic variants in ceRNA can affect its biological function and disease development is still an open question. Here we identified a large number of genetic variants that are associated with ceRNA's function using Geuvaids RNA-seq data for 462 individuals from the 1000 Genomes Project. We call these loci competing endogenous RNA expression quantitative trait loci or ‘cerQTL’, and found that a large number of them were unexplored in conventional eQTL mapping. We identified many cerQTLs that have undergone recent positive selection in different human populations, and showed that single nucleotide polymorphisms in gene 3΄UTRs at the miRNA seed binding regions can simultaneously regulate gene expression changes in both cis and trans by the ceRNA mechanism. We also discovered that cerQTLs are significantly enriched in traits/diseases associated variants reported from genome-wide association studies in the miRNA binding sites, suggesting that disease susceptibilities could be attributed to ceRNA regulation. Further in vitro functional experiments demonstrated that a cerQTL rs11540855 can regulate ceRNA function. These results provide a comprehensive catalog of functional non-coding regulatory variants that may be responsible for ceRNA crosstalk at the post-transcriptional level.

Infection after renal transplantation remains a major cause of morbidity and death, especially infection from the extensively drug-resistant bacteria, A. baumannii. A total of fourteen A. baumannii isolates were isolated from the donors’ preserved fluid from DCD (donation after cardiac death) renal transplantation and four isolates in the recipients’ draining liquid at the Kidney Disease Center, The First Affiliated Hospital, College of Medicine, Zhejiang University, from March 2013 to November 2014. An outbreak of A. baumannii emerging after DCD renal transplantation was tracked to understand the transmission of the pathogen. PFGE displayed similar DNA patterns between isolates from the same hospital. Antimicrobial susceptibility tests against thirteen antimicrobial agents were determined using the K-B diffusion method and eTest. Whole-genome sequencing was applied to investigate the genetic relationship of the isolates. With the clinical data and research results, we concluded that the A. baumannii isolates 3R1 and 3R2 was probably transmitted from the donor who acquired the bacteria during his stay in the ICU, while isolate 4R1 was transmitted from 3R1 and 3R2 via medical manipulation. This study demonstrated the value of integration of clinical profiles with molecular methods in outbreak investigation and their importance in controlling infection and preventing serious complications after DCD transplantation.

Whole genome sequencing (WGS) is a promising strategy to unravel variants or genes responsible for human diseases and traits. However, there is a lack of robust platforms for a comprehensive downstream analysis. In the present study, we first proposed three novel algorithms, sequence gap-filled gene feature annotation, bit-block encoded genotypes and sectional fast access to text lines to address three fundamental problems. The three algorithms then formed the infrastructure of a robust parallel computing framework, KGGSeq, for integrating downstream analysis functions for whole genome sequencing data. KGGSeq has been equipped with a comprehensive set of analysis functions for quality control, filtration, annotation, pathogenic prediction and statistical tests. In the tests with whole genome sequencing data from 1000 Genomes Project, KGGSeq annotated several thousand more reliable non-synonymous variants than other widely used tools (e.g. ANNOVAR and SNPEff). It took only around half an hour on a small server with 10 CPUs to access genotypes of ∼60 million variants of 2504 subjects, while a popular alternative tool required around one day. KGGSeq's bit-block genotype format used 1.5% or less space to flexibly represent phased or unphased genotypes with multiple alleles and achieved a speed of over 1000 times faster to calculate genotypic correlation.

Modeling of transcriptional regulatory networks (TRNs) has been increasingly used to dissect the nature of gene regulation. Inference of regulatory relationships among transcription factors (TFs) and genes, especially among multiple TFs, is still challenging. In this study, we introduced an integrative method, LogicTRN, to decode TF–TF interactions that form TF logics in regulating target genes. By combining cis-regulatory logics and transcriptional kinetics into one single model framework, LogicTRN can naturally integrate dynamic gene expression data and TF-DNA-binding signals in order to identify the TF logics and to reconstruct the underlying TRNs. We evaluated the newly developed methodology using simulation, comparison and application studies, and the results not only show their consistence with existing knowledge, but also demonstrate its ability to accurately reconstruct TRNs in biological complex systems.