Search NASA⌕ Search

SEARCH · Search NASA

Results for “complex networks”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 55 records · Page 3

Controlling the self-organizing dynamics in a sandpile model on complex networks by failure tolerance

In this paper, we propose a strategy to control the self-organizing dynamics of the Bak-Tang-Wiesenfeld (BTW) sandpile model on complex networks by allowing some degree of failure tolerance for the nodes and introducing additional active dissipation while taking the risk of possible node damage. We show that the probability for large cascades significantly increases or decreases respectively when the risk for node damage outweighs the active dissipation and when the active dissipation outweighs the risk for node damage. By considering the potential additional risk from node damage, a non-trivial optimal active dissipation control strategy which minimizes the total cost in the system can be obtained. Under some conditions the introduced control strategy can decrease the total cost in the system compared to the uncontrolled model. Moreover, when the probability of damaging a node experiencing failure tolerance is greater than the critical value, then no matter how successful the active dissipation control is, the total cost of the system will have to increase. This critical damage probability can be used as an indicator of the robustness of a network or system. Copyright (C) EPLA, 2015

Qi, Junjian↗

The interconnected rhizosphere: High network complexity dominates rhizosphere assemblages

While interactions between roots and microorganisms have been intensively studied, we know little about interactions among root-associated microbes. We used random matrix theory-based network analysis of 16S rRNA genes to identify bacterial networks associated with wild oat (Avena fatua) over two seasons in greenhouse microcosms. Rhizosphere networks were substantially more complex than those in surrounding soils, indicating the rhizosphere has a greater potential for interactions and niche-sharing. Network complexity increased as plants grew, even as diversity decreased, highlighting that community organisation is not captured by univariate diversity. Covariations were predominantly positive (> 80%), suggesting that extensive mutualistic interactions may occur among rhizosphere bacteria; we identified quorum-based signalling as one potential strategy. Putative keystone taxa often had low relative abundances, suggesting low-abundance taxa may significantly contribute to rhizosphere function. Network complexity, a previously undescribed property of the rhizosphere microbiome, appears to be a defining characteristic of this habitat.

54 ENVIRONMENTAL SCIENCES↗

Multivariate and Multiscale Dependence in the Global Climate System Revealed Through Complex Networks

A systematic characterization of multivariate dependence at multiple spatio-temporal scales is critical to understanding climate system dynamics and improving predictive ability from models and data. However, dependence structures in climate are complex due to nonlinear dynamical generating processes, long-range spatial and long-memory temporal relationships, as well as low-frequency variability. Here we utilize complex networks to explore dependence in climate data. Specifically, networks constructed from reanalysis-based atmospheric variables over oceans and partitioned with community detection methods demonstrate the potential to capture regional and global dependence structures within and among climate variables. Proximity-based dependence as well as long-range spatial relationships are examined along with their evolution over time, yielding new insights on ocean meteorology. The tools are implicitly validated by confirming conceptual understanding about aggregate correlations and teleconnections. Our results also suggest a close similarity of observed dependence patterns in relative humidity and horizontal wind speed over oceans. In addition, updraft velocity, which relates to convective activity over the oceans, exhibits short spatiotemporal decorrelation scales but long-range dependence over time. The multivariate and multi-scale dependence patterns broadly persist over multiple time windows. Our findings motivate further investigations of dependence structures among observations, reanalysis and model-simulated data to enhance process understanding, assess model reliability and improve regional climate predictions.

54 ENVIRONMENTAL SCIENCES↗

Long-term nitrogen deposition enhances microbial capacities in soil carbon stabilization but reduces network complexity

