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.

We study the so-called Descent, or [bar over Q], Equation for the null polygonal supersymmetric Wilson loop in the framework of the pentagon operator product expansion. To properly address this problem, one requires to restore the cyclicity of the loop broken by the choice of OPE channels. In the course of the study, we unravel a phenomenon of twist enhancement when passing to a cyclically shifted channel. Currently, we focus on the consistency of the all-order Descent Equation for the particular case relating the NMHV heptagon to MHV hexagon. We find that the equation establishes a relation between contributions of different twists and successfully verify it in perturbation theory making use of available bootstrap predictions for elementary pentagons.

We present a new approach to computing event shape distributions or, more precisely, charge flow correlations in a generic conformal field theory (CFT). These infrared finite observables are familiar from collider physics studies and describe the angular distribution of global charges in outgoing radiation created from the vacuum by some source. The charge flow correlations can be expressed in terms of Wightman correlation functions in a certain limit. We explain how to compute these quantities starting from their Euclidean analogues by means of a nontrivial analytic continuation which, in the framework of CFT, can be performed elegantly in Mellin space. The relation between the charge flow correlations and Euclidean correlation functions can be reformulated directly in configuration space, bypassing the Mellin representation, as a certain Lorentzian double discontinuity of the correlation function integrated along the cuts. We illustrate the general formalism in N = 4 SYM, making use of the well-known results on the four-point correlation function of half-BPS scalar operators. We compute the double scalar flow correlation in N = 4 SYM, at weak and strong coupling and show that it agrees with known results obtained by different techniques. One of the remarkable features of the N = 4 theory is that the scalar and energy flow correlations are proportional to each other. Imposing natural physical conditions on the energy flow correlations (finiteness, positivity and regularity), we formulate additional constraints on the four-point correlation functions in N = 4SYM that should be valid at any coupling and away from the planar limit.

We analyze the near-collinear limit of the null polygonal hexagon super Wilson loop in the planar N = 4 super-Yang–Mills theory. We focus on its Grassmann components which are dual to next-to-maximal helicity-violating (NMHV) scattering amplitudes. The kinematics in question is studied within a framework of the operator product expansion that encodes propagation of excitations on the background of the color flux tube stretched between the sides of Wilson loop contour. While their dispersion relation is known to all orders in 't Hooft coupling from previous studies, we find their form factor couplings to the Wilson loop. This is done making use of a particular tessellation of the loop where pentagon transitions play a fundamental role. Being interested in NMHV amplitudes, the corresponding building blocks carry a nontrivial charge under the SU(4) R-symmetry group. Restricting the current consideration to twist-two accuracy, we analyze two-particle contributions with a fermion as one of the constituents in the pair. We demonstrate that these nonsinglet pentagons obey bootstrap equations that possess consistent solutions for any value of the coupling constant. To confirm the correctness of these predictions, we calculate their contribution to the super Wilson loop demonstrating agreement with recent results to four-loop order in 't Hooft coupling.

We study event shapes in N = 4SYM describing the angular distribution of energy and R-charge in the final states created by the simplest half-BPS scalar operator. Applying the approach developed in the companion paper arXiv:1309.0769, we compute these observables using the correlation functions of certain components of the N = 4 stress-tensor supermultiplet: the half-BPS operator itself, the R-symmetry current and the stress tensor. We present master formulas for the all-order event shapes as convolutions of the Mellin amplitude defining the correlation function of the half-BPS operators, with a coupling-independent kernel determined by the choice of the observable. We find remarkably simple relations between various event shapes following from N = 4 superconformal symmetry. We perform thorough checks at leading order in the weak coupling expansion and show perfect agreement with the conventional calculations based on amplitude techniques. We extend our results to strong coupling using the correlation function of half-BPS operators obtained from the AdS/CFT correspondence.

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.