Search NASA⌕ Search

SEARCH · Search NASA

Results for “network evolution”

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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Causality-respecting adaptive refinement for PINNs: enabling precise interface evolution in phase field modeling

Physics-informed neural networks (PINNs) have emerged as a powerful tool for solving physical systems described by partial differential equations (PDEs). However, their accuracy in dynamical systems, particularly those involving sharp moving boundaries with complex initial morphologies, remains a challenge. Here, this study introduces an approach combining residual-based adaptive refinement (RBAR) with causality-informed training to enhance the performance of PINNs in solving spatio-temporal PDEs. Our method employs a three-step iterative process: initial causality-based training, RBAR-guided domain refinement, and subsequent causality training on the refined mesh. Applied to the Allen-Cahn equation, a widely-used model in phase field simulations, our approach demonstrates significant improvements in solution accuracy and computational efficiency over traditional PINNs. Notably, we observe an ‘overshoot and relocate’ phenomenon in dynamic cases with complex morphologies, showcasing the method’s adaptive error correction capabilities. This synergistic interaction between RBAR and causality training enables accurate capture of interface evolution, even in challenging scenarios where traditional PINNs fail. Our framework not only resolves the limitations of uniform refinement strategies but also provides a generalizable methodology for solving a broad range of spatio-temporal PDEs. The enhanced performance of the RBAR–causality combined framework demonstrates its strong potential for advancing PINN-based modeling of physical systems characterized by complex, evolving interfaces.

Allen-Cahn equations↗
DOE OSTI2022

Phylogenetic structure of specialization: A new approach that integrates partner availability and phylogenetic diversity to quantify biotic specialization in ecological networks

Abstract Biotic specialization holds information about the assembly, evolution, and stability of biological communities. Partner availabilities can play an important role in enabling species interactions, where uneven partner availabilities can bias estimates of biotic specialization when using phylogenetic diversity indices. It is therefore important to account for partner availability when characterizing biotic specialization using phylogenies. We developed an index, phylogenetic structure of specialization (PSS), that avoids bias from uneven partner availabilities by uncoupling the null models for interaction frequency and phylogenetic distance. We incorporate the deviation between observed and random interaction frequencies as weights into the calculation of partner phylogenetic α‐diversity. To calculate the PSS index, we then compare observed partner phylogenetic α‐diversity to a null distribution generated by randomizing phylogenetic distances among the same number of partners. PSS quantifies the phylogenetic structure (i.e., clustered, overdispersed, or random) of the partners of a focal species. We show with simulations that the PSS index is not correlated with network properties, which allows comparisons across multiple systems. We also implemented PSS on empirical networks of host–parasite, avian seed‐dispersal, lichenized fungi–cyanobacteria, and hummingbird pollination interactions. Across these systems, a large proportion of taxa interact with phylogenetically random partners according to PSS, sometimes to a larger extent than detected with an existing method that does not account for partner availability. We also found that many taxa interact with phylogenetically clustered partners, while taxa with overdispersed partners were rare. We argue that species with phylogenetically overdispersed partners have often been misinterpreted as generalists when they should be considered specialists. Our results highlight the important role of randomness in shaping interaction networks, even in highly intimate symbioses, and provide a much‐needed quantitative framework to assess the role that evolutionary history and symbiotic specialization play in shaping patterns of biodiversity. PSS is available as an R package at https://github.com/cjpardodelahoz/pss .

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

DyG-DPCD: A Distributed Parallel Community Detection Algorithm for Large-Scale Dynamic Graphs

Dynamic (Temporal) graphs capture the valuable evolution of real-world systems, from the continuously evolving patterns of social interactions and genetic pathways to the dynamic fluctuations of economic forces. Detecting communities for such evolving networks poses unique challenges. Detecting and analyzing the evolution of communities within dynamic graphs unlocks valuable insights into the underlying structural and temporal patterns of real-world systems. However, the sheer volume of modern graph data and the inherent complexity of the temporal dimension pose significant challenges to scalable community detection algorithms. Addressing this gap, our work explores the limited landscape of scalable distributed-memory parallel methods specifically designed for dynamic network community detection. We propose a novel parallel algorithm, DyG-DPCD (Dynamic Graph Distributed Parallel Community Detection), to detect communities in dynamic networks using the Message Passing Interface (MPI) framework. We present a vertex-centric approach, allowing us to detect communities through local optimization. Furthermore, we enhance our baseline algorithm by incorporating three heuristics, which improve the algorithm’s performance significantly while maintaining the quality of the solutions. We demonstrate the efficiency of our algorithm by experimenting on several real-world large-scale networks with hundreds of millions of edges spanning diverse domains. Notably, DyG-DPCD achieves speedups between 25× and 30× for large networks that we experimented on using NERSC compute nodes. In conclusion, our algorithm outperforms the STINGER parallel re-agglomeration algorithm by 30×.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Recurrent convolutional neural networks for modeling nonadiabatic dynamics of quantum-classical systems

