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.

Honey bees as other insects rely on the innate immune system for protection against diseases. The innate immune system includes the circulating hemocytes (immune cells) that clear pathogens from hemolymph (blood) by phagocytosis, nodulation or encapsulation. Honey bee hemocyte numbers have been linked to hemolymph levels of vitellogenin. Vitellogenin is a multifunctional protein with immune-supportive functions identified in a range of species, including the honey bee. Hemocyte numbers can increase via mitosis, and this recruitment process can be important for immune system function and maintenance. Here, we tested if hemocyte mediated phagocytosis differs among the physiologically different honey bee worker castes (nurses, foragers and winter bees), and study possible interactions with vitellogenin and hemocyte recruitment. To this end, we adapted phagocytosis assays, which—together with confocal microscopy and flow cytometry—allow qualitative and quantitative assessment of hemocyte performance. We found that nurses are more efficient in phagocytic uptake than both foragers and winter bees. We detected vitellogenin within the hemocytes, and found that winter bees have the highest numbers of vitellogenin-positive hemocytes. Connections between phagocytosis, hemocyte-vitellogenin and mitosis were worker caste dependent. Our results demonstrate that the phagocytic performance of immune cells differs significantly between honey bee worker castes, and support increased immune competence in nurses as compared to forager bees. Our data, moreover, provides support for roles of vitellogenin in hemocyte activity.

Honey bees (Apis mellifera) provide a system for studying social and food-related behavior. A caste of workers performs age-related tasks: young bees (nurses) usually feed the brood and other adult bees inside the nest, while older bees (foragers) forage outside for pollen, a protein/lipid source, or nectar, a carbohydrate source. The workers' transition from nursing to foraging and their foraging preferences correlate with differences in gustatory perception, metabolic gene expression, and endocrine physiology including the endocrine factors vitellogenin (Vg) and juvenile hormone (JH). However, the understanding of connections among social behavior, energy metabolism, and endocrine factors is incomplete. We used RNA interference (RNAi) to perturb the gene network of Vg and JH to learn more about these connections through effects on gustation, gene transcripts, and physiology. The RNAi perturbation was achieved by single and double knockdown of the genes ultraspiracle (usp) and vg, which encode a putative JH receptor and Vg, respectively. The double knockdown enhanced gustatory perception and elevated hemolymph glucose, trehalose, and JH. We also observed transcriptional responses in insulin like peptide 1 (ilp1), the adipokinetic hormone receptor (AKHR), and cGMP-dependent protein kinase (PKG, or “foraging gene” Amfor). Our study demonstrates that the Vg–JH regulatory module controls changes in carbohydrate metabolism, but not lipid metabolism, when worker bees shift from nursing to foraging. The module is also placed upstream of ilp1, AKHR, and PKG for the first time. As insulin, adipokinetic hormone (AKH), and PKG pathways influence metabolism and gustation in many animals, we propose that honey bees have conserved pathways in carbohydrate metabolism and conserved connections between energy metabolism and gustatory perception. Thus, perhaps the bee can make general contributions to the understanding of food-related behavior and metabolic disorders.

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.

Insect immune systems can recognize specific pathogens and prime offspring immunity. High specificity of immune priming can be achieved when insect females transfer immune elicitors into developing oocytes. The molecular mechanism behind this transfer has been a mystery. Here, we establish that the egg-yolk protein vitellogenin is the carrier of immune elicitors. Using the honey bee, Apis mellifera, model system, we demonstrate with microscopy and western blotting that vitellogenin binds to bacteria, both Paenibacillus larvae – the gram-positive bacterium causing American foulbrood disease – and to Escherichia coli that represents gram-negative bacteria. Next, we verify that vitellogenin binds to pathogen-associated molecular patterns; lipopolysaccharide, peptidoglycan and zymosan, using surface plasmon resonance. We document that vitellogenin is required for transport of cell-wall pieces of E. coli into eggs by imaging tissue sections. These experiments identify vitellogenin, which is distributed widely in oviparous species, as the carrier of immune-priming signals. This work reveals a molecular explanation for trans-generational immunity in insects and a previously undescribed role for vitellogenin.

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.

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.