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.

Background: In Africa and Asia, sugarcane is the host of at least seven different virus species in the genus Mastrevirus of the family Geminiviridae. However, with the exception of Sugarcane white streak virus in Barbados, no other sugarcane-infecting mastrevirus has been reported in the New World. Conservation and exchange of sugarcane germplasm using stalk cuttings facilitates the spread of sugarcane-infecting viruses.

Methods: A virion-associated nucleic acids (VANA)-based metagenomics approach was used to detect mastrevirus sequences in 717 sugarcane samples from Florida (USA), Guadeloupe (French West Indies), and Réunion (Mascarene Islands). Contig assembly was performed using CAP3 and sequence searches using BLASTn and BLASTx. Mastrevirus full genomes were enriched from total DNA by rolling circle amplification, cloned and sequenced. Nucleotide and amino acid sequence identities were determined using SDT v1.2. Phylogenetic analyses were conducted using MEGA6 and PHYML3.

Results: We identified a new sugarcane-infecting mastrevirus in six plants sampled from germplasm collections in Florida and Guadeloupe. Full genome sequences were determined and analyzed for three virus isolates from Florida, and three from Guadeloupe. These six genomes share >88% genome-wide pairwise identity with one another and between 89 and 97% identity with a recently identified mastrevirus (KR150789) from a sugarcane plant sampled in China. Sequences similar to these were also identified in sugarcane plants in Réunion.

Conclusions: As these virus isolates share <64% genome-wide identity with all other known mastreviruses, we propose classifying them within a new mastrevirus species named Sugarcane striate virus. This is the first report of sugarcane striate virus (SCStV) in the Western Hemisphere, a virus that most likely originated in Asia. The distribution, vector, and impact of SCStV on sugarcane production remains to be determined.

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.

Four genomovirus genomes were recovered from thrips (Echinothrips americanus) collected in Florida, USA. These represent four new species which are members of the Gemycircularvirus (n = 2), Gemyduguivirus (n = 1), and Gemykibivirus (n = 1) genera. This is the first record, to our knowledge, of genomoviruses associated with a phytophagous insect.

With the advent of metagenomics approaches, a large diversity of known and unknown viruses has been identified in various types of environmental, plant, and animal samples. One such widespread virus group is the recently established family Genomoviridae which includes viruses with small (∼2–2.4 kb), circular ssDNA genomes encoding rolling-circle replication initiation proteins (Rep) and unique capsid proteins. Here, we propose a sequence-based taxonomic framework for classification of 121 new virus genomes within this family. Genomoviruses display ∼47% sequence diversity, which is very similar to that within the well-established and extensively studied family Geminiviridae (46% diversity). Based on our analysis, we establish a 78% genome-wide pairwise identity as a species demarcation threshold. Furthermore, using a Rep sequence phylogeny-based analysis coupled with the current knowledge on the classification of geminiviruses, we establish nine genera within the Genomoviridae family. These are Gemycircularvirus (n = 73), Gemyduguivirus (n = 1), Gemygorvirus (n = 9), Gemykibivirus (n = 29), Gemykolovirus (n = 3), Gemykrogvirus (n = 3), Gemykroznavirus (n = 1), Gemytondvirus (n = 1), Gemyvongvirus (n = 1). The presented taxonomic framework offers rational classification of genomoviruses based on the sequence information alone and sets an example for future classification of other groups of uncultured viruses discovered using metagenomics approaches.

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.