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 37 records · Page 2

Pinning impulsive control algorithms for complex network

In this paper, we further investigate the synchronization of complex dynamical network via pinning control in which a selection of nodes are controlled at discrete times. Different from most existing work, the pinning control algorithms utilize only the impulsive signals at discrete time instants, which may greatly improve the communication channel efficiency and reduce control cost. Two classes of algorithms are designed, one for strongly connected complex network and another for non-strongly connected complex network. It is suggested that in the strongly connected network with suitable coupling strength, a single controller at any one of the network's nodes can always pin the network to its homogeneous solution. In the non-strongly connected case, the location and minimum number of nodes needed to pin the network are determined by the Frobenius normal form of the coupling matrix. In addition, the coupling matrix is not necessarily symmetric or irreducible. Illustrative examples are then given to validate the proposed pinning impulsive control algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Deformable complex network for refining low-resolution X-ray structures

A new refinement algorithm called the deformable complex network that combines a novel angular network-based restraint with a deformable elastic network model in the target function has been developed to aid in structural refinement in macromolecular X-ray crystallography. In macromolecular X-ray crystallography, building more accurate atomic models based on lower resolution experimental diffraction data remains a great challenge. Previous studies have used a deformable elastic network (DEN) model to aid in low-resolution structural refinement. In this study, the development of a new refinement algorithm called the deformable complex network (DCN) is reported that combines a novel angular network-based restraint with the DEN model in the target function. Testing of DCN on a wide range of low-resolution structures demonstrated that it constantly leads to significantly improved structural models as judged by multiple refinement criteria, thus representing a new effective refinement tool for low-resolution structural determination.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Petroleum pollution changes microbial diversity and network complexity of soil profile in an oil refinery

Petroleum pollution resulting from spills and leakages in oil refinery areas has been a significant environmental concern for decades. Despite this, the effects of petroleum pollutants on soil microbial communities and their potential for pollutant biodegradation still required further investigation. In this study, we collected 75 soil samples from 0 to 5 m depths of 15 soil profiles in an abandoned refinery to analyze the effect of petroleum pollution on soil microbial diversity, community structure, and network co-occurrence patterns. Our results suggested soil microbial a-diversity decreased under high C10–C40 levels, coupled with significant changes in the community structure of soil profiles. However, soil microbial network complexity increased with petroleum pollution levels, suggesting more complex microbial potential interactions. A module specific for methane and methyl oxidation was also found under high C10–C40 levels of the soil profile, indicating stronger methanotrophic and methylotrophic metabolic activities at the heavily polluted soil profile. The increased network complexity observed may be due to more metabolic pathways and processes, as well as increased microbial interactions during these processes. These findings highlight the importance of considering both microbial diversity and network complexity in assessing the effects of petroleum pollution on soil ecosystems.

59 BASIC BIOLOGICAL SCIENCES↗

Robust and non-fragile finite time H{sub ∞} synchronization control for complex networks with uncertain inner coupling

This paper addresses robust finite time H{sub ∞} synchronization problem for non-fragile complex networks with uncertain inner coupling. In order to achieve synchronization, a non-fragile controller subjected to randomly occurring perturbations will be considered. By constructing a suitable Lyapunov–Krasovskii functional and utilizing reciprocally convex approach, the criteria for the networks are established in terms of linear matrix inequalities (LMIs). Theoretical analysis and numerical simulations about robust finite time H{sub ∞} synchronization for uncertain inner coupling complex networks are presented.

97 MATHEMATICS AND COMPUTING↗

Accelerating the Mining of Influential Nodes in Complex Networks through Community Detection

