Search NASA⌕ Search

SEARCH · Search NASA

Results for “Spectral Graph”

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 91 records · Page 5

Relativistic spectral function of nucleons in hot nuclear matter

We present a simple calculation of the nucleon self-energy in nuclear matter at finite temperature in a relativistic framework, using the real-time thermal field theory. The imaginary parts of one-loop graphs are identified with discontinuities across the unitary and the Landau cuts. We find that in general both the cuts contribute significantly to the spectral function in the region of (virtual) nucleon mass usually considered, even though the unitary cut is ignored in the literature. Furthermore, our relativistic spectral function differs from the one in nonrelativistic approximation, used in some earlier calculations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

AI-Assisted Conceptual Development of a Pre-Geometric Cosmological Model - An Exercise in AI-Assisted Conceptual Framework Generation, Paper II: Local Geometry and Metric Structure

This paper develops the geometric sector of the replication-driven cosmogenesis framework introduced in Paper I. Starting from a pre-geometric spectral substrate and a minimal set of replication axioms, we show how coherent self-replicating units generate a spatial adjacency graph whose continuum limit acquires an effective Riemannian structure. The replication dynamics determines a characteristic correlation length that seeds the local metric, while overlap relations among coherent units produce an isotropic neighborhood geometry with an emergent dimensionality $d_{\rm eff}\simeq 3$ across a broad range of replication factors. As replication slows and causal order stabilizes, a limiting signal speed $c_\ast$ appears, providing the basis for the Lorentzian structure of spacetime without assuming a pre-existing light cone. We derive conditions under which the adjacency graph converges to a smooth three-dimensional manifold, describe the transition from Euclidean to Lorentzian propagation, and identify geometric invariants controlled by the replication parameters. This work establishes the geometric and causal layer of the replication cosmogenesis program, bridging the spectral axioms of Paper I to the cosmological dynamics explored in Paper III.

79 ASTRONOMY AND ASTROPHYSICS↗

Perfect quantum state transfer on diamond fractal graphs

In the quest for designing novel protocols for quantum information and quantum computation, an important goal is to achieve perfect quantum state transfer for systems beyond the well-known one- dimensional cases, such as 1D spin chains. Here, we use methods from fractal analysis and probability to find a new class of quantum spin chains on fractal-like graphs (known as diamond fractals) which support perfect quantum state transfer and which have a wide range of different Hausdorff and spectral dimensions. The resulting systems are spin networks combining Dyson hierarchical model structure with transverse permutation symmetries of varying order.

97 MATHEMATICS AND COMPUTING↗

An Approach to Bounding the Spectral Radius of a Weighted Digraph

The paper suggests a general approach to deriving upper bounds for the spectral radii of weighted digraphs. The approach is based on the generalized Wielandt lemma (GWL), which reduces the problem of bounding the spectral radius of a given block matrix to bounding the Perron root of the matrix composed of the norms of the blocks. In the case of the adjacency matrix of weighted graphs and digraphs where all the blocks are square positive (semi)definite matrices of the same order, the GWL takes an especially nice simple form. The second component of the approach consists in applying known upper bounds for the Perron root of a nonnegative matrix. It is shown that the approach suggested covers, in particular, the known upper bounds of the spectral radius and allows one to describe the equality cases.

97 MATHEMATICS AND COMPUTING↗

Machine-Learning X-Ray Absorption Spectra to Quantitative Accuracy

Simulations of excited state properties, such as spectral functions, are often computationally expensive and therefore not suitable for high-throughput modeling. As a proof of principle, here we demonstrate that graph-based neural networks can be used to predict the x-ray absorption near-edge structure spectra of molecules to quantitative accuracy. Specifically, the predicted spectra reproduce nearly all prominent peaks, with 90% of the predicted peak locations within 1 eV of the ground truth. Besides its own utility in spectral analysis and structure inference, our method can be combined with structure search algorithms to enable high-throughput spectrum sampling of the vast material configuration space, which opens up new pathways to material design and discovery.