Recurrent neural networks (RNNs) have recently been extensively applied to model the time evolution in fluid dynamics, weather predictions, and even chaotic systems due to their ability to capture temporal dependencies and sequential patterns in data. Here we present an RNN model based on convolutional neural networks for modeling the nonlinear nonadiabatic dynamics of hybrid quantum-classical systems. The dynamical evolution of the hybrid systems is governed by equations of motion for classical degrees of freedom and von Neumann equation for electrons. The Physics-Aware Recurrent Convolution (PARC) neural network structure incorporates a differentiator-integrator architecture that inductively models the spatiotemporal dynamics of generic physical systems. Here, we apply our RNN approach to learn the space-time evolution of a one-dimensional semiclassical Holstein model after an interaction quench. For shallow quenches (small changes in electron-lattice coupling), the deterministic dynamics can be accurately captured using a single-CNN-based recurrent network. In contrast, deep quenches induce chaotic evolution, making long-term trajectory prediction significantly more challenging. Nonetheless, we demonstrate that the PARC-CNN architecture can effectively learn the statistical climate of the Holstein model under deep-quench conditions.

Holstein model↗
DOE OSTI2025

CLPNets: Coupled Lie–Poisson neural networks for multi-part Hamiltonian systems with symmetries

To accurately compute data-based prediction of Hamiltonian systems, it is essential to utilize methods that preserve the structure of the equations over time. We consider a particularly challenging case of systems with interacting parts that do not reduce to pure momentum evolution. Such systems are essential in scientific computations, such as discretization of a continuum elastic rod, which can be viewed as the group of rotations and translations $SE(3)$. The evolution involves not only the momenta but also the relative positions and orientations of the particles. The presence of Lie group-valued elements, such as relative positions and orientations, poses a problem for applying previously derived methods for data-based computing. We develop a novel method of data-based computation and complete phase space learning of such systems. We follow the original framework of SympNets (Jin et al., 2020) and LPNets (Eldred et al., 2024), building the neural network from phase space mappings that preserve the Lie–Poisson structure. We derive a novel system of mappings that are built into neural networks describing the evolution of such systems. We call such networks Coupled Lie–Poisson Neural Networks, or CLPNets. We consider increasingly complex examples for the applications of CLPNets, starting with the rotation of two rigid bodies about a common axis, progressing to the free rotation of two rigid bodies, and finally to the evolution of two connected and interacting $SE(3)$ components, describing the discretization of an elastic rod into two elements. Our method preserves all Casimir invariants to machine precision, preserves energy to high accuracy, and shows good resistance to the curse of dimensionality, requiring only a few thousand data points for all cases studied (three to eighteen dimensions). Additionally, the method is highly economical in memory requirements, requiring only about 200 parameters for the most complex case considered.

Data-based modeling↗
DOE OSTI2025

From disorganized data to emergent dynamic models: Questionnaires to partial differential equations

Starting with sets of disorganized observations of spatially varying and temporally evolving systems, obtained at different (also disorganized) sets of parameters, we demonstrate the data-driven derivation of parameter dependent, evolutionary partial differential equation (PDE) models capable of generating the data. This tensor type of data is reminiscent of shuffled (multidimensional) puzzle tiles. The independent variables for the evolution equations (their “space” and “time”) as well as their effective parameters are all emergent , i.e. determined in a data-driven way from our disorganized observations of behavior in them. We use a diffusion map based questionnaire approach to build a smooth parametrization of our emergent space/time/parameter space for the data. This approach iteratively processes the data by successively observing them on the “space,” the “time” and the “parameter” axes of a tensor. Once the data become organized, we use machine learning (here, neural networks) to approximate the operators governing the evolution equations in this emergent space. Our illustrative examples are based (i) on a simple advection–diffusion model; (ii) on a previously developed vertex-plus-signaling model of Drosophila embryonic development; and (iii) on two complex dynamic network models (one neuronal and one coupled oscillator model) for which no obvious smooth embedding geometry is known a priori. This allows us to discuss features of the process like symmetry breaking, translational invariance, and autonomousness of the emergent PDE model, as well as its interpretability.

