We develop a framework to uncover and analyse dynamical anomalies from massive, nonlinear and non-stationary time series data. The framework consists of three steps: preprocessing of massive datasets to eliminate erroneous data segments, application of the empirical mode decomposition and Hilbert transform paradigm to obtain the fundamental components embedded in the time series at distinct time scales, and statistical/scaling analysis of the components. As a case study, we apply our framework to detecting and characterizing high-frequency oscillations (HFOs) from a big database of rat electroencephalogram recordings. We find a striking phenomenon: HFOs exhibit on–off intermittency that can be quantified by algebraic scaling laws. Our framework can be generalized to big data-related problems in other fields such as large-scale sensor data and seismic data analysis.

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.

How effective are governmental incentives to achieve widespread vaccination coverage so as to prevent epidemic outbreak? The answer largely depends on the complex interplay among the type of incentive, individual behavioral responses, and the intrinsic epidemic dynamics. By incorporating evolutionary games into epidemic dynamics, we investigate the effects of two types of incentives strategies: partial-subsidy policy in which certain fraction of the cost of vaccination is offset, and free-subsidy policy in which donees are randomly selected and vaccinated at no cost. Through mean-field analysis and computations, we find that, under the partial-subsidy policy, the vaccination coverage depends monotonically on the sensitivity of individuals to payoff difference, but the dependence is non-monotonous for the free-subsidy policy. Due to the role models of the donees for relatively irrational individuals and the unchanged strategies of the donees for rational individuals, the free-subsidy policy can in general lead to higher vaccination coverage. Our findings indicate that any disease-control policy should be exercised with extreme care: its success depends on the complex interplay among the intrinsic mathematical rules of epidemic spreading, governmental policies, and behavioral responses of individuals.

High-statistics measurements of differential cross sections and spin density matrix elements for the reaction γp → ϕp have been made using the CLAS detector at Jefferson Lab. We cover center-of-mass energies (√s) from 1.97 to 2.84 GeV, with an extensive coverage in the ϕ production angle. The high statistics of the data sample made it necessary to carefully account for the interplay between the ϕ natural lineshape and effects of the detector resolution, that are found to be comparable in magnitude. We study both the charged- (ϕ → K⁺K^-) and neutral- (ϕ → K[0 over S]K[0 over L]) K[⎯⎯⎯ over K] decay modes of the ϕ. Further, for the charged mode, we differentiate between the cases where the final K^- track is directly detected or its momentum reconstructed as the total missing momentum in the event. The two charged-mode topologies and the neutral-mode have different resolutions and are calibrated against each other. Extensive usage is made of kinematic fitting to improve the reconstructed ϕ mass resolution. Our final results are reported in 10- and mostly 30-MeV-wide √s bins for the charged- and the neutral-modes, respectively. Possible effects from K⁺Λ^* channels with pK[⎯⎯⎯ over K] final states are discussed. These present results constitute the most precise and extensive ϕ photoproduction measurements to date and in conjunction with the ω photoproduction results recently published by CLAS, will greatly improve our understanding of low energy vector meson photoproduction.

A fundamental result in the evolutionary-game paradigm of cyclic competition in spatially extended ecological systems, as represented by the classic Reichenbach-Mobilia-Frey (RMF) model, is that high mobility tends to hamper or even exclude species coexistence. This result was obtained under the hypothesis that individuals move randomly without taking into account the suitability of their local environment. We incorporate local habitat suitability into the RMF model and investigate its effect on coexistence. In particular, we hypothesize the use of “basic instinct” of an individual to determine its movement at any time step. That is, an individual is more likely to move when the local habitat becomes hostile and is no longer favorable for survival and growth. We show that, when such local habitat suitability is taken into account, robust coexistence can emerge even in the high-mobility regime where extinction is certain in the RMF model. A surprising finding is that coexistence is accompanied by the occurrence of substantial empty space in the system. Reexamination of the RMF model confirms the necessity and the important role of empty space in coexistence. Our study implies that adaptation/movements according to local habitat suitability are a fundamental factor to promote species coexistence and, consequently, biodiversity.

Nonhyperbolicity, as characterized by the coexistence of Kolmogorov-Arnold-Moser (KAM) tori and chaos in the phase space, is generic in classical Hamiltonian systems. An open but fundamental question in physics concerns the relativistic quantum manifestations of nonhyperbolic dynamics. We choose the mushroom billiard that has been mathematically proven to be nonhyperbolic, and study the resonant tunneling dynamics of a massless Dirac fermion. We find that the tunneling rate as a function of the energy exhibits a striking "clustering" phenomenon, where the majority of the values of the rate concentrate on a narrow region, as a result of the chaos component in the classical phase space. Relatively few values of the tunneling rate, however, spread outside the clustering region due to the integrable component. Resonant tunneling of electrons in nonhyperbolic chaotic graphene systems exhibits a similar behavior. To understand these numerical results, we develop a theoretical framework by combining analytic solutions of the Dirac equation in certain integrable domains and physical intuitions gained from current understanding of the quantum manifestations of chaos. In particular, we employ a theoretical formalism based on the concept of self-energies to calculate the tunneling rate and analytically solve the Dirac equation in one dimension as well as in two dimensions for a circular-ring-type of tunneling systems exhibiting integrable dynamics in the classical limit. Because relatively few and distinct classical periodic orbits are present in the integrable component, the corresponding relativistic quantum states can have drastically different behaviors, leading to a wide spread in the values of the tunneling rate in the energy-rate plane. In contrast, the chaotic component has embedded within itself an infinite number of unstable periodic orbits, which provide far more quantum states for tunneling. Due to the nature of chaos, these states are characteristically similar, leading to clustering of the values of the tunneling rate in a narrow band. The appealing characteristic of our work is a demonstration and physical understanding of the "mixed" role played by chaos and regular dynamics in shaping relativistic quantum tunneling dynamics.

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.

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.