Computing the set of influential nodes with a given size to ensure maximal spread of influence on a complex network is a challenging problem impacting multiple applications. A rigorous approach to influence maximization involves utilization of optimization routines that comes with a high computational cost. In this work, we propose to exploit the existence of communities in complex networks to accelerate the mining of influential seeds. We provide intuitive reasoning to explain why our approach should be able to provide speedups without significantly degrading the extent of the spread of influence when compared to the case of influence maximization without using the community information. Additionally, we have parallelized the complete workflow by leveraging an existing parallel implementation of the Louvain community detection algorithm. We then conduct a series of experiments on a dataset with three representative graphs to first verify our implementation and then demonstrate the speedups. Our method achieves speedups ranging from 3x - 28x for graphs with small number of communities while nearly matching or even exceeding the activation performance on the entire graph. Complexity analysis reveals that dramatic speedups are possible for larger graphs that contain a correspondingly larger number of communities. In addition to the speedups obtained from the utilization of the community structure, scalability results show up to 6.3x speedup on 20 cores relative to the baseline run on 2 cores. Finally, current limitations of the approach are outlined along with the planned next steps.

community detection↗

Complex network approach to fractional time series

In order to extract correlation information inherited in stochastic time series, the visibility graph algorithm has been recently proposed, by which a time series can be mapped onto a complex network. We demonstrate that the visibility algorithm is not an appropriate one to study the correlation aspects of a time series. We then employ the horizontal visibility algorithm, as a much simpler one, to map fractional processes onto complex networks. The degree distributions are shown to have parabolic exponential forms with Hurst dependent fitting parameter. Further, we take into account other topological properties such as maximum eigenvalue of the adjacency matrix and the degree assortativity, and show that such topological quantities can also be used to predict the Hurst exponent, with an exception for anti-persistent fractional Gaussian noises. To solve this problem, we take into account the Spearman correlation coefficient between nodes' degrees and their corresponding data values in the original time series.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Complex networks as a unified framework for descriptive analysis and predictive modeling in climate

The analysis of climate data has relied heavily on hypothesis-driven statistical methods, while projections of future climate are based primarily on physics-based computational models. However, in recent years a wealth of new datasets has become available. Therefore, we take a more data-centric approach and propose a unified framework for studying climate, with an aim towards characterizing observed phenomena as well as discovering new knowledge in the climate domain. Specifically, we posit that complex networks are well-suited for both descriptive analysis and predictive modeling tasks. We show that the structural properties of climate networks have useful interpretation within the domain. Further, we extract clusters from these networks and demonstrate their predictive power as climate indices. Our experimental results establish that the network clusters are statistically significantly better predictors than clusters derived using a more traditional clustering approach. Using complex networks as data representation thus enables the unique opportunity for descriptive and predictive modeling to inform each other.

99 GENERAL AND MISCELLANEOUS↗

Evaluation of global teleconnections in CMIP6 climate projections using complex networks

In climatological research, the evaluation of climate models is one of the central research subjects. As an expression of large-scale dynamical processes, global teleconnections play a major role in interannual to decadal climate variability. Their realistic representation is an indispensable requirement for the simulation of climate change, both natural and anthropogenic. Therefore, the evaluation of global teleconnections is of utmost importance when assessing the physical plausibility of climate projections. We present an application of the graph-theoretical analysis tool δ-MAPS, which constructs complex networks on the basis of spatio-temporal gridded data sets, here sea surface temperature and geopotential height at 500 hPa. Complex networks complement more traditional methods in the analysis of climate variability, like the classification of circulation regimes or empirical orthogonal functions, assuming a new non-linear perspective. While doing so, a number of technical tools and metrics, borrowed from different fields of data science, are implemented into the δ-MAPS framework in order to overcome specific challenges posed by our target problem. Those are trend empirical orthogonal functions (EOFs), distance correlation and distance multicorrelation, and the structural similarity index. δ-MAPS is a two-stage algorithm. In the first place, it assembles grid cells with highly coherent temporal evolution into so-called domains. In a second step, the teleconnections between the domains are inferred by means of the non-linear distance correlation. We construct 2 unipartite and 1 bipartite network for 22 historical CMIP6 climate projections and 2 century-long coupled reanalyses (CERA-20C and 20CRv3). Potential non-stationarity is taken into account by the use of moving time windows. The networks derived from projection data are compared to those from reanalyses. Our results indicate that no single climate projection outperforms all others in every aspect of the evaluation. But there are indeed models which tend to perform better/worse in many aspects. Differences in model performance are generally low within the geopotential height unipartite networks but higher in sea surface temperature and most pronounced in the bipartite network representing the interaction between ocean and atmosphere.