generative models↗
DOE OSTI2022

Fast, High-fidelity Lyα Forests with Convolutional Neural Networks

Full-physics cosmological simulations are powerful tools for studying the formation and evolution of structure in the universe but require extreme computational resources. Here, we train a convolutional neural network to use a cheaper N-body-only simulation to reconstruct the baryon hydrodynamic variables (density, temperature, and velocity) on scales relevant to the Lyα forest, using data from Nyx simulations. We show that our method enables rapid estimation of these fields at a resolution of ~20 kpc, and captures the statistics of the Lyα forest with much greater accuracy than existing approximations. Because our model is fully convolutional, we can train on smaller simulation boxes and deploy on much larger ones, enabling substantial computational savings. Furthermore, as our method produces an approximation for the hydrodynamic fields instead of Lyα flux directly, it is not limited to a particular choice of ionizing background or mean transmitted flux.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRSDate not supplied

Bayesian Analysis of the Detection Performance of the Lightning Imaging Sensors

Identical Lightning Imaging Sensors aboard the Tropical Rainfall Measuring Mission satellite (TRMM LIS, 1998-2015) and International Space Station (ISS LIS, 2017-present) have collectively provided over two decades of lightning observations over the global tropics, with ISS LIS extending coverage into the mid-latitudes. Quantifying the detection performance of both LIS sensors is a necessary step toward generating a LIS climatological record and accurately combining LIS data with lightning detections from other sensors and networks. We compare lightning observations from both LIS sensors with reference sources including the Geostationary Lightning Mapper (GLM) and ground-based networks operated by Earth Networks (the Earth Networks Total Lightning Network [ENTLN] and Earth Networks Global Lightning Network [ENGLN]) and Vaisala (the National Lightning Detection Network [NLDN] and Global Lightning Dataset [GLD360]). Instead of a relative detection efficiency (RDE) approach that involves assuming perfect performance of the reference sensor, we employ a Bayesian approach to estimate the upper limit of the absolute detection efficiency (ADE) of each sensor being analyzed. The results of this Bayesian analysis illustrate the geographical pattern of ADE as well as its diurnal cycle and yearly evolution, reflecting the growth of the reference networks over time.

Katrina Virts↗
DOE OSTI2025

The advanced evolution of massive stars

The nuclear rates for reactions involving 12 C and 16 O are key to computing the energy release and nucleosynthesis evolution of massive stars during their advanced burning phases. Ultimately, these burning rates shape the stellar structure and evolution and influence the nature of the compact objects produced at the end of the stellar life. We explore the implications of new nuclear reaction rates from both experimental and theoretical studies for 12 C(α, γ) 16 ​O, 12 C+ 12​ C, 12 C+ 16 ​O, and 16 O+ 16 ​O reactions for massive stars. Our goal is to investigate how the chemical structure and nucleosynthesis evolve from the He-exhaustion stage to the O-burning phase and how these processes influence the ultimate stellar fate. We computed rotating and non-rotating models for stars of different masses at solar metallicity. We used the stellar evolution code GENEC, which includes a large network of nuclear reactions and isotopes involved in advanced phases, as well as updated rates for 12 C(α,γ) 16 O. For the three fusion reactions involving 12 C and 16 O, we considered new rates following a data-driven fusion suppression scenario (hereafter HIN(RES)) and new theoretical rates obtained with time-dependent Hartree-Fock (TDHF) calculations. The updated 12 C(α, γ) 16 ​O rates mainly impact the chemical structure evolution changing the 12 C/ 16 O ratio at He-exhaustion and have little effect on the CO core mass. This variation in the 12 C/ 16 O ratio is in some cases critical for predicting the final fate of the model, which is very sensitive to 12 C abundance, and in particular the 20 M ⊙ remnant may change from a black hole to a neutron star. The He-burning (C-burning) lifetime is also decreased (increased) by about −2% (+15%). The combined new rates for 12 C+ 12 ​C and 16 O+ 16 ​O fusion reactions according to the HIN(RES) model lead to shorter C- and O-burning lifetimes by ≈ − 10%, and −50%, respectively, and shift the ignition conditions to higher temperatures and densities. In contrast, the theoretical TDHF rates primarily affect C-burning, increasing its duration by about 30% and lowering the ignition temperature. These changes modify the chemical structure of the core, the size and duration of C-burning shells, and hence their compactness. They also impact the central and shell nucleosynthesis (by ±1 dex and by factors of ±2–10, respectively), while 12 C+ 16 ​O reaction rates variations remain the least important.