Background: Anthropogenic activities have increased the inputs of atmospheric reactive nitrogen (N) into terrestrial ecosystems, affecting soil carbon stability and microbial communities. Previous studies have primarily examined the effects of nitrogen deposition on microbial taxonomy, enzymatic activities, and functional processes. Here, we examined various functional traits of soil microbial communities and how these traits are interrelated in a Mediterranean type grassland administrated with 14 years of 7 g m –2 year –1 of N amendment, based on estimated atmospheric N deposition in areas within California, USA, by the end of the twenty-first century. Results: Soil microbial communities were significantly altered by N deposition. Consistent with higher aboveground plant biomass and litter, fast-growing bacteria, assessed by abundance-weighted average rRNA operon copy number, were favored in N deposited soils. The relative abundances of genes associated with labile carbon (C) degradation (e.g., amyA and cda) were also increased. In contrast, the relative abundances of functional genes associated with the degradation of more recalcitrant C (e.g., mannanase and chitinase) were either unchanged or decreased. Compared with the ambient control, N deposition significantly reduced network complexity, such as average degree and connectedness. The network for N deposited samples contained only genes associated with C degradation, suggesting that C degradation genes became more intensely connected under N deposition. Conclusions: We propose a conceptual model to summarize the mechanisms of how changes in above- and belowground ecosystems by long-term N deposition collectively lead to more soil C accumulation.

59 BASIC BIOLOGICAL SCIENCES↗

Generative model selection using a scalable and size-independent complex network classifier

Real networks exhibit nontrivial topological features, such as heavy-tailed degree distribution, high clustering, and small-worldness. Researchers have developed several generative models for synthesizing artificial networks that are structurally similar to real networks. An important research problem is to identify the generative model that best fits to a target network. In this paper, we investigate this problem and our goal is to select the model that is able to generate graphs similar to a given network instance. By the means of generating synthetic networks with seven outstanding generative models, we have utilized machine learning methods to develop a decision tree for model selection. Our proposed method, which is named “Generative Model Selection for Complex Networks,” outperforms existing methods with respect to accuracy, scalability, and size-independence.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Analysis and Reduction of Complex Networks Under Uncertainty

This effort was a collaboration with Youssef Marzouk of MIT, Omar Knio of Duke University (at the time at Johns Hopkins University) and Habib Najm of Sandia National Laboratories. The objective of this effort was to develop the mathematical and algorithmic capacity to analyze complex networks under uncertainty. Of interest were chemical reaction networks and smart grid networks. The statements of work for USC focused on the development of stochastic reduced models for uncertain networks. The USC team was led by Professor Roger Ghanem and consisted of one graduate student and a postdoc. The contributions completed by the USC team consisted of 1) methodology and algorithms to address the eigenvalue problem, a problem of significance in the stability of networks under stochastic perturbations, 2) methodology and algorithms to characterize probability measures on graph structures with random flows. This is an important problem in characterizing random demand (encountered in smart grid) and random degradation (encountered in infrastructure systems), as well as modeling errors in Markov Chains (with ubiquitous relevance!). 3) methodology and algorithms for treating inequalities in uncertain systems. This is an important problem in the context of models for material failure and network flows under uncertainty where conditions of failure or flow are described in the form of inequalities between the state variables.

97 MATHEMATICS AND COMPUTING↗

Self-organized topology of recurrence-based complex networks

With the rapid technological advancement, network is almost everywhere in our daily life. Network theory leads to a new way to investigate the dynamics of complex systems. As a result, many methods are proposed to construct a network from nonlinear time series, including the partition of state space, visibility graph, nearest neighbors, and recurrence approaches. However, most previous works focus on deriving the adjacency matrix to represent the complex network and extract new network-theoretic measures. Although the adjacency matrix provides connectivity information of nodes and edges, the network geometry can take variable forms. The research objective of this article is to develop a self-organizing approach to derive the steady geometric structure of a network from the adjacency matrix. We simulate the recurrence network as a physical system by treating the edges as springs and the nodes as electrically charged particles. Then, force-directed algorithms are developed to automatically organize the network geometry by minimizing the system energy. Further, a set of experiments were designed to investigate important factors (i.e., dynamical systems, network construction methods, force-model parameter, nonhomogeneous distribution) affecting this self-organizing process. Interestingly, experimental results show that the self-organized geometry recovers the attractor of a dynamical system that produced the adjacency matrix. This research addresses a question, i.e., “what is the self-organizing geometry of a recurrence network?” and provides a new way to reproduce the attractor or time series from the recurrence plot. As a result, novel network-theoretic measures (e.g., average path length and proximity ratio) can be achieved based on actual node-to-node distances in the self-organized network topology. The paper brings the physical models into the recurrence analysis and discloses the spatial geometry of recurrence networks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Analysis and Reduction of Complex Networks Under Uncertainty