58 GEOSCIENCES↗

Quantifying networks complexity from information geometry viewpoint

We consider a Gaussian statistical model whose parameter space is given by the variances of random variables. Underlying this model we identify networks by interpreting random variables as sitting on vertices and their correlations as weighted edges among vertices. We then associate to the parameter space a statistical manifold endowed with a Riemannian metric structure (that of Fisher-Rao). Going on, in analogy with the microcanonical definition of entropy in Statistical Mechanics, we introduce an entropic measure of networks complexity. We prove that it is invariant under networks isomorphism. Above all, considering networks as simplicial complexes, we evaluate this entropy on simplexes and find that it monotonically increases with their dimension.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Small-world complex network generation on a digital quantum processor

Abstract Quantum cellular automata (QCA) evolve qubits in a quantum circuit depending only on the states of their neighborhoods and model how rich physical complexity can emerge from a simple set of underlying dynamical rules. The inability of classical computers to simulate large quantum systems hinders the elucidation of quantum cellular automata, but quantum computers offer an ideal simulation platform. Here, we experimentally realize QCA on a digital quantum processor, simulating a one-dimensional Goldilocks rule on chains of up to 23 superconducting qubits. We calculate calibrated and error-mitigated population dynamics and complex network measures, which indicate the formation of small-world mutual information networks. These networks decohere at fixed circuit depth independent of system size, the largest of which corresponding to 1,056 two-qubit gates. Such computations may enable the employment of QCA in applications like the simulation of strongly-correlated matter or beyond-classical computational demonstrations.

97 MATHEMATICS AND COMPUTING↗

Quantum walks on complex networks with connection instabilities and community structure

A continuous-time quantum walk is investigated on complex networks with the characteristic property of community structure, which is shared by most real-world networks. Motivated by the prospect of viable quantum networks, I focus on the effects of network instabilities in the form of broken links, and examine the response of the quantum walk to such failures. It is shown that the reconfiguration of the quantum walk is determined by the community structure of the network. In this context, quantum walks based on the adjacency and Laplacian matrices of the network are compared, and their responses to link failures is analyzed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Complex Network Analysis and Intelligent Monitoring Platform

Data Products has particular interest in developing an efficient network analysis and monitoring system that utilizes advanced machine learning methods to mine complex network data of the type generated within large data centers, with an objective to provide tangible business-usable intelligence. The Laboratory is currently the lead institution for a U.S. Department of Energy Office of Science (DOE/SC) network research project called BigData Express (BDE). The project seeks to provide an orchestration service for high-performance data movement of data sets for large-scale science. This collaboration is believed to potentially be a highly symbiotic one, with Data Products platform development benefiting from the rich sets of network data available in the BDE development environment, and BDE benefiting from the Data Products machine learning analysis of BDE-generated data movement.

97 MATHEMATICS AND COMPUTING↗

Supercritical fluids behave as complex networks

Abstract Supercritical fluids play a key role in environmental, geological, and celestial processes, and are of great importance to many scientific and engineering applications. They exhibit strong variations in thermodynamic response functions, which has been hypothesized to stem from the microstructural behavior. However, a direct connection between thermodynamic conditions and the microstructural behavior, as described by molecular clusters, remains an outstanding issue. By utilizing a first-principles-based criterion and self-similarity analysis, we identify energetically localized molecular clusters whose size distribution and connectivity exhibit self-similarity in the extended supercritical phase space. We show that the structural response of these clusters follows a complex network behavior whose dynamics arises from the energetics of isotropic molecular interactions. Furthermore, we demonstrate that a hidden variable network model can accurately describe the structural and dynamical response of supercritical fluids. These results highlight the need for constitutive models and provide a basis to relate the fluid microstructure to thermodynamic response functions.

