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 73 records · Page 4

Response of complex networks to compression: Ca, La, and Y aluminoborosilicate glasses formed from liquids at 1 to 3 GPa pressures

Aluminoborosilicate glasses containing relatively high field strength modifiers (Ca, La, and Y) have been compressed at pressures up to 3 GPa and near the glass transition temperature (T{sub g}) and quenched to room temperature at high pressure followed by decompression. Structural changes were quantified with high-resolution {sup 27}Al and {sup 11}B MAS nuclear magnetic resonance at 14.1–18.8 T. The changes with pressure in Al and B coordinations in the recovered samples are quite large with more than 50% decreases in tetrahedral aluminum ({sup IV}Al) and 200%-300% increases in tetrahedral boron ({sup IV}B). Glasses with higher field strength modifiers (La and Y) contain more high coordinated aluminum ({sup V,V} {sup I}Al) at all pressures studied. More high coordinated boron also correlates with higher field strength modifier if all three compositions are compared on an isothermal basis. Although lowering fictive temperature and increasing pressure both increase Al and B coordinations, our study shows that the actual mechanisms for structural changes are most probably different for temperature and pressure effects. Using a rough thermodynamic model to extrapolate to higher pressures, it appears that a simple non-bridging oxygen (NBO) consumption mechanism is not sufficient to convert all the aluminum to octahedral and boron to tetrahedral coordination, suggesting other mechanisms for structural changes could occur at high pressure as NBO becomes depleted.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Detecting hidden layers from spreading dynamics on complex networks

When dealing with spreading processes on networks it can be of the utmost importance to test the reliability of data and identify potential unobserved spreading paths. In this paper we address these problems and propose methods for hidden layer identification and reconstruction. We also explore the interplay between difficulty of the task and the structure of the multilayer network describing the whole system where the spreading process occurs. Our methods stem from an exact expression for the likelihood of a cascade in the susceptible-infected model on an arbitrary graph. We then show that by imploring statistical properties of unimodal distributions and simple heuristics describing joint likelihood of a series of cascades one can obtain an estimate of both existence of a hidden layer and its content with success rates far exceeding those of a null model. Furthermore, we conduct our analyses on both synthetic and real-world networks providing evidence for the viability of the approach presented.

97 MATHEMATICS AND COMPUTING↗

Anomalous physical transport in complex networks

The emergence of scaling in transport through interconnected systems is a consequence of the topological structure of the network and the physical mechanisms underlying the transport dynamics. We study here transport by advection and diffusion in scale-free and Erdös-Rényi networks. Velocity distributions derived from a flow potential exhibit power-law scaling with exponent ${\nu}{\approx}{\gamma}+1$, where ${\gamma}$ is the exponent of network connectivity. Using stochastic particle simulations, we find anomalous (nonlinear) scaling of the mean-square displacement with time. We show the connection with existing descriptions of anomalous transport in disordered systems, and explain the mean transport behavior from the coupled nature of particle jump lengths and transition times.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Disruption-Robust Community Detection Using Consensus Clustering in Complex Networks

Topological (graph-theoretic) analysis of critical infrastructure networks provides insight on several aspects of resilience. Graph clustering or community detection, which identifies densely connected components in a graph, has been employed for analysis. In this paper, we propose employing consensus clustering, which is a technique to determine consensus from a collection of different clusters on an input, such that the resulting clustering is robust to disruptions, where a disruption is represented as loss of one or more vertices or edges in the graph. Using two critical infrastructure networks as case studies, we empirically demonstrate the need to compute consensus clustering in order to address the drastic changes in the topology due to disruptions in the network.

Hussain, Md Taufique↗

Self-organization of a critical state on complex networks

The critical dynamics of a two-threshold system with the law of conservation of the basic quantity z and in the absence of sink on a scale-free network has been studied. It has been shown that the critical state that is a set of metastable states appears in such a system. The structure of the metastable states is a set of stable clusters of nodes at which the z values are close to the positive and negative threshold values. Avalanches transforming the system from one metastable state to another state appear in the system. The absence of sink is effectively replaced by the annihilation process. The statistics of avalanches in such a system has been analyzed. It has been shown that the self-organized critical state can appear in the system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The Graph Laplacian and the Dynamics of Complex Networks [Slides]