97 MATHEMATICS AND COMPUTING↗

Hyperspectral target detection using manifold learning and multiple target spectra

Imagery collected from satellites and airborne platforms provides an important tool for remotely analyzing the content of a scene. In particular, the ability to remotely detect a specific material within a scene is of critical importance in nonproliferation and other applications. The sensor systems that process hyperspectral images collect the high-dimensional spectral information necessary to perform these detection analyses. For a d-dimensional hyperspectral image, however, where d is the number of spectral bands, it is common for the data to inherently occupy an m-dimensional space with m << d. In the remote sensing community, this has led to recent interest in the use of manifold learning, which seeks to characterize the embedded lower-dimensional, nonlinear manifold that the data discretely approximate. The research presented in this paper focuses on a graph theory and manifold learning approach to target detection, using an adaptive version of locally linear embedding that is biased to separate target pixels from background pixels. Finally, this approach incorporates multiple target signatures for a particular material, accounting for the spectral variability that is often present within a solid material of interest.

97 MATHEMATICS AND COMPUTING↗

Large N expansion of the moments and free energy of Sachdev-Ye-Kitaev model, and the enumeration of intersection graphs

In this paper we explain the relation between the free energy of the SYK model for N Majorana fermions with a random q-body interaction and the moments of its spectral density. The high temperature expansion of the free energy gives the cumulants of the spectral density. Using that the cumulants are extensive we find the p dependence of the 1/N 2 correction of the 2p-th moments obtained in [1]. Conversely, the 1/N 2 corrections to the moments give the correction (even q) to the β 6 coefficient of the high temperature expansion of the free energy for arbitrary q. Our result agrees with the 1/q 3 correction obtained by Tarnopolsky using a mean field expansion. These considerations also lead to a more powerful method for solving the moment problem and intersection-graph enumeration problems. We take advantage of this and push the moment calculation to 1/N 3 order and find surprisingly simple enumeration identities for intersection graphs. The 1/N 3 corrections to the moments, give corrections to the β 8 coefficient (for even q) of the high temperature expansion of the free energy which have not been calculated before. Results for odd q, where the SYK “Hamiltonian” is the supercharge of a supersymmetric theory are discussed as well.

1/N Expansion↗

Block Island Noise Modeling Data

Noise propagation near Block Island was simulated to assess environmental impacts of impact pile driving during wind turbine construction. Computational models complement field-recorded acoustic data, providing insights into sound attenuation, spectral variability, and propagation dynamics. The dataset includes: 1. Propagation Models: Simulated underwater sound fields documenting sound pressure and directional variability across frequency bands and distances. 2. Spectral Analysis (LTSA): Long-term averages and processed outputs calculating acoustic intensity over time. 3. Visualization Files: Graphs, 2D/3D simulation results, and reference calculations used in sound modeling.

17 WIND ENERGY↗

A Cheeger inequality for size-specific conductance

The μ-conductance measure proposed by Lovász and Simonovits is a size-specific conductance score that identifies the set with smallest conductance while disregarding those sets with volume smaller than a μ fraction of the whole graph. Using μ-conductance enables us to study the network structures in new ways. Here, in this manuscript, we study a modified spectral cut for μ-conductance that is a natural relaxation of the integer program of μ-conductance and show that the optimum of this program has a two-sided Cheeger inequality with μ-conductance.

Graph theory↗

Mesh-based super-resolution of fluid flows with multiscale graph neural networks