This is a collaborative proposal that aims at developing new methods for the analysis and reduction of complex multiscale networks under uncertainty. The approach is based on combining methods of computational singular perturbation (CSP) and probabilistic uncertainty quantification. In deterministic settings, CSP yields asymptotic approximations of reduced-dimensionality “slow manifolds” on which a multiscale dynamical system evolves. Introducing uncertainty raises fundamentally new issues, particularly concerning its impact on the topology of slow manifolds, and means to represent and quantify associated variability. To address these challenges, this project uses polynomial chaos (PC) methods to reformulate uncertain network models, and to analyze them using CSP in probabilistic terms. Specific objectives include (1) developing effective algorithms that can be used to illuminate fundamental and unexplored connections among model reduction, multiscale behavior, and uncertainty, and (2) demonstrating the performance of these algorithms through applications to model problems.

97 MATHEMATICS AND COMPUTING↗

To address surface reaction network complexity using scaling relations machine learning and DFT calculations

Surface reaction networks involving hydrocarbons exhibit enormous complexity with thousands of species and reactions for all but the very simplest of chemistries. We present a framework for optimization under uncertainty for heterogeneous catalysis reaction networks using surrogate models that are trained on the fly. The surrogate model is constructed by teaching a Gaussian process adsorption energies based on group additivity fingerprints, combined with transition-state scaling relations and a simple classifier for determining the rate-limiting step. The surrogate model is iteratively used to predict the most important reaction step to be calculated explicitly with computationally demanding electronic structure theory. Applying these methods to the reaction of syngas on rhodium(111), we identify the most likely reaction mechanism. Lastly, propagating uncertainty throughout this process yields the likelihood that the final mechanism is complete given measurements on only a subset of the entire network and uncertainty in the underlying density functional theory calculations.

97 MATHEMATICS AND COMPUTING↗

Program for Analyzing Flows in a Complex Network

Generalized Fluid System Simulation Program (GFSSP) version 4 is a general-purpose computer program for analyzing steady-state and transient flows in a complex fluid network. The program is capable of modeling compressibility, fluid transients (e.g., water hammers), phase changes, mixtures of chemical species, and such externally applied body forces as gravitational and centrifugal ones. A graphical user interface enables the user to interactively develop a simulation of a fluid network consisting of nodes and branches. The user can also run the simulation and view the results in the interface. The system of equations for conservation of mass, energy, chemical species, and momentum is solved numerically by a combination of the Newton-Raphson and successive-substitution methods.

Majumdar, Alok Kumar↗

RECOVERY ACT - Robust Optimization for Connectivity and Flows in Dynamic Complex Networks

The goal of this project was to study robust connectivity and flow patterns of complex multi-scale systems modeled as networks. Networks provide effective ways to study global, system level properties, as well as local, multi-scale interactions at a component level. Numerous applications from power systems, telecommunication, transportation, biology, social science, and other areas have benefited from novel network-based models and their analysis. Modeling and optimization techniques that employ appropriate measures of risk for identifying robust clusters and resilient network designs in networks subject to uncertain failures were investigated in this collaborative multi-university project. In many practical situations one has to deal with uncertainties associated with possible failures of network components, thereby affecting the overall efficiency and performance of the system (e.g., every node/connection has a probability of partial or complete failure). Some extreme examples include power grid component failures, airline hub failures due to weather, or freeway closures due to emergencies. These are also situations in which people, materials, or other resources need to be managed efficiently. Important practical examples include rerouting flow through power grids, adjusting flight plans, and identifying routes for emergency services and supplies, in the event network elements fail unexpectedly. Solutions that are robust under uncertainty, in addition to being economically efficient, are needed. This project has led to the development of novel models and methodologies that can tackle the optimization problems arising in such situations. A number of new concepts, which have not been previously applied in this setting, were investigated in the framework of the project. The results can potentially help decision-makers to better control and identify robust or risk-averse decisions in such situations. Formulations and optimal solutions of the considered problems need to capture uncertainty and risk using appropriate probabilistic, statistical and optimization concepts. The main difficulty arising in addressing these issues is the dramatic increase in the computational complexity of the resulting optimization problems. This project studied novel models and methodologies for risk-averse network optimization- specifically, network design, network flows and cluster detection problems under uncertainty. The approach taken was to incorporate a quantitative risk measure known as conditional value-at-risk that is widely used in financial applications. This approach presents a viable alternate modeling and optimization framework to chance-constrained optimization and mean-variance optimization, one that also facilitates the detection of risk-averse solutions.

