ASU Scholarship Showcase

Large urban emissions of greenhouse gases result in large atmospheric enhancements relative to background that are easily measured. Using CO₂ mole fractions and Δ¹⁴C and δ¹³C values of CO₂ in the Los Angeles megacity observed in inland Pasadena (2006–2013) and coastal Palos Verdes peninsula (autumn 2009–2013), we have determined time series for CO₂ contributions from fossil fuel combustion (C_ff) for both sites and broken those down into contributions from petroleum and/or gasoline and natural gas burning for Pasadena. We find a 10 % reduction in Pasadena C_ff during the Great Recession of 2008–2010, which is consistent with the bottom-up inventory determined by the California Air Resources Board. The isotopic variations and total atmospheric CO₂ from our observations are used to infer seasonality of natural gas and petroleum combustion. The trend of CO₂ contributions to the atmosphere from natural gas combustion is out of phase with the seasonal cycle of total natural gas combustion seasonal patterns in bottom-up inventories but is consistent with the seasonality of natural gas usage by the area's electricity generating power plants. For petroleum, the inferred seasonality of CO₂ contributions from burning petroleum is delayed by several months relative to usage indicated by statewide gasoline taxes. Using the high-resolution Hestia-LA data product to compare C_ff from parts of the basin sampled by winds at different times of year, we find that variations in observed fossil fuel CO₂ reflect seasonal variations in wind direction. The seasonality of the local CO₂ excess from fossil fuel combustion along the coast, on Palos Verdes peninsula, is higher in autumn and winter than spring and summer, almost completely out of phase with that from Pasadena, also because of the annual variations of winds in the region. Variations in fossil fuel CO₂ signals are consistent with sampling the bottom-up Hestia-LA fossil CO₂ emissions product for sub-city source regions in the LA megacity domain when wind directions are considered.

Atmospheric CO₂ inversions estimate surface carbon fluxes from an optimal fit to atmospheric CO₂ measurements, usually including prior constraints on the flux estimates. Eleven sets of carbon flux estimates are compared, generated by different inversions systems that vary in their inversions methods, choice of atmospheric data, transport model and prior information. The inversions were run for at least 5 yr in the period between 1990 and 2010. Mean fluxes for 2001–2004, seasonal cycles, interannual variability and trends are compared for the tropics and northern and southern extra-tropics, and separately for land and ocean. Some continental/basin-scale subdivisions are also considered where the atmospheric network is denser. Four-year mean fluxes are reasonably consistent across inversions at global/latitudinal scale, with a large total (land plus ocean) carbon uptake in the north (−3.4 Pg C yr^-1 (±0.5 Pg C yr^-1 standard deviation), with slightly more uptake over land than over ocean), a significant although more variable source over the tropics (1.6 ± 0.9 Pg C yr^-1) and a compensatory sink of similar magnitude in the south (−1.4 ± 0.5 Pg C yr^-1) corresponding mainly to an ocean sink. Largest differences across inversions occur in the balance between tropical land sources and southern land sinks. Interannual variability (IAV) in carbon fluxes is larger for land than ocean regions (standard deviation around 1.06 versus 0.33 Pg C yr[superscript −1] for the 1996–2007 period), with much higher consistency among the inversions for the land. While the tropical land explains most of the IAV (standard deviation ~ 0.65 Pg C yr^-1), the northern and southern land also contribute (standard deviation ~ 0.39 Pg C yr^-1). Most inversions tend to indicate an increase of the northern land carbon uptake from late 1990s to 2008 (around 0.1 Pg C yr^-1, predominantly in North Asia. The mean seasonal cycle appears to be well constrained by the atmospheric data over the northern land (at the continental scale), but still highly dependent on the prior flux seasonality over the ocean. Finally we provide recommendations to interpret the regional fluxes, along with the uncertainty estimates.

This paper presents an analysis of methane emissions from the Los Angeles Basin at monthly timescales across a 4-year time period – from September 2011 to August 2015. Using observations acquired by a ground-based near-infrared remote sensing instrument on Mount Wilson, California, combined with atmospheric CH₄–CO₂ tracer–tracer correlations, we observed −18 to +22 % monthly variability in CH₄ : CO₂ from the annual mean in the Los Angeles Basin. Top-down estimates of methane emissions for the basin also exhibit significant monthly variability (−19 to +31 % from annual mean and a maximum month-to-month change of 47 %). During this period, methane emissions consistently peaked in the late summer/early fall and winter. The estimated annual methane emissions did not show a statistically significant trend over the 2011 to 2015 time period.

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.

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.

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.

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.

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.

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.

Our ability to uncover complex network structure and dynamics from data is fundamental to understanding and controlling collective dynamics in complex systems. Despite recent progress in this area, reconstructing networks with stochastic dynamical processes from limited time series remains to be an outstanding problem. Here we develop a framework based on compressed sensing to reconstruct complex networks on which stochastic spreading dynamics take place. We apply the methodology to a large number of model and real networks, finding that a full reconstruction of inhomogeneous interactions can be achieved from small amounts of polarized (binary) data, a virtue of compressed sensing. Further, we demonstrate that a hidden source that triggers the spreading process but is externally inaccessible can be ascertained and located with high confidence in the absence of direct routes of propagation from it. Our approach thus establishes a paradigm for tracing and controlling epidemic invasion and information diffusion in complex networked systems.