abundances↗
NASA NTRS1990

Assessing the nation's earthquakes

The basic purposes of this report are: (1) to make a convincing case for the intrinsic value of regional seismic networks; (2) to describe the seriousness of persistent problems in the current configuration and operation of these networks; (3) to outline recommendations for their modernization and future evolution, in particular, their short-term integration and long-term affiliation with the U.S. National Seismic Network. Important supplementary information is included in two appendices: a survey of regional seismic networks and implementation strategies for revitalization of regional seismic networks.

Source record↗
NASA NTRS2006

Future Mission Trends and their Implications for the Deep Space Network

This viewgraph presentation discusses the direction of future missions and it's significance to the Deep Space Network. The topics include: 1) The Deep Space Network (DSN); 2) Past Missions Driving DSN Evolution; 3) The Changing Mission Paradigm; 4) Assessing Future Mission Needs; 5) Link Support Trends; 6) Downlink Rate Trends; 7) Uplink Rate Trends; 8) End-to-End Link Difficulty Trends; 9) Summary: Future Mission Trend Drivers; and 10) Conclusion: Implications for the DSN.

mission trends↗
DOE OSTI2023

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↗
DOE OSTI2024

GrainGNN: A dynamic graph neural network for predicting 3D grain microstructure

We propose GrainGNN, a surrogate model for the evolution of polycrystalline grain structure under rapid solidification conditions in metal additive manufacturing. High fidelity simulations of solidification microstructures are typically performed using multicomponent partial differential equations (PDEs) with moving interfaces. The inherent randomness of the PDE initial conditions (grain seeds) necessitates ensemble simulations to predict microstructure statistics, e.g., grain size, aspect ratio, and crystallographic orientation. Here, currently such ensemble simulations are prohibitively expensive and surrogates are necessary.In GrainGNN, we use a dynamic graph to represent interface motion and topological changes due to grain coarsening. We use a reduced representation of the microstructure using hand-crafted features; we combine pattern finding and altering graph algorithms with two neural networks, a classifier (for topological changes) and a regressor (for interface motion). Both networks have an encoder-decoder architecture; the encoder has a multi-layer transformer long-short-term-memory architecture; the decoder is a single layer perceptron.We evaluate GrainGNN by comparing it to high-fidelity phase field simulations for in-distribution and out-of-distribution grain configurations for solidification under laser power bed fusion conditions. GrainGNN results in 80%–90% pointwise accuracy; and nearly identical distributions of scalar quantities of interest (QoI) between phase field and GrainGNN simulations compared using Kolmogorov-Smirnov test. GrainGNN's inference speedup (PyTorch on single x86 CPU) over a high-fidelity phase field simulation (CUDA on a single NVIDIA A100 GPU) is 150×–2000× for 100-initial grain problem. Further, using GrainGNN, we model the formation of 11,600 grains in 220 seconds on a single CPU core.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Influence of Fault Architecture on Induced Earthquake Sequence Evolution Revealed by High-Resolution Focal Mechanism Solutions

The increasing seismicity and improved seismic observation network in recent years provide an opportunity to explore factors that influence the triggering processes, spatiotemporal evolution, and maximum magnitude of induced sequences. We map the fault architecture and stress state of four induced sequences in Oklahoma to determine their influence on the seismicity. We systematically relocate the earthquakes and compute hundreds of focal mechanisms of small to medium events (1.0 < M < 5.1) using various techniques, including machine learning, for the Guthrie, Woodward, Cushing, and Fairview sequences. The detailed fault geometry and spatiotemporal evolution of seismicity and stress states reveal different dominant driving forces for each sequence. In Cushing and Fairview (largest event ≥M5.0), the main fault structures are near-vertical narrow strike-slip faults, with most of the small earthquake fault planes optimally oriented. The two sequences exhibit discontinuous temporal migration but strong earthquake self-driven rupture growth. In Guthrie and Woodward (largest event <M5.0), the two sequences show more complex diffuse fault structures with varying dipping angles along depth. The inverted focal mechanisms show a mix of strike-slip faulting and normal faulting in both sequences, and the normal faulting events are less optimally oriented than strike-slip events. The two sequences are dominated by continuous diffusive migration in time driven by pore pressure propagation. The above results suggest that fault architecture and stress state influence sequence evolution, major driving forces, and possibly maximum magnitude.

