Search NASA⌕ Search

SEARCH · Search NASA

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

Theoretical study of the interparticle interaction of nanoparticles randomly dispersed on a substrate

Metal nanoparticles exhibit the phenomenon of localized surface plasmon resonance (LSPR) due to the collective oscillation of their conduction electrons, which is induced by external electromagnetic radiation. The finite-differential time-domain (FDTD) method is widely used as an electromagnetic field analysis tool for nanoparticles. Although the influence of interparticle interactions is taken into consideration in the FDTD calculation for the plural particles configuration, the FDTD calculation of a random configuration is very difficult, particularly in the case of non-spherical particles. In this study, a theoretical calculation method incorporating interparticle interactions on a substrate with various particle shapes and sizes on a subwavelength scale is developed. The interparticle interaction is incorporated following FDTD calculation with an isolated single particle. This is explained systematically using a signal flow graph. Moreover, the mirror image effect of the substrate and the retardation effect are also taken into account in this method. The validity of this method is verified by calculations for simple arrangements of nanoparticles. In addition, it is confirmed that the method can improve the accuracy of predicted experimental results for Au nanoparticles prepared by the sputtering method, in terms of the plasmon peak wavelength. This method may enable the design of LSPR devices by controlling nanoparticle characteristics, such as the size, shape, and distribution density.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multitask graph neural networks for elastoplastic response prediction in dual-phase polycrystals

Microstructure-sensitive prediction of elastoplastic response remains a recurring bottleneck in multiscale damage and fatigue modeling, where large ensembles of statistically distinct polycrystals are required to quantify variability and extreme-value behavior. In this work, we develop a multitask graph neural network (GNN) surrogate that maps dual-phase ferrite–martensite polycrystal microstructures to Statistical Volume Element (SVE)-level elastoplastic Quantities of Interest (QoIs). Each SVE is represented as a grain-adjacency graph, with node features encoding phase, geometry, and crystallographic orientation, and edge features encoding relative misorientation. A message-passing graph convolution generates node embeddings, which are pooled into a graph representation and passed to a multitask regression head that jointly predicts 10 scalar QoIs and vector-valued stress–strain responses in orthogonal loading directions across multiple martensite volume fractions and SVE sizes. Results show high accuracy for scalar QoIs and strong agreement for full stress–strain trajectories, with population envelopes reproducing both median behavior and finite-SVE variability across compositions and partition scales. A unified model trained on pooled volume-fraction data preserves most within-regime accuracy relative to regime-specific models while also capturing the broader cross-regime variation reflected in the pooled test set. Distributional comparisons further demonstrate that the surrogate preserves heterogeneity under SVE partitioning, enabling statistically consistent block-wise random-field construction for mesoscale analyses. Overall, the proposed grain-graph surrogate provides a practical pathway to accelerate ensemble-based studies of SVE-level constitutive variability in dual-phase polycrystals.

Crystal plasticity↗

Scaling whole-chip QAOA for higher-order ising spin glass models on heavy-hex graphs

Abstract We show that the quantum approximate optimization algorithm (QAOA) for higher-order, random coefficient, heavy-hex compatible spin glass Ising models has strong parameter concentration across problem sizes from 16 up to 127 qubits for p = 1 up to p = 5, which allows for computationally efficient parameter transfer of QAOA angles. Matrix product state (MPS) simulation is used to compute noise-free QAOA performance. Hardware-compatible short-depth QAOA circuits are executed on ensembles of 100 higher-order Ising models on noisy IBM quantum superconducting processors with 16, 27, and 127 qubits using QAOA angles learned from a single 16-qubit instance using the JuliQAOA tool. We show that the best quantum processors find lower energy solutions up to p = 2 or p = 3, and find mean energies that are about a factor of two off from the noise-free distribution. We show that p = 1 QAOA energy landscapes remain very similar as the problem size increases using NISQ hardware gridsearches with up to a 414 qubit processor.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multiple trapping on a comb structure as a model of electron transport in disordered nanostructured semiconductors

A model of dispersive transport in disordered nanostructured semiconductors has been proposed taking into account the percolation structure of a sample and joint action of several mechanisms. Topological and energy disorders have been simultaneously taken into account within the multiple trapping model on a comb structure modeling the percolation character of trajectories. The joint action of several mechanisms has been described within random walks with a mixture of waiting time distributions. Integral transport equations with fractional derivatives have been obtained for an arbitrary density of localized states. The kinetics of the transient current has been calculated within the proposed new model in order to analyze time-of-flight experiments for nanostructured semiconductors.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Dynamic Disruption Resilience in Intermodal Transport Networks: Integrating Flow Weighting and Centrality Measures