In this talk, we explore the structure of networks from a spectral graph-theoretic perspective by analyzing the properties of the Laplacian matrix associated with the graph induced by a network. We will see how the eigenvalues of the graph Laplacian relate to the underlying network structure and dynamics and provides insight into a phenomenon frequently observed in real world networks - the emergence of collective behavior from purely local interactions seen in the coordinated motion of animals and phase transitions in biological networks, to name a few.

97 MATHEMATICS AND COMPUTING↗

Benchmarking Adiabatic Quantum Optimization for Complex Network Analysis

We lay the foundation for a benchmarking methodology for assessing current and future quantum computers. We pose and begin addressing fundamental questions about how to fairly compare computational devices at vastly different stages of technological maturity. We critically evaluate and offer our own contributions to current quantum benchmarking efforts, in particular those involving adiabatic quantum computation and the Adiabatic Quantum Optimizers produced by D-Wave Systems, Inc. We find that the performance of D-Wave's Adiabatic Quantum Optimizers scales roughly on par with classical approaches for some hard combinatorial optimization problems; however, architectural limitations of D-Wave devices present a significant hurdle in evaluating real-world applications. In addition to identifying and isolating such limitations, we develop algorithmic tools for circumventing these limitations on future D-Wave devices, assuming they continue to grow and mature at an exponential rate for the next several years.

97 MATHEMATICS AND COMPUTING↗

Quantifying Spatial Drought Propagation Potential in North America Using Complex Network Theory

Droughts have a dominant three-dimensional (3-D) spatiotemporal structure typically spanning hundreds of kilometers and often lasting for months to years. Here, we introduced a novel framework to explore the 3-D structure of the evolution of droughts based on network theory concepts. The proposed framework is applied to identify critical source regions responsible for large-scale drought onsets during 1901–2014 for the North American continent using the Standardized Precipitation Evaporation Index (SPEI). We built a spatial network connecting the drought onset timings for the North American continent. Using a spatially weighted network partitioning algorithm, the whole continent is then classified into regional spatial drought networks (RSN), where droughts are more likely to propagate within these regional systems. Finally, a customized network metric was applied to identify locations (source regions) where the drought onsets further propagate to other areas within the regional spatial network. Our results indicated that the West coast, Texas coastal region, and Southeastern Arkansas as major source regions through which atmospheric drought propagates to Western, South Central, and Eastern North America. The formation of drought source regions are due to presence of high pressure ridges and anomalous wind patterns. Furthermore, our results indicate that the drought propagation from these source regions may be due to inadequate moisture transport. The proposed framework can help to develop an early warning detection system for droughts and other spatially extensive extreme events such as heatwaves and floods.

Goutam Konapala↗

Unveiling the hidden structure of complex stochastic biochemical networks

Complex Markov models are widely used and powerful predictive tools to analyze stochastic biochemical processes. However, when the network of states is unknown, it is necessary to extract information from the data to partially build the network and estimate the values of the rates. The short-time behavior of the first-passage time distributions between two states in linear chains has been shown recently to behave as a power of time with an exponent equal to the number of intermediate states. For a general Markov model we derive the complete Taylor expansion of the first-passage time distribution between two arbitrary states. By combining algebraic methods and graph theory approaches it is shown that the first term of the Taylor expansion is determined by the shortest path from the initial state to the final state. When this path is unique, we prove that the coefficient of the first term can be written in terms of the product of the transition rates along the path. It is argued that the application of our results to first-return times may be used to estimate the dependence of rates on external parameters in experimentally measured time distributions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimizing Topological Cascade Resilience Based on the Structure of Terrorist Networks

Complex socioeconomic networks such as information, finance and even terrorist networks need resilience to cascades - to prevent the failure of a single node from causing a far-reaching domino effect. We show that terrorist and guerrilla networks are uniquely cascade-resilient while maintaining high efficiency, but they become more vulnerable beyond a certain threshold. We also introduce an optimization method for constructing networks with high passive cascade resilience. The optimal networks are found to be based on cells, where each cell has a star topology. Counterintuitively, we find that there are conditions where networks should not be modified to stop cascades because doing so would come at a disproportionate loss of efficiency. Implementation of these findings can lead to more cascade-resilient networks in many diverse areas.

97 MATHEMATICS AND COMPUTING↗