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.

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.

Our ability to uncover complex network structure and dynamics from data is fundamental to understanding and controlling collective dynamics in complex systems. Despite recent progress in this area, reconstructing networks with stochastic dynamical processes from limited time series remains to be an outstanding problem. Here we develop a framework based on compressed sensing to reconstruct complex networks on which stochastic spreading dynamics take place. We apply the methodology to a large number of model and real networks, finding that a full reconstruction of inhomogeneous interactions can be achieved from small amounts of polarized (binary) data, a virtue of compressed sensing. Further, we demonstrate that a hidden source that triggers the spreading process but is externally inaccessible can be ascertained and located with high confidence in the absence of direct routes of propagation from it. Our approach thus establishes a paradigm for tracing and controlling epidemic invasion and information diffusion in complex networked systems.

We know very little about how soil-borne pollutants such as selenium (Se) can impact pollinators, even though Se has contaminated soils and plants in areas where insect pollination can be critical to the functioning of both agricultural and natural ecosystems. Se can be biotransferred throughout the food web, but few studies have examined its effects on the insects that feed on Se-accumulating plants, particularly pollinators. In laboratory bioassays, we used proboscis extension reflex (PER) and taste perception to determine if the presence of Se affected the gustatory response of honey bee (Apis mellifera L., Hymenoptera: Apidae) foragers. Antennae and proboscises were stimulated with both organic (selenomethionine) and inorganic (selenate) forms of Se that commonly occur in Se-accumulating plants. Methionine was also tested. Each compound was dissolved in 1 M sucrose at 5 concentrations, with sucrose alone as a control. Antennal stimulation with selenomethionine and methionine reduced PER at higher concentrations. Selenate did not reduce gustatory behaviors. Two hours after being fed the treatments, bees were tested for sucrose response threshold. Bees fed selenate responded less to sucrose stimulation. Mortality was higher in bees chronically dosed with selenate compared with a single dose. Selenomethionine did not increase mortality except at the highest concentration. Methionine did not significantly impact survival. Our study has shown that bees fed selenate were less responsive to sucrose, which may lead to a reduction in incoming floral resources needed to support coworkers and larvae in the field. If honey bees forage on nectar containing Se (particularly selenate), reductions in population numbers may occur due to direct toxicity. Given that honey bees are willing to consume food resources containing Se and may not avoid Se compounds in the plant tissues on which they are foraging, they may suffer similar adverse effects as seen in other insect guilds.

Octopamine plays an important role in many behaviors in invertebrates. It acts via binding to G protein coupled receptors located on the plasma membrane of responsive cells. Several distinct subtypes of octopamine receptors have been found in invertebrates, yet little is known about the expression pattern of these different receptor subtypes and how each subtype may contribute to different behaviors. One honey bee (Apis mellifera) octopamine receptor, AmOA1, was recently cloned and characterized. Here we continue to characterize the AmOA1 receptor by investigating its distribution in the honey bee brain. We used two independent antibodies produced against two distinct peptides in the carboxyl-terminus to study the distribution of the AmOA1 receptor in the honey bee brain. We found that both anti-AmOA1 antibodies revealed labeling of cell body clusters throughout the brain and within the following brain neuropils: the antennal lobes; the calyces, pedunculus, vertical (alpha, gamma) and medial (beta) lobes of the mushroom body; the optic lobes; the subesophageal ganglion; and the central complex. Double immunofluorescence staining using anti-GABA and anti-AmOA1 receptor antibodies revealed that a population of inhibitory GABAergic local interneurons in the antennal lobes express the AmOA1 receptor in the cell bodies, axons and their endings in the glomeruli. In the mushroom bodies, AmOA1 receptors are expressed in a subpopulation of inhibitory GABAergic feedback neurons that ends in the visual (outer half of basal ring and collar regions) and olfactory (lip and inner basal ring region) calyx neuropils, as well as in the collar and lip zones of the vertical and medial lobes. The data suggest that one effect of octopamine via AmOA1 in the antennal lobe and mushroom body is to modulate inhibitory neurons.