Search NASA⌕ Search

SEARCH · Search NASA

Results for “random graph models”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Differentially Private Synthesis and Sharing of Network Data Via Bayesian Exponential Random Graph Models

Abstract Network data often contain sensitive relational information. One approach to protecting sensitive information while offering flexibility for network analysis is to share synthesized networks based on the information in originally observed networks. We employ differential privacy (DP) and exponential random graph models (ERGMs) and propose the DP-ERGM method to synthesize network data. We apply DP-ERGM to two real-world networks. We then compare the utility of synthesized networks generated by DP-ERGM, the DyadWise Randomized Response (DWRR) approach, and the Synthesis through Conditional distribution of Edge given nodal Attribute (SCEA) approach. In general, the results suggest that DP-ERGM preserves the original information significantly better than two other approaches in network structural statistics and inference for ERGMs and latent space models. Furthermore, DP-ERGM satisfies node DP through modeling the global network structure with ERGM, a stronger notion of privacy than the edge DP under which DWRR and SCEA operate.

graph synthesis↗
DOE OSTI2020

Differentially Private Generation of Social Networks via Exponential Random Graph Models

Many social networks contain sensitive relational information. One approach to protect the sensitive relational information while offering flexibility for social network research and analysis is to release synthetic social networks at a pre-specified privacy risk level, given the original observed network. In this work, we propose the DP-ERGM procedure that synthesizes networks that satisfy the differential privacy (DP) via the exponential random graph model (EGRM). We apply DP-ERGM to a college student friendship network and compare its original network information preservation in the generated private networks with two other approaches: differentially private DyadWise Randomized Response (DWRR) and Sanitization of the Conditional probability of Edge given Attribute classes (SCEA). The results suggest that DP-EGRM preserves the original information significantly better than DWRR and SCEA in both network statistics and inferences from ERGMs and latent space models. In addition, DP-ERGM satisfies the node DP, a stronger notion of privacy than the edge DP that DWRR and SCEA satisfy.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Local structure graph models with higher-order dependence

Local structure graph models (LSGMs) describe random graphs and networks as a Markov random field (MRF)—each graph edge has a specified conditional distribution dependent on explicit neighbourhoods of other graph edges. Centered parameterizations of LSGMs allow for direct control and interpretation of parameters for large- and small-scale structures (e.g., marginal means vs. dependence). Here, we extend this parameterization to account for triples of dependent edges and illustrate the importance of centered parameterizations for incorporating covariates and interpreting parameters. Using a MRF framework, common exponential random graph models are also shown to induce conditional distributions without centered parameterizations and thereby have undesirable features. This work attempts to advance graph models through conditional model specifications with modern parameterizations, covariates and higher-order dependencies.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

People who inject drugs in metropolitan Chicago: A meta-analysis of data from 1997-2017 to inform interventions and computational modeling toward hepatitis C microelimination

Progress toward hepatitis C virus (HCV) elimination in the United States is not on track to meet targets set by the World Health Organization, as the opioid crisis continues to drive both injection drug use and increasing HCV incidence. A pragmatic approach to achieving this is using a microelimination approach of focusing on high-risk populations such as people who inject drugs (PWID). Computational models are useful in understanding the complex interplay of individual, social, and structural level factors that might alter HCV incidence, prevalence, transmission, and treatment uptake to achieve HCV microelimination. However, these models need to be informed with realistic sociodemographic, risk behavior and network estimates on PWID. We conducted a meta-analysis of research studies spanning 20 years of research and interventions with PWID in metropolitan Chicago to produce parameters for a synthetic population for realistic computational models (e.g., agent-based models). We then fit an exponential random graph model (ERGM) using the network estimates from the meta-analysis in order to develop the network component of the synthetic population.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2024

Clustering and Cliques in Preferential Attachment Random Graphs with Edge Insertion

In this paper, we investigate the global clustering coefficient (a.k.a transitivity) and clique number of graphs generated by a preferential attachment random graph model with an additional feature of allowing edge connections between existing vertices. Specifically, at each time step t, either a new vertex is added with probability f(t), or an edge is added between two existing vertices with probability 1 – f(t). We establish concentration inequalities for the global clustering and clique number of the resulting graphs under the assumption that f(t) is a regularly varying function at infinity with index of regular variation –$\gamma$, where $\gamma$ $\in$ [0, 1). Finally, we also demonstrate an inverse relation between these two statistics: the clique number is essentially the reciprocal of the global clustering coefficient.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Preventing Failures By Dataset Shift Detection in Safety-Critical Graph Applications

Dataset shift refers to the problem where the input data distribution may change over time (e.g., between training and test stages). Since this can be a critical bottleneck in several safety-critical applications such as healthcare, drug-discovery, etc., dataset shift detection has become an important research issue in machine learning. Though several existing efforts have focused on image/video data, applications with graph-structured data have not received sufficient attention. Therefore, in this paper, we investigate the problem of detecting shifts in graph structured data through the lens of statistical hypothesis testing. Specifically, we propose a practical two-sample test based approach for shift detection in large-scale graph structured data. Our approach is very flexible in that it is suitable for both undirected and directed graphs, and eliminates the need for equal sample sizes. Using empirical studies, we demonstrate the effectiveness of the proposed test in detecting dataset shifts. We also corroborate these findings using real-world datasets, characterized by directed graphs and a large number of nodes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Classical combinatorial optimization scaling for random Ising models on 2D heavy-hex graphs

Motivated by near term quantum computing hardware limitations, combinatorial optimization problems that can be addressed by current quantum algorithms and noisy hardware with little or no overhead are used to probe capabilities of quantum algorithms such as the quantum approximate optimization algorithm. In this study, a specific class of near term quantum computing hardware defined combinatorial optimization problems, Ising models on heavy-hex graphs both with and without geometrically local cubic terms, are examined for their classical computational hardness via empirical computation time scaling quantification. Specifically the time-to-solution (TTS) metric using the classical heuristic simulated annealing is measured for finding optimal variable assignments (ground states), as well as the time required for the optimization software Gurobi to find an optimal variable assignment. Because of the sparsity of these Ising models, the classical algorithms are able to find optimal solutions efficiently even for large instances (i.e. 100 000 spin variables). The Ising models both with and without geometrically local cubic terms exhibit average-case linear-time or weakly quadratic scaling when solved exactly using Gurobi, and the Ising models with no cubic terms show evidence of exponential-time TTS scaling when sampled using simulated annealing. These findings point to the necessity of developing and testing more complex, namely more densely connected, optimization problems in order for quantum computing to ever have a practical advantage over classical computing. Our results are another illustration that different classical algorithms can indeed have exponentially different running times, thus making the identification of the best practical classical technique important in any quantum computing vs. classical computing comparison.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Position Papers for the ASCR Workshop on Cybersecurity and Privacy for Scientific Computing Ecosystems

At the request of the Department of Energy's (DOE) Office of Advanced Scientific Computing Research (ASCR), this program committee has been tasked with organizing a workshop to identify basic research needs in cybersecurity and privacy to better support DOE's science and energy mission. As part of the process, the program committee is soliciting community input in the form of position papers to help identify significant use cases, facility issues, and other barriers to enabling verifiably trustworthy computational science while preserving data confidentiality as appropriate for scientific workflows of interest to DOE. The program committee will review these position papers and based on the fit of their area of expertise and interest, selected contributors will have the opportunity to participate in the workshop currently planned as a virtual event November 3-5th, 2021. The thrust areas that will be explored by this workshop are the following: (1) Algorithms for secure, scalable, privacy-enhancing technologies and frameworks, including: Federated AI/ML, Differential privacy, Randomized algorithms, Adversarial modeling & simulation, Graph algorithms, and Formal methods; (2) Platforms to support the entire scientific-computing ecosystem, including edge computing for large-scale experiments, focusing on heterogeneous systems and distributed systems, including: Heterogeneous computing systems, Distributed computing systems, and Secure data architectures; and (3) Data workflows to allow agile use of data while preserving integrity and privacy, making the important properties verifiable either at runtime or post-computation, including: Integrity and provenance and Data management infrastructure. Topics that are out-of-scope for the workshop include discussing specific proposed solutions or areas that are clearly out of DOE's fundamental and applied-sciences mission scope, e.g., cryptography, enterprise security, and general-operations technology.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Accelerating computational fluid dynamics simulation of post-combustion carbon capture modeling with MeshGraphNets

Packed columns are commonly used in post-combustion processes to capture CO 2 emissions by providing enhanced contact area between a CO 2 -laden gas and CO 2 -absorbing solvent. To study and optimize solvent-based post-combustion carbon capture systems (CCSs), computational fluid dynamics (CFD) can be used to model the liquid–gas countercurrent flow hydrodynamics in these columns and derive key determinants of CO 2 -capture efficiency. However, the large design space of these systems hinders the application of CFD for design optimization due to its high computational cost. In contrast, data-driven modeling approaches can produce fast surrogates to study large-scale physics problems. We build our surrogates using MeshGraphNets (MGN), a graph neural network framework that efficiently learns and produces mesh-based simulations. We apply MGN to a random packed column modeled with over 160K graph nodes and a design space consisting of three key input parameters: solvent surface tension, inlet velocity, and contact angle. Our models can adapt to a wide range of these parameters and accurately predict the complex interactions within the system at rates over 1700 times faster than CFD, affirming its practicality in downstream design optimization tasks. This underscores the robustness and versatility of MGN in modeling complex fluid dynamics for large-scale CCS analyses.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A unified understanding of minimum lattice thermal conductivity

Here, we propose a first-principles model of minimum lattice thermal conductivity ($κ^{min}_L$) based on a unified theoretical treatment of thermal transport in crystals and glasses. We apply this model to thousands of inorganic compounds and find a universal behavior of $κ^{min}_L$ in crystals in the high-temperature limit: The isotropically averaged $κ^{min}_L$ is independent of structural complexity and bounded within a range from ~0.1 to ~2.6 W/(m K), in striking contrast to the conventional phonon gas model which predicts no lower bound. We unveil the underlying physics by showing that for a given parent compound, $κ^{min}_L$ is bounded from below by a value that is approximately insensitive to disorder, but the relative importance of different heat transport channels (phonon gas versus diffuson) depends strongly on the degree of disorder. Moreover, we propose that the diffuson-dominated $κ^{min}_L$ in complex and disordered compounds might be effectively approximated by the phonon gas model for an ordered compound by averaging out disorder and applying phonon unfolding. With these insights, we further bridge the knowledge gap between our model and the well-known Cahill–Watson–Pohl (CWP) model, rationalizing the successes and limitations of the CWP model in the absence of heat transfer mediated by diffusons. Finally, we construct graph network and random forest machine learning models to extend our predictions to all compounds within the Inorganic Crystal Structure Database (ICSD), which were validated against thermoelectric materials possessing experimentally measured ultralow κ L . Our work offers a unified understanding of $κ^{min}_L$, which can guide the rational engineering of materials to achieve .

42 ENGINEERING↗
DOE OSTI2024

Holographic tensor networks with bulk gauge symmetries

Abstract Tensor networks are useful toy models for understanding the structure of entanglement in holographic states and reconstruction of bulk operators within the entanglement wedge. They are, however, constrained to only prepare so-called “fixed-area states” with flat entanglement spectra, limiting their utility in understanding general features of holographic entanglement. Here, we overcome this limitation by constructing a variant of random tensor networks that enjoys bulk gauge symmetries. Our model includes a gauge theory on a general graph, whose gauge-invariant states are fed into a random tensor network. We show that the model satisfies the quantum-corrected Ryu-Takayanagi formula with a nontrivial area operator living in the center of a gauge-invariant algebra. We also demonstrate nontrivial,n-dependent contributions to the Rényi entropy and Rényi mutual information from this area operator, a feature shared by general holographic states.

Physics↗
NASA NTRS2016

Recurrence Rate and Magma Effusion Rate for the Latest Volcanism on Arsia Mons, Mars

Magmatism and volcanism have evolved the Martian lithosphere, surface, and climate throughout the history of Mars. Constraining the rates of magma generation and timing of volcanism on the surface clarifies the ways in which magma and volcanic activity have shaped these Martian systems. The ages of lava flows on other planets are often estimated using impact crater counts, assuming that the number and size-distribution of impact craters per unit area reflect the time the lava flow has been on the surface and exposed to potential impacts. Here we show that impact crater age model uncertainty is reduced by adding stratigraphic information observed at locations where neighboring lavas abut each other, and demonstrate the significance of this reduction in age uncertainty for understanding the history of a volcanic field comprising 29 vents in the 110-kilometer-diameter caldera of Arsia Mons, Mars. Each vent within this caldera produced lava flows several to tens of kilometers in length; these vents are likely among the youngest on Mars, since no impact craters in their lava flows are larger than 1 kilometer in diameter. First, we modeled the age of each vent with impact crater counts performed on their corresponding lava flows and found very large age uncertainties for the ages of individual vents, often spanning the estimated age for the entire volcanic field. The age model derived from impact crater counts alone is broad and unimodal, with estimated peak activity in the field around 130Ma (megaannum, 1 million years). Next we applied our volcano event age model (VEAM), which uses a directed graph of stratigraphic relationships and random sampling of the impact crater age determinations to create alternative age models. Monte Carlo simulation was used to create 10,000 possible vent age sets. The recurrence rate of volcanism is calculated for each possible age set, and these rates are combined to calculate the median recurrence rate of all simulations. Applying this approach to the 29 volcanic vents, volcanism likely began around 200-300Ma then first peaked around 150Ma, with an average production rate of 0.4 vents per Myr (million years). The recurrence rate estimated including stratigraphic data is distinctly bimodal, with a second, lower peak in activity around 100Ma. Volcanism then waned until the final vents were produced 10-90Ma. Based on this model, volume flux is also bimodal, reached a peak rate of 1-8 cubic kilometers per million years by 150Ma and remained above half this rate until about 90Ma, after which the volume flux diminished greatly. The onset of effusive volcanism from 200-150Ma might be due to a transition of volcanic style away from explosive volcanism that emplaced tephra on the western flank of Arsia Mons, while the waning of volcanism after the 150Ma peak might represent a larger-scale diminishing of volcanic activity at Arsia Mons related to the emplacement of flank apron lavas.

Richardson, Jacob A.↗
DOE OSTI2024

Short-depth QAOA circuits and quantum annealing on higher-order ising models

Abstract We present a direct comparison between QAOA (Quantum Alternating Operator Ansatz), and QA (Quantum Annealing) on 127 qubit problem instances. QAOA with p = 1, 2 rounds is executed on the 127 qubit heavy-hex graph gate-model quantum computer ibm_washington, using on-device grid-searches for angle finding, and QA is executed on two Pegasus-chip D-Wave quantum annealers. The problems are random Ising models whose connectivity matches heavy-hex graphs and the Pegasus graph connectivity, and optionally include hardware-compatible cubic terms ( Z Z Z terms). The QAOA circuits are heavily optimized and of extremely short depth, with a CNOT depth of 6 per round, which allows whole chip usage of the heavy-hex lattice. QAOA and QA are both compared against simulated annealing and the optimal solutions are computed exactly using CPLEX. The noiseless mean QAOA expectation values for p = 1, 2 are computed using classical light-cone based simulations. We find QA outperforms QAOA on the evaluated devices.

127 qubits↗
DOE OSTI2024

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↗