Search NASA⌕ Search

SEARCH · Search NASA

Results for “Graph Neural 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 163 records · Page 9

Thermodynamic Modeling of Complex Solid Solutions in the Lu-H-N System via Graph Neural Network Accelerated Monte Carlo Simulations

Metal hydrides are important across diverse applications, such as hydrogen storage, batteries, gas sensors, nuclear reactions, and high-temperature superconductivity. Previous computational studies of metal hydrides under extreme pressures, e.g., 𝑂⁡(10 2 ) ⁢GPa, usually treat them as stoichiometric compounds without considering interstitial lattice disorder. As pressures become more moderate in the 𝑂⁡(10 0 ) ⁢GPa and below range, hydrogen disorder at interstitial lattice sites becomes prominent, e.g., in the N-doped Lu hydride that was recently claimed superconducting near 1 GPa. Further adding compositional complexity from alloying and/or multielement interstitial occupation makes elucidating pressure- and temperature-dependent observables intractable by first-principles calculations alone. We therefore propose a lattice graph neural-network surrogate modeling approach to predict configuration- and pressure-dependent equation-of-state properties. Their efficiency permits Monte Carlo simulations to calculate Gibbs energies and pressure-dependent phase diagrams, thereby revealing insights into the synthesis conditions required for achieving desired phase equilibria. We demonstrate this concept for the compositionally complex cubic Lu(H,N,Va) 3 system where three constituents (hydrogen, nitrogen and vacancy) have disordered multielement interstitial occupancies and insights into pressure-dependent phase equilibria are critically needed, e.g., N-doping levels can significantly lower dehydrogenation temperatures and provide a new strategy to optimize hydrogen-storage alloys. This work can improve the thermodynamic understanding of the Lu-H-N system and help rational synthesis of N-doped Lu hydrides, but more generally demonstrates an efficient approach to model pressure-dependent thermodynamics of multicomponent solid solutions.

Monte Carlo methods↗

Contributions of vegetation heterogeneity within tower footprint to CO 2 flux estimations through graph neural network modeling

Net ecosystem exchange of CO 2 (Fc) measured directly by eddy covariance towers is based on various assumptions, including large, flat and homogenous land cover type. In reality, often a tower site is not large enough for flux measurements, and landscapes consist of patches of different land cover types within the flux footprint. In addition, some portions of fluxes are contributed by different cover types when a footprint exceeds the size of the target ecosystem. The contributions of non-dominant patches to Fc are often ignored. Here, in this study, we propose a novel integrated modeling framework that combines random forest (RF) and XGBoost with a residual correction module based on a deep graph convolutional network (DeeperGCN) to simulate Fc for seven flux measurement sites in southwest Michigan. High-resolution remote sensing vegetation indices, soil properties, meteorological variables, and footprint-weighted spatial features were used as model inputs at three spatial resolutions (10 m, 20 m, 30 m), and their importance in predicting Fc with DeeperGCN was assessed. We found that residual correction using DeeperGCN significantly improved prediction accuracy, with the R 2 increasing from 0.9098 to 0.9479 for RF and from 0.9235 to 0.9433 for XGBoost. At site level, the maximum improvement in R 2 reached 0.1617. Paired t-tests confirmed that these improvements were statistically significant (p < 0.05). Among all predictors, leaf area index and incoming shortwave radiation emerged as the dominant drivers of spatial residual variation, followed by precipitation, relative humidity, and selected vegetation indices. The 20 m resolution yielded the best balance between model performance and computational efficiency. In conclusion, our modeling framework effectively captures both spatial heterogeneity and nonlinear interactions, offering a robust solution for spatially explicit flux modeling in structurally diverse ecosystems beyond the study sites.

footprint model↗

A Unification Framework for Euclidean and Hyperbolic Graph Neural Networks

Hyperbolic neural networks have recently gained significant attention due to their promising results on several graph problems including node classification and link prediction. The primary reason for this success is the effectiveness of hyperbolic space in capturing the inherent hierarchy of graph datasets. However, they are limited in terms of generalization, scalability, and have inferior performance when applied to non-hierarchical datasets. In this paper, we take a completely different perspective for modeling hyperbolic networks and answer the following question: is an Euclidean model able to approximate a function or behavior in the hyperbolic space? Extending the universal approximation theory developed for Euclidean models, We draw an analogy from the hyperbolic components to the Euclidean counterparts and conclude that, in order to capture hierarchical features, it is possible to generalize hyperbolic models to be a special case of Euclidean models with the proposed Pseudo-Poincaré technique. We applied our non-linear hyperbolic normalization to the current state-of-the-art homogeneous and multi-relational graph networks and demonstrate significant improvements in performance compared to both Euclidean and hyperbolic counterparts. The primary impact of this work lies in its ability to capture hierarchical features in the Euclidean space, and thus, can replace hyperbolic networks without any loss in performance metrics while simultaneously leveraging the power of Euclidean networks such as interpretability and efficient execution of various model components.

Khatir, Mehrdad↗

Physics-Informed Graph Neural Networks for Collaborative Dynamic Reconfiguration and Voltage Regulation in Unbalanced Distribution Systems

Network reconfiguration has long been employed as a strategic approach to minimize power distribution system losses and effectively regulate voltage levels. Tap-changing voltage regulators are also critical for controlling bus voltages, especially in accommodating the increasing integration of distributed energy resources (DERs) with intermittent outputs. This paper introduces novel methodologies to address the challenges of dynamic reconfiguration and optimal tap setting in unbalanced three-phase distribution systems. We propose an approximated mixed-integer quadratically constrained program (MIQCP) to model dynamic reconfiguration, along with a pioneering formulation for voltage regulator (VR) tap-setting based on Special Ordered Set type 1 (SOS1). To mitigate computational complexity, we propose a physics-informed spatial-temporal graph convolutional network (STGCN) with an integrated link classifier. The proposed approach enables efficient solution generation by fixing specific variables in the MIQCP instance and solving the simplified sub-MIP using an MIP solver. Numerical studies demonstrate the superior prediction accuracy of our STGCN model compared to baseline neural network models, resulting in reduced DER curtailment and voltage deviation with shorter computation time.

dynamic reconfiguration↗

Uncovering dark matter density profiles in dwarf galaxies with graph neural networks

Dwarf galaxies are small, dark-matter-dominated galaxies, some of which are embedded within the Milky Way. Their lack of baryonic matter (e.g., stars and gas) makes them perfect test beds for probing the properties of dark matter—understanding the spatial dark matter distribution in these systems can be used to constrain microphysical dark matter interactions that influence the formation and evolution of structures in our Universe. Here, we introduce a new method that leverages simulation-based inference and graph-based machine learning in order to infer the dark matter density profiles of dwarf galaxies from observable kinematics of stars gravitationally bound to these systems. Our approach aims to address some of the limitations of established methods based on dynamical Jeans modeling. We show that this novel method can place stronger constraints on dark matter profiles and, consequently, has the potential to weigh in on some of the ongoing puzzles associated with the small-scale structure of dark matter halos, such as the core-cusp discrepancy.

79 ASTRONOMY AND ASTROPHYSICS↗