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.

Though many animal ornaments and signals are sensitive to and encode information about the oxidative balance (OB) of individuals (e.g., antioxidant supplies/activity, reactive oxygen species, cellular oxidative damage/repair), often the environmental and/or physiological sources of such OB are unknown. Urban development is among the most recent, pervasive, and persistent human stressors on the planet and impacts many environmental and physiological parameters of animals. Here we review the mechanistic underpinnings and functional consequences of how human urbanization drives antioxidant/oxidative status in animals and how this affects signal expression and use. Although we find that urbanization has strong negative effects on signal quality (e.g., visual, auditory, chemical) and OB across a range of taxa, few urban ecophysiological studies address signals and oxidative stress in unison, and even fewer in a fitness context. We also highlight particular signal types, taxa, life-histories, and anthropogenic environmental modifications on which future work integrating OB, signals, and urbanization could be centered. Last, we examine the conceptual and empirical framework behind the idea that urban conditions may disentangle signal expression from honesty and affect plasticity and adaptedness of sexually selected traits and preferences in the city.

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.

From cells to societies, several general principles arise again and again that facilitate cooperation and suppress conflict. In this study, I describe three general principles of cooperation and how they operate across systems including human sharing, cooperation in animal and insect societies and the massively large-scale cooperation that occurs in our multicellular bodies. The first principle is that of Walk Away: that cooperation is enhanced when individuals can leave uncooperative partners. The second principle is that resource sharing is often based on the need of the recipient (i.e., need-based transfers) rather than on strict account-keeping. And the last principle is that effective scaling up of cooperation requires increasingly sophisticated and costly cheater suppression mechanisms. By comparing how these principles operate across systems, we can better understand the constraints on cooperation. This can facilitate the discovery of novel ways to enhance cooperation and suppress cheating in its many forms, from social exploitation to cancer.

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.

Male courtship display is common in many animals; in some cases, males engage in courtship indiscriminately, spending significant time and energy courting heterospecifics with whom they have no chance of mating or producing viable offspring. Due to high costs and few if any benefits, we might expect mechanisms to evolve to reduce such misdirected courtship (or ‘reproductive interference’). In Habronattus jumping spiders, males frequently court heterospecifics with whom they do not mate or hybridize; females are larger and are voracious predators, posing a severe risk to males who court indiscriminately. In this study, we examined patterns of misdirected courtship in a natural community of four sympatric Habronattus species (H. clypeatus, H. hallani, H. hirsutus, and H. pyrrithrix).

We used direct field observations to weigh support for two hypotheses (differential microhabitat use and species recognition signaling) to explain how these species reduce the costs associated with misdirected courtship. We show that, while the four species of Habronattus do show some differences in microhabitat use, all four species still overlap substantially, and in three of the four species individuals equally encountered heterospecifics and conspecifics. Males courted females at every opportunity, regardless of species, and in some cases, this led to aggression and predation by the female. These results suggest that, while differences in microhabitat use might reduce misdirected courtship to some extent, co-existence of these four species may be possible due to complex communication (i.e. species-specific elements of a male’s courtship display). This study is the first to examine misdirected courtship in jumping spiders. Studies of misdirected courtship and its consequences in the field are limited and may broaden our understanding of how biodiversity is maintained within a community.

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.