97 MATHEMATICS AND COMPUTING↗

Examining Food Risk in the Large using a Complex, Networked System-of-sytems Approach

The food production infrastructure is a highly complex system of systems. Characterizing the risks of intentional contamination in multi-ingredient manufactured foods is extremely challenging because the risks depend on the vulnerabilities of food processing facilities and on the intricacies of the supply-distribution networks that link them. A pure engineering approach to modeling the system is impractical because of the overall system complexity and paucity of data. A methodology is needed to assess food contamination risk 'in the large', based on current, high-level information about manufacturing facilities, corrunodities and markets, that will indicate which food categories are most at risk of intentional contamination and warrant deeper analysis. The approach begins by decomposing the system for producing a multi-ingredient food into instances of two subsystem archetypes: (1) the relevant manufacturing and processing facilities, and (2) the networked corrunodity flows that link them to each other and consumers. Ingredient manufacturing subsystems are modeled as generic systems dynamics models with distributions of key parameters that span the configurations of real facilities. Networks representing the distribution systems are synthesized from general information about food corrunodities. This is done in a series of steps. First, probability networks representing the aggregated flows of food from manufacturers to wholesalers, retailers, other manufacturers, and direct consumers are inferred from high-level approximate information. This is followed by disaggregation of the general flows into flows connecting 'large' and 'small' categories of manufacturers, wholesalers, retailers, and consumers. Optimization methods are then used to determine the most likely network flows consistent with given data. Vulnerability can be assessed for a potential contamination point using a modified CARVER + Shock model. Once the facility and corrunodity flow models are instantiated, a risk consequence analysis can be performed by injecting contaminant at chosen points in the system and propagating the event through the overarching system to arrive at morbidity and mortality figures. A generic chocolate snack cake model, consisting of fluid milk, liquid eggs, and cocoa, is described as an intended proof of concept for multi-ingredient food systems. We aim for an eventual tool that can be used directly by policy makers and planners.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

Final Report. Analysis and Reduction of Complex Networks Under Uncertainty