58 GEOSCIENCES↗
DOE OSTI2020

APOGEE Net: Improving the Derived Spectral Parameters for Young Stars through Deep Learning

Machine learning allows for efficient extraction of physical properties from stellar spectra that have been obtained by large surveys. The viability of machine-learning approaches has been demonstrated for spectra covering a variety of wavelengths and spectral resolutions, but most often for main-sequence (MS) or evolved stars, where reliable synthetic spectra provide labels and data for training. Spectral models of young stellar objects (YSOs) and low-mass MS stars are less well-matched to their empirical counterparts, however, posing barriers to previous approaches to classify spectra of such stars. In this work, we generate labels for YSOs and low-mass MS stars through their photometry. We then use these labels to train a deep convolutional neural network to predict logg, T {sub eff}, and Fe/H for stars with Apache Point Observatory Galactic Evolution Experiment (APOGEE) spectra in the DR14 data set. This “APOGEE Net” has produced reliable predictions of logg for YSOs, with uncertainties of within 0.1 dex and a good agreement with the structure indicated by pre-MS evolutionary tracks, and it correlates well with independently derived stellar radii. These values will be useful for studying pre-MS stellar populations to accurately diagnose membership and ages.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Learning Distributed Geometric Koopman Operator for Sparse Networked Dynamical Systems

Koopman operator theory provides an alternative to study nonlinear networked dynamical systems by mapping the state space to an abstract higher dimensional space where the system evolution is linear. Recent works show the application of graph neural networks (GNNs) to learn state to object-centric embeddings and achieve centralized block-wise computation of Koopman operator (KO) under additional assumptions on the underlying agents properties and constraints on the KO structure. However, the computational complexity of learning the Koopman increases exponentially for networked systems where the number of possible system states grows in a combinatorial fashion with the number of nodes. The learning challenge is further amplified for sparse networks by two factors: 1) sample sparsity for learning the Koopman operator in the non-linear space, and 2) the divergence in the dynamics of individual nodes or from one subgraph to another. Our work aims to address these challenge by formulating the representation learning of networked dynamical systems into a multi-agent paradigm and learning the Koopman operator in a distributive manner. The computational as well as performance advantages of distributed Koopman is predominant for sparse networks whereas for fully connected networks, it is shown to coincide with the centralized one. The empirical study on rope system, network of oscillators and a synthetic power system show comparable and superior performance along with computational benefits with the state-of-the-art methods.

Mukherjee, Sayak↗
DOE OSTI2021

Multi-scale Coupled Processes Modeling of Fractures as Porous, Interfacial and Granular Systems from Rock Images with the Numerical Manifold Method

Abstract The greatest challenges of rigorously modeling coupled hydro-mechanical processes in fractured rocks at different scales are associated with computational geometry. In addition, selections of continuous or discontinuous models, physical laws, and coupling priorities at different scales based on different geometric features determine the applicability of a numerical model for a certain type of problem. In this study, we present our multi-scale modeling capabilities that have been developed based on the numerical manifold method for analyzing coupled hydro-mechanical processes in fractured rocks. Based on their geometric features, the fractures are modeled as continua—finite-thickness porous zones, and discontinua—discontinuous interfaces and microscale asperities and granular systems. Different governing equations, physical laws, coupling priorities, and approaches for addressing fracture intersections and shearing are then applied to describe these. We applied these models to simulate coupled processes in fractured rocks using realistic geometry obtained from rock images at different scales. We first calculated shearing of a single fracture with different models and demonstrated the impacts of asperities on shearing. We then applied the continuous and discontinuous models to simulate a network of rough fractures, demonstrating that contact dynamics contribute significantly to the geometric, multi-physical evolution of systems where rough fractures are not mineral filled. For a discrete fracture network, our coupled processes modeling demonstrates that shearing of the discrete fractures can have a major impact on stress and pore pressure distribution. Lastly, we applied the discontinuous granular model to simulate evolution of a complex granular system with a deformation band, demonstrating that the deformation band can dominate contact dynamics, the structural and the stress evolution of the granular system.

58 GEOSCIENCES↗