Resilient intermodal freight networks are vital for sustaining supply chains amid increasing threats from natural hazards and cyberattacks. Transportation resilience has been widely studied; understanding how random and targeted disruptions affect structural connectivity and functional performance remains a key challenge. To address this, this study evaluates the robustness of the US intermodal freight network, which consists of rail and water modes, using a simulation-based framework that integrates graph-theoretic metrics with flow-weighted centrality measures. Disruption scenarios are examined, including random failures as well as targeted node and edge removals based on static and dynamically updated degree and betweenness centrality. To reflect more realistic conditions, flow-weighted degree centralities (WDC) and partial node degradation are considered. Two resilience indicators are used: (1) the size of the giant connected component to measure structural connectivity; and (2) flow-weighted network efficiency (NE) to assess freight mobility under disruption. The results show that progressively degrading nodes ranked by WDC to 60% of their original functionality causes a sharper decline in normalized NE, for up to approximately 45 affected nodes, than complete failure (100% loss of functionality) applied to nodes targeted by weighted betweenness centrality or selected at random. This highlights how partial degradation of high-tonnage hubs can produce disproportionately large functional losses. The findings emphasize the need for resilience strategies that go beyond network topology to incorporate freight flow dynamics.

42 ENGINEERING↗

On-chip generation of Einstein-Podolsky-Rosen states with arbitrary symmetry

We experimentally demonstrate a method for integrated-optical generation of two-photon Einstein-Podolsky-Rosen states featuring arbitrary symmetries. In our setting, we employ detuned directional couplers to impose a freely tailorable phase between the two modes of the state. Our results allow to mimic the quantum random walk statistics of bosons, fermions, and anyons, particles with fractional exchange statistics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Arc spot grouping: An entanglement of arc spot cells

In recent experiments, clear transitions in velocity and trail width of an arc spot initiated on nanostructured tungsten were observed on the boundary of the thick and thin nanostructured layer regions. The velocity of arc spot was significantly decreased on the thick nanostructured region. It was suggested that the grouping decreased the velocity of arc spot. In this study, we try to explain the phenomena using a simple random walk model that has properties of directionality and self-avoidance. And grouping feature was added by installing an attractive force between spot cells with dealing with multi-spots. It was revealed that an entanglement of arc spot cells decreased the spot velocity, and spot cells tend to stamp at the same location many times.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Polaritons and excitons: Hamiltonian design for enhanced coherence

The primary questions motivating this report are: Are there ways to increase coherence and delocalization of excitation among many molecules at moderate electronic coupling strength? Coherent delocalization of excitation in disordered molecular systems is studied using numerical calculations. The results are relevant to molecular excitons, polaritons, and make connections to classical phase oscillator synchronization. In particular, it is hypothesized that it is not only the magnitude of electronic coupling relative to the standard deviation of energetic disorder that decides the limits of coherence, but that the structure of the Hamiltonian—connections between sites (or molecules) made by electronic coupling—is a significant design parameter. Inspired by synchronization phenomena in analogous systems of phase oscillators, some properties of graphs that define the structure of different Hamiltonian matrices are explored. The report focuses on eigenvalues and ensemble density matrices of various structured, random matrices. Some reasons for the special delocalization properties and robustness of polaritons in the single-excitation subspace (the star graph) are discussed. The key result of this report is that, for some classes of Hamiltonian matrix structure, coherent delocalization is not easily defeated by energy disorder, even when the electronic coupling is small compared to disorder.

Science & Technology - Other Topics↗

Machine Learning Prediction of the Experimental Transition Temperature of Fe(II) Spin-Crossover Complexes

Spin-crossover (SCO) complexes are materials that exhibit changes in the spin state in response to external stimuli, with potential applications in molecular electronics. It is challenging to know a priori how to design ligands to achieve the delicate balance of entropic and enthalpic contributions needed to tailor a transition temperature close to room temperature. Here, we leverage the SCO complexes from the previously curated SCO-95 data set [Vennelakanti et al. J. Chem. Phys. 159, 024120 (2023)] to train three machine learning (ML) models for transition temperature (T 1/2 ) prediction using graph-based revised autocorrelations as features. We perform feature selection using random forest-ranked recursive feature addition (RF-RFA) to identify the features essential to model transferability. Of the ML models considered, the full feature set RF and recursive feature addition RF models perform best, achieving moderate correlation to experimental T 1/2 values. We then compare ML T 1/2 predictions to those from three previously identified best-performing density functional approximations (DFAs) which accurately predict SCO behavior across SCO-95, finding that the ML models predict T 1/2 more accurately than the best-performing DFAs. In addition, we study ML model predictions for a set of 18 SCO complexes for which only estimated T 1/2 values are available. Upon excluding outliers from this set, the RF-RFA RF model shows a strong correlation to estimated T 1/2 values with a Pearson’s r of 0.82. In contrast, DFA-predicted T 1/2 values have large errors and show no correlation to estimated T 1/2 values over the same set of complexes. Overall, our study demonstrates slightly superior performance of ML models in comparison with some of the best-performing DFAs, and we expect ML models to improve further as larger data sets of SCO complexes are curated and become available for model training.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Effect of Turbulence Modeling on the Melt Flow and Inclusions Transport in a Steel Filtration Experiment