A graph neural network (GNN) approach is introduced in this work which enables mesh-based three-dimensional super-resolution of fluid flows. In this framework, the GNN is designed to operate not on the full mesh-based field at once, but on localized meshes of elements (or cells) directly. To facilitate mesh-based GNN representations in a manner similar to spectral (or finite) element discretizations, a baseline GNN layer (termed a message passing layer, which updates local node properties) is modified to account for synchronization of coincident graph nodes, rendering compatibility with commonly used element-based mesh connectivities. Furthermore, the architecture is multiscale in nature, and is comprised of a combination of coarse-scale and fine-scale message passing layer sequences (termed processors) separated by a graph unpooling layer. The coarse-scale processor embeds a query element (alongside a set number of neighboring coarse elements) into a single latent graph representation using coarse-scale synchronized message passing over the element neighborhood, and the fine-scale processor leverages additional message passing operations on this latent graph to correct for interpolation errors. Demonstration studies are performed using hexahedral mesh-based data from Taylor–Green Vortex and backward-facing step flow simulations at Reynolds numbers of 1600 and 3200. Through analysis of both global and local errors, the results ultimately show how the GNN is able to produce accurate super-resolved fields compared to targets in both coarse-scale and multiscale model configurations. Reconstruction errors for fixed architectures were found to increase in proportion to the Reynolds number. Geometry extrapolation studies on a separate cavity flow configuration show promising cross-mesh capabilities of the super-resolution strategy.

Backward-facing step↗

Hyper Spectral Anomaly Detection

Anomaly detection is a common machine learning (ML) task with growing importance in the fields of imaging, quality assurance, and multiple security related disciplines. Anomaly detection is more difficult than traditional machine learning methods due to the inherent unlabeled nature of the datasets. Existing anomaly detection architectures commonly face challenges with explainability, retaining information related to the relational structure of the data, and false positive rates. Hyperspectral Imaging Anomaly Detection (HSI) is a statistical model that employs vertex and edge weighted graphs to preserve the data’s relationships on different topographical scales. The model is able to generalize from anomaly detection in 2D images to novel datasets related to cyber-security. Furthermore, the use of multi-spectral and other filtering methods results in fewer false positives and increases the explainability of model predictions. When applying HSI to cyber-security datasets, we are able to successfully detect malicious activity with a relatively high degree of accuracy.

97 - MATHEMATICS AND COMPUTING↗

QC-GN 2 oMS 2 : a Graph Neural Net for High Resolution Mass Spectra Prediction

Predicting the mass spectrum of a molecular ion is often accomplished via three generalized approaches: rules-based methods for bond breaking, deep learning, or quantum chemical (QC) modeling. Rules-based approaches are often limited by the conditions for different chemical subspaces and perform poorly under chemical regimes with few defined rules. QC modeling is theoretically robust but requires significant amounts of computational time to produce a spectrum for a given target. Among deep learning techniques, graph neural networks (GNNs) have performed better than previous work with fingerprint-based neural networks in mass spectra prediction. To explore this technique further, we investigate the effects of including quantum chemically derived information as edge features in the GNN to increase predictive accuracy. The models we investigated include categorical bond order, bond force constants derived from extended tight-binding (xTB) quantum chemistry, and acyclic bond dissociation energies. Throughout this work, we evaluated these models against a control GNN with no edge features in the input graphs. Bond dissociation enthalpies yielded the best improvement with a cosine similarity score of 0.462 relative to the baseline model (0.437). In this work we also apply dynamic graph attention which improves performance on benchmark problems and supports the inclusion of edge features. Between implementations, we investigate the nature of the molecular embedding for spectra prediction and discuss the recognition of fragment topographies in distinct chemistries for further development in tandem mass spectrometry prediction.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Task-based Parallel Computation of the Density Matrix in Quantum-based Molecular Dynamics using Graph Partitioning

Quantum-based molecular dynamics (QMD) is a highly accurate and transferable method for material science simulations. However, the time scales and system sizes accessible to QMD are typically limited to picoseconds and a few hundred atoms. These constraints arise due to expensive self-consistent ground-state electronic structure calculations that can often scale cubically with the number of atoms. Linearly scaling methods depend on computing the density matrix P from the Hamiltonian matrix H by exploiting the sparsity in both matrices. The second-order spectral projection (SP2) algorithm is an O(N) algorithm that computes P with a sequence of 40 - 50 matrix-matrix multiplications. In this paper, we present task-based implementations of a recently developed data-parallel graph-based approach to the SP2 algorithm, G-SP2. We represent the density matrix P as an undirected graph and use graph partitioning techniques to divide the computation into smaller independent tasks. The partitions thus obtained are generally not of equal size and give rise to undesirable load imbalances in standard MPI-based implementations. This load-balancing challenge can be mitigated by dynamically scheduling parallel computations at runtime using task-based programming models. We develop task-based implementations of the data-parallel G-SP2 algorithm using both Intel's Concurrent Collections (CnC) as well as the Charm++ programming model and evaluate these implementations for future use. Scaling and performance results of our implementations are investigated for representative segments of QMD simulations for solvated protein systems containing more than 10,000 atoms.

97 MATHEMATICS AND COMPUTING↗

Quantum simulation of hyperbolic space with circuit quantum electrodynamics: From graphs to geometry

We show how quantum many-body systems on hyperbolic lattices with nearest-neighbor hopping and local interactions can be mapped onto quantum field theories in continuous negatively curved space. Here, the underlying lattices have recently been realized experimentally with superconducting resonators and therefore allow for a table-top quantum simulation of quantum physics in curved background. Our mapping provides a computational tool to determine observables of the discrete system even for large lattices, where exact diagonalization fails. As an application and proof of principle we quantitatively reproduce the ground state energy, spectral gap, and correlation functions of the noninteracting lattice system by means of analytic formulas on the Poincaré disk, and show how conformal symmetry emerges for large lattices. This sets the stage for studying interactions and disorder on hyperbolic graphs in the future. Importantly, our analysis reveals that even relatively small discrete hyperbolic lattices emulate the continuous geometry of negatively curved space, and thus can be used to experimentally resolve fundamental open problems at the interface of interacting many-body systems, quantum field theory in curved space, and quantum gravity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

powersqueeze

powersqueeze (psqz) is a truncated power iteration library intended for high-performance computing platforms. psqz efficiently produces low-dimensional, linear measurements of graph matrix spectra by combining classical power iteration with sparse Johnson-Lindenstrauss transforms. psqz is intended to produce high-quality, fast, data-oblivious low-dimensional representations of high-dimensional sparse data such as graphs and term-document matrices. psqz is intended to replace similar workflows that depend on directly approximating a truncated eigendecomposition (e.g., the first step of spectral clustering), which is a much more expensive operation.

Priest, BenjaminW [Lawrence Livermore National Lab↗

Spectral Clustering-Based Partitioning of Large-Scale Power Electronics-Based Power Systems for Small-Signal Stability Analysis

The nodal admittance matrix (NAM)-based approach is well-suited for small-signal stability analysis of large-scale power electronics-based power systems (PEPSs), as it preserves the system structure through its admittance matrix. Previous studies have explored partitioning such systems into subareas and interconnections to reduce computational burden; however, they lacked a formal algorithmic procedure for determining feasible partitions. While several grid partitioning methods, such as those based on graph theory or machine learning, exist in the literature, they cannot be directly applied to NAM-based analysis due to differing objectives and constraints. Here, this paper addresses this gap by presenting a systematic, step-by-step procedure for applying a spectral partitioning algorithm that yields a division of the system into subareas suitable for NAM-based analysis. The computational complexity of the proposed method is also derived to demonstrate its efficiency and justify the practicality of the resulting subarea decomposition. The performance of the partitioning method is evaluated by applying the spectral clustering-derived subareas and interconnections to the NAM-based partitioning approach on a 140-bus system. Computational times for the full-system and partitioned NAM analyses are compared using MATLAB. Additionally, PSCAD simulations of the complete system and partitioned subareas are carried out to verify the effectiveness of the proposed method.

Nupur [Univ. of Tennessee, Knoxville, TN (United S↗