The project was a collaborative effort among MIT, Sandia National Laboratories (local PI Dr. Habib Najm), the University of Southern California (local PI Prof. Roger Ghanem), and The Johns Hopkins University (local PI Prof. Omar Knio, now at Duke University). Our focus was the analysis and reduction of large-scale dynamical systems emerging from networks of interacting components. Such networks underlie myriad natural and engineered systems. Examples important to DOE include chemical models of energy conversion processes, and elements of national infrastructure—e.g., electric power grids. Time scales in chemical systems span orders of magnitude, while infrastructure networks feature both local and long-distance connectivity, with associated clusters of time scales. These systems also blend continuous and discrete behavior; examples include saturation phenomena in surface chemistry and catalysis, and switching in electrical networks. Reducing size and stiffness is essential to tractable and predictive simulation of these systems. Computational singular perturbation (CSP) has been effectively used to identify and decouple dynamics at disparate time scales in chemical systems, allowing reduction of model complexity and stiffness. In realistic settings, however, model reduction must contend with uncertainties, which are often greatest in large-scale systems most in need of reduction. Uncertainty is not limited to parameters; one must also address structural uncertainties—e.g., whether a link is present in a network—and the impact of random perturbations, e.g., fluctuating loads or sources. Research under this project developed new methods for the analysis and reduction of complex multiscale networks under uncertainty, by combining computational singular perturbation (CSP) with probabilistic uncertainty quantification. CSP yields asymptotic approximations of reduceddimensionality “slow manifolds” on which a multiscale dynamical system evolves. Introducing uncertainty in this context raised fundamentally new issues, e.g., how is the topology of slow manifolds transformed by parametric uncertainty? How to construct dynamical models on these uncertain manifolds? To address these questions, we used stochastic spectral polynomial chaos (PC) methods to reformulate uncertain network models and analyzed them using CSP in probabilistic terms. Finding uncertain manifolds involved the solution of stochastic eigenvalue problems, facilitated by projection onto PC bases. These problems motivated us to explore the spectral properties stochastic Galerkin systems. We also introduced novel methods for rank-reduction in stochastic eigensystems—transformations of a uncertain dynamical system that lead to lower storage and solution complexity. These technical accomplishments are detailed below. This report focuses on the MIT portion of the joint project.

97 MATHEMATICS AND COMPUTING↗

Two 3D network complexes of Y(III) and Ce(III) with 2-fold interpenetration and reversible desorption-adsorption behavior of lattice water

Two novel inorganic-organic 3D network, namely{l_brace}[Ln(L){sub 1.5}(H{sub 2}O){sub 2}].5H{sub 2}O{r_brace}n [Ln=Y (1), Ce (2); Ln(L){sub 1.5}(H{sub 2}O){sub 2}].5H{sub 2}O [Ln=Y (1), Ce (2)], have been prepared through the assembly of the ligand 1,2-bis[3-(1,2,4-triazolyl)-4-amino-5-carboxylmethylthio]ethane (H{sub 2}L) and lanthanide (III) salts under hydrothermal condition and structurally characterized by single-crystal X-ray diffractions. In complexes 1 and 2, the L{sup 2-} anions adopt three different coordination fashions (bidentate chelate, bidentate bridging and bidentate chelate bridging) connecting Ln(III) ions via the oxygen atoms from carboxylate moieties. Both 1 and 2 exhibit 3D network structures with 2-fold interpenetration. Interestingly, the reversible desorption-adsorption behavior of lattice water is significantly observed in the two compounds. The result shows their potential application as late-model water absorbent in the field of adsorption material. - Graphical abstract: Two inorganic-organic 3D network, namely {l_brace}[Ln(L){sub 1.5}(H{sub 2}O){sub 2}].5H{sub 2}O{r_brace}n [Ln=Y (1), Ce (2)], have been prepared under hydrothermal condition and structurally characterized by single-crystal X-ray diffractions. Both 1 and 2 exhibit 3D network structures with 2-fold interpenetration. Interestingly, the reversible desorption-adsorption behavior of lattice water is significantly observed in the two compounds. The result shows their potential application as late-model water absorbent in the field of adsorption material.

36 MATERIALS SCIENCE↗

Probabilistic Discrete‐Time Models for Spreading Processes in Complex Networks: A Review

Abstract Research into network dynamics of spreading processes typically employs both discrete and continuous time methodologies. Although each approach offers distinct insights, integrating them can be challenging, particularly when maintaining coherence across different time scales. This review focuses on the Microscopic Markov Chain Approach (MMCA), a probabilistic f ramework originally designed for epidemic modeling. MMCA uses discrete dynamics to compute the probabilities of individuals transitioning between epidemiological states. By treating each time step—usually a day—as a discrete event, the approach captures multiple concurrent changes within this time frame. The approach allows to estimate the likelihood of individuals or populations being in specific states, which correspond to distinct epidemiological compartments. This review synthesizes key findings from the application of this approach, providing a comprehensive overview of its utility in understanding epidemic spread.

Granell, Clara↗