The current article deals with the effect of turbulence modeling on inclusions transport and melt flow in an induction crucible furnace (ICF), which was employed in order to investigate the efficiency and the performance of a ceramic filter. Furthermore, the influence of the discrete random-walk dispersion model on the behavior of inclusions in the ICF was investigated. Different turbulence models were employed in order to predict the turbulent melt flow. The numerical results show that the flow field is affected by the turbulence modeling method. Moreover, the distribution of the turbulent kinetic energy depends considerably on the choice of the turbulence model. In addition, the turbulence model and dispersion model also affect the inclusion transport in the melt. The filtration rate is also affected by the choice of the turbulence model.

36 MATERIALS SCIENCE↗

Role of defects in the process of graphene growth on hexagonal boron nitride from atomic carbon

Hexagonal boron nitride (h-BN) is an attractive substrate for graphene, as the interaction between these materials is weak enough for high carrier mobility to be retained in graphene but strong enough to allow for some epitaxial relationship. We deposited graphene on exfoliated h-BN by molecular beam epitaxy (MBE), we analyzed the atomistic details of the process by ab initio density functional theory (DFT), and we linked the DFT and MBE results by random walk theory. Graphene appears to nucleate around defects in virgin h-BN. The DFT analysis reveals that sticking of carbon to perfect h-BN is strongly reduced by desorption, so that pre-existing seeds are needed for the nucleation. The dominant nucleation seeds are C{sub N}C{sub B} and O{sub N}C{sub N} pairs and B{sub 2}O{sub 3} inclusions in the virgin substrate.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Regularity of the Speed of Biased Random Walk in a One-Dimensional Percolation Model

We consider biased random walks on the infinite cluster of a conditional bond percolation model on the infinite ladder graph. Axelson-Fisk and Häggström established for this model a phase transition for the asymptotic linear speed v̄ of the walk. Namely, there exists some critical value λ{sub c}>0 such that v̄>0 if λ∈(0,λ{sub c}) and v̄=0 if λ≥λ{sub c}. We show that the speed v̄ is continuous in λ on (0,∞) and differentiable on (0,λ{sub c}/2). Moreover, we characterize the derivative as a covariance. For the proof of the differentiability of v̄ on (0,λ{sub c}/2), we require and prove a central limit theorem for the biased random walk. Additionally, we prove that the central limit theorem fails to hold for λ≥λ{sub c}/2.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Graph Sparsification by Approximate matrix Multiplication

Graphs arising in statistical problems, signal processing, large networks, combinatorial optimization, and data analysis are often dense, which causes both computational and storage bottlenecks. One way of sparsifying a weighted graph, while sharing the same vertices as the original graph but reducing the number of edges, is through spectral sparsification. We study this problem through the perspective of RandNLA. Specifically, we utilize randomized matrix multiplication to give a clean and simple analysis of how sampling according to edge weights gives a spectral approximation to graph Laplacians, without requiring spectral information. Through the CR–MM algorithm, we attain a simple and computationally efficient sparsifier whose resulting Laplacian estimate is unbiased and of minimum variance. Here, we define a new notion of additive spectral sparsifiers, which has not been considered in the literature.

97 MATHEMATICS AND COMPUTING↗

Stochastic field-line wandering in magnetic turbulence with shear. I. Quasi-linear theory

We investigate the random walk of magnetic field lines in magnetic turbulence with shear. In the first part of the series, we develop a quasi-linear theory in order to compute the diffusion coefficient of magnetic field lines. We derive general formulas for the diffusion coefficients in the different directions of space. We like to emphasize that we expect that quasi-linear theory is only valid if the so-called Kubo number is small. We consider two turbulence models as examples, namely, a noisy slab model as well as a Gaussian decorrelation model. For both models we compute the field line diffusion coefficients and we show how they depend on the aforementioned Kubo number as well as a shear parameter. It is demonstrated that the shear effect reduces all field line diffusion coefficients.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

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↗

Weighted Distances in Scale-Free Configuration Models

In this paper we study first-passage percolation in the configuration model with empirical degree distribution that follows a power-law with exponent τ∈(2,3). We assign independent and identically distributed (i.i.d.) weights to the edges of the graph. We investigate the weighted distance (the length of the shortest weighted path) between two uniformly chosen vertices, called typical distances. When the underlying age-dependent branching process approximating the local neighborhoods of vertices is found to produce infinitely many individuals in finite time—called explosive branching process—Baroni, Hofstad and the second author showed in Baroni et al. (J Appl Probab 54(1):146–164, 2017) that typical distances converge in distribution to a bounded random variable. The order of magnitude of typical distances remained open for the τ∈(2,3) case when the underlying branching process is not explosive. We close this gap by determining the first order of magnitude of typical distances in this regime for arbitrary, not necessary continuous edge-weight distributions that produce a non-explosive age-dependent branching process with infinite mean power-law offspring distributions. This sequence tends to infinity with the amount of vertices, and, by choosing an appropriate weight distribution, can be tuned to be any growing function that is O(loglog n), where n is the number of vertices in the graph. We show that the result remains valid for the the erased configuration model as well, where we delete loops and any second and further edges between two vertices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