42 ENGINEERING↗

Dynamic interactions of proteins in complex networks

Recent advances in techniques such as NMR and EPR spectroscopy have enabled the elucidation of how proteins undergo structural changes to act in concert in complex networks. The three minireviews in this series highlight current findings and the capabilities of new methodologies for unraveling the dynamic changes controlling diverse cellular functions. They represent a sampling of the cutting-edge research presented at the 17th Meeting of Methods in Protein Structure Analysis, MPSA2008, in Sapporo, Japan, 26-29 August, 2008 (http://www.iapsap.bnl.gov). The first minireview, by Christensen and Klevit, reports on a structure-based yeast two-hybrid method for identifying E2 ubiquitin-conjugating enzymes that interact with the E3 BRCA1/BARD1 heterodimer ligase to generate either mono- or polyubiquitinated products. This method demonstrated for the first time that the BRCA1/BARD1 E3 can interact with 10 different E2 enzymes. Interestingly, the interaction with multiple E2 enzymes displayed unique ubiquitin-transfer properties, a feature expected to be common among other RING and U-box E3s. Further characterization of new E3 ligases and the E2 enzymes that interact with them will greatly enhance our understanding of ubiquitin transfer and facilitate studies of roles of ubiquitin and ubiquitin-like proteins in protein processing and trafficking. Stein et al., in the second minireview, describe recent progress in defining the binding specificity of different peptide-binding domains. The authors clearly point out that transient peptide interactions mediated by both post-translational modifications and disordered regions ensure a high level of specificity. They postulate that a regulatory code may dictate the number of combinations of domains and post-translational modifications needed to achieve the required level of interaction specificity. Moreover, recognition alone is not enough to obtain a stable complex, especially in a complex cellular environment. Increasing evidence indicates that disordered domains can acquire structural features that modulate the binding and strength of the signaling cascade. Whereas the first two minireviews describe ways in which protein interactions are modulated, the third, by Tompa, focuses on the importance of protein disorder in a subset of amyloid proteins. It is apparent that within this group, part of the polypeptide chain remains disordered during amyloid formation. Moreover, the disordered segments have different amino acid composition and physicochemical characteristics, which suggests that they may play a role in amyloid stability. The disordered region may serve as a linker to connect the ordered core and a globular domain, maintaining the stability and structure of the globular domain and minimizing protein refolding upon amyloid formation. As techniques in protein chemistry advance, we are learning more and more about the mechanisms that regulate and are regulated by protein interactions. The three minireviews in this series offer a glimpse of the complex dynamics fundamental to protein-protein interactions. In the future, we expect that the knowledge gained will help to augment our ability to control complex pathologies and treat diverse diseases states.

59 BASIC BIOLOGICAL SCIENCES↗

Plant terpene specialized metabolism: complex networks or simple linear pathways?

From the perspectives of pathway evolution, discovery and engineering of plant specialized metabolism, the nature of the biosynthetic routes represents a critical aspect. Classical models depict biosynthesis typically from an end-point angle and as linear, for example, connecting central and specialized metabolism. As the number of functionally elucidated routes increased, the enzymatic foundation of complex plant chemistries became increasingly well understood. The perception of linear pathway models has been severely challenged. With a focus on plant terpenoid specialized metabolism, we review here illustrative examples supporting that plants have evolved complex networks driving chemical diversification. The completion of several diterpene, sesquiterpene and monoterpene routes shows complex formation of scaffolds and their subsequent functionalization. These networks show that branch points, including multiple sub-routes, mean that metabolic grids are the rule rather than the exception. This concept presents significant implications for biotechnological production.

60 APPLIED LIFE SCIENCES↗

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↗