ASU Scholarship Showcase

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.

Recently, the phenomenon of quantum-classical correspondence breakdown was uncovered in optomechanics, where in the classical regime the system exhibits chaos but in the corresponding quantum regime the motion is regular - there appears to be no signature of classical chaos whatsoever in the corresponding quantum system, generating a paradox. We find that transient chaos, besides being a physically meaningful phenomenon by itself, provides a resolution. Using the method of quantum state diffusion to simulate the system dynamics subject to continuous homodyne detection, we uncover transient chaos associated with quantum trajectories. The transient behavior is consistent with chaos in the classical limit, while the long term evolution of the quantum system is regular. Transient chaos thus serves as a bridge for the quantum-classical transition (QCT). Strikingly, as the system transitions from the quantum to the classical regime, the average chaotic transient lifetime increases dramatically (faster than the Ehrenfest time characterizing the QCT for isolated quantum systems). We develop a physical theory to explain the scaling law.

A remarkable phenomenon in spatiotemporal dynamical systems is chimera state, where the structurally and dynamically identical oscillators in a coupled networked system spontaneously break into two groups, one exhibiting coherent motion and another incoherent. This phenomenon was typically studied in the setting of non-local coupling configurations. We ask what can happen to chimera states under systematic changes to the network structure when links are removed from the network in an orderly fashion but the local coupling topology remains invariant with respect to an index shift. We find the emergence of multicluster chimera states. Remarkably, as a parameter characterizing the amount of link removal is increased, chimera states of distinct numbers of clusters emerge and persist in different parameter regions. We develop a phenomenological theory, based on enhanced or reduced interactions among oscillators in different spatial groups, to explain why chimera states of certain numbers of clusters occur in certain parameter regions. The theoretical prediction agrees well with numerics.

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.

Persistent currents (PCs), one of the most intriguing manifestations of the Aharonov-Bohm (AB) effect, are known to vanish for Schrödinger particles in the presence of random scatterings, e.g., due to classical chaos. But would this still be the case for Dirac fermions? Addressing this question is of significant value due to the tremendous recent interest in two-dimensional Dirac materials. We investigate relativistic quantum AB rings threaded by a magnetic flux and find that PCs are extremely robust. Even for highly asymmetric rings that host fully developed classical chaos, the amplitudes of PCs are of the same order of magnitude as those for integrable rings, henceforth the term superpersistent currents (SPCs). A striking finding is that the SPCs can be attributed to a robust type of relativistic quantum states, i.e., Dirac whispering gallery modes (WGMs) that carry large angular momenta and travel along the boundaries. We propose an experimental scheme using topological insulators to observe and characterize Dirac WGMs and SPCs, and speculate that these features can potentially be the base for a new class of relativistic qubit systems. Our discovery of WGMs in relativistic quantum systems is remarkable because, although WGMs are common in photonic systems, they are relatively rare in electronic systems.

The phenomenon of Fano resonance is ubiquitous in a large variety of wave scattering systems, where the resonance profile is typically asymmetric. Whether the parameter characterizing the asymmetry should be complex or real is an issue of great experimental interest. Using coherent quantum transport as a paradigm and taking into account of the collective contribution from all available scattering channels, we derive a universal formula for the Fano-resonance profile. We show that our formula bridges naturally the traditional Fano formulas with complex and real asymmetry parameters, indicating that the two types of formulas are fundamentally equivalent (except for an offset). The connection also reveals a clear footprint for the conductance resonance during a dephasing process. Therefore, the emergence of complex asymmetric parameter when fitting with experimental data needs to be properly interpreted. Furthermore, we have provided a theory for the width of the resonance, which relates explicitly the width to the degree of localization of the close-by eigenstates and the corresponding coupling matrices or the self-energies caused by the leads. Our work not only resolves the issue about the nature of the asymmetry parameter, but also provides deeper physical insights into the origin of Fano resonance. Since the only assumption in our treatment is that the transport can be described by the Green’s function formalism, our results are also valid for broad disciplines including scattering problems of electromagnetic waves, acoustics, and seismology.

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.