Graph neural network for Hamiltonian-based material property prediction
Not provided.
Computer Science↗
SEARCH · Engineering Papers
Results for “Graph properties”
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.
Generating and Analyzing Program Call Graphs using Ontology
Call graph or caller-callee relationships have been used for various kinds of static program analysis, performance analysis and profiling, and for program safety or security analysis such as detecting anomalies of program execution or code injection attacks. However, different tools generate call graphs in different formats, which prevents efficient reuse of call graph results. In this paper, we present an approach of using ontology and resource description framework (RDF) to create knowledge graphs for specifying call graphs to facilitate the construction of full-fledged and complex call graphs of computer programs, realizing more interoperable and scalable program analyses than conventional approaches. We create a formal ontology-based specification of call graph information to capture concepts and properties of both static and dynamic call graphs so different tools can collaboratively contribute to more comprehensive analysis results. Our experiments show that ontology enables merging of call graphs generated from different tools and flexible queries using a standard query interface. Index Terms—Callgraph, ontology, knowl
Dorta, E.↗
Reduced-Order Models of Static Power Grids based on Spectral Clustering
For large-scale interconnected power systems that cover large geographical areas, certain electrical studies are required so that appropriate decisions ensure system reliability and low cost. For such studies, it is often neither practical nor necessary to model in detail the entire power system, which is increasingly complex due to a more diverse range of grid assets to choose from in both short and long-term planning. The goal of this paper is to present a methodology to reduce the order of large-scale power networks based on spectral graph theory given that current methods for static network reduction are not scalable. A brief analysis of some spectral clustering properties to determine which graph Laplacian matrix should be used and why is included. The analysis shows that the utilization of the normalized graph Laplacian is more advantageous for clustering purposes. Techniques are proposed to approximate cost functions for the aggregated generators. This is done via linear regression. The reduced-order model obtained with the proposed methodology has an accuracy above 94% and solves the scalability issue commonly present in other reduction methods. If the utilization of the reduced-order model is either constrained to load levels above mid-peak demand, or cost functions of aggregated units are approximated via a piecewise quadratic approach, then the error distribution is in the order of 10^-3. .
Baquedano-Aguilar, Mario D.↗
Graph Generator Survey
The benchmarking effort within the Extreme Scale Systems Center at Oak Ridge National Laboratory seeks to provide High Performance Computing benchmarks and test suites of interest to the DoD sponsor. The work described in this report is a part of the effort focusing on graph generation. A previously developed benchmark, SystemBurn, allowed the emulation of different application behavior profiles within a single framework. To complement this effort, similar capabilities are desired for graph-centric problems. This report examines existing synthetic graph generator implementations in preparation for further study on the properties of their generated synthetic graphs.
analytics↗
The Graph Laplacian and the Dynamics of Complex Networks [Slides]
In this talk, we explore the structure of networks from a spectral graph-theoretic perspective by analyzing the properties of the Laplacian matrix associated with the graph induced by a network. We will see how the eigenvalues of the graph Laplacian relate to the underlying network structure and dynamics and provides insight into a phenomenon frequently observed in real world networks - the emergence of collective behavior from purely local interactions seen in the coordinated motion of animals and phase transitions in biological networks, to name a few.
97 MATHEMATICS AND COMPUTING↗
On Edge Exchangeable Random Graphs
We study a recent model for edge exchangeable random graphs introduced by Crane and Dempsey; in particular we study asymptotic properties of the random simple graph obtained by merging multiple edges. We study a number of examples, and show that the model can produce dense, sparse and extremely sparse random graphs. One example yields a power-law degree distribution. We give some examples where the random graph is dense and converges a.s. in the sense of graph limit theory, but also an example where a.s. every graph limit is the limit of some subsequence. Another example is sparse and yields convergence to a non-integrable generalized graphon defined on (0,∞).
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Spectra of perfect state transfer Hamiltonians on fractal-like graphs
Abstract In this paper we study the spectral features, on fractal-like graphs, of Hamiltonians which exhibit the special property of perfect quantum state transfer (PQST): the transmission of quantum states without dissipation. The essential goal is to develop the theoretical framework for understanding the interplay between PQST, spectral properties, and the geometry of the underlying graph, in order to design novel protocols for applications in quantum information science. We present a new lifting and gluing construction, and use this to prove results concerning an inductive spectral structure, applicable to a wide variety of fractal-like graphs. We illustrate this construction with explicit examples for several classes of diamond graphs.
Physics↗
Powers of magnetic graph matrix: Fourier spectrum, walk compression, and applications
Magnetic graphs, originally developed to model quantum systems under magnetic fields, have recently emerged as a powerful framework for analyzing complex directed networks. Existing research has primarily used the spectral properties of the magnetic graph matrix to study global and stationary network features. However, their capacity to model local, nonequilibrium behaviors, often described by matrix powers, remains largely unexplored. We present a combinatorial interpretation of the magnetic graph matrix powers through directed walk profiles—counts of graph walks indexed by the number of edge reversals. Crucially, we establish that walk profiles correspond to a Fourier transform of magnetic matrix powers. The connection allows exact reconstruction of walk profiles from magnetic matrix powers at multiple discrete potentials, and more importantly, an even smaller number of potentials often suffices for accurate approximate reconstruction in real networks. This shows the empirical compressibility of the information captured by the magnetic matrix. This fresh perspective suggests further applications; for example, we illustrate how powers of the magnetic matrix can identify frustrated directed cycles (e.g., feedforward loops) and can be effectively employed for link prediction by encoding local structural details in directed graphs.
complex networks↗
HPCGraph v. 0.1
Graphs occur in several places in real world from road networks, social networks and scientific simulations. HPC Graph is a graph analysis software to analyze the properties such as connectivity, communities etc in extreme scale graphs.
Slota, George↗
Optimizing Thermodynamic Properties of High Entropy Alloys and Hydrides with Lattice Graph Neural Network Models
Explore the source record for details and available documents.
Witman, Matthew David↗
Data mining for materials design: A computational study of single molecule magnet
We develop a method that combines data mining and first principles calculation to guide the designing of distorted cubane Mn{sup 4+} Mn {sub 3}{sup 3+} single molecule magnets. The essential idea of the method is a process consisting of sparse regressions and cross-validation for analyzing calculated data of the materials. The method allows us to demonstrate that the exchange coupling between Mn{sup 4+} and Mn{sup 3+} ions can be predicted from the electronegativities of constituent ligands and the structural features of the molecule by a linear regression model with high accuracy. The relations between the structural features and magnetic properties of the materials are quantitatively and consistently evaluated and presented by a graph. We also discuss the properties of the materials and guide the material design basing on the obtained results.
36 MATERIALS SCIENCE↗
Communication: Theoretical prediction of free-energy landscapes for complex self-assembly
We present a technique for calculating free-energy profiles for the nucleation of multicomponent structures that contain as many species as building blocks. We find that a key factor is the topology of the graph describing the connectivity of the target assembly. By considering the designed interactions separately from weaker, incidental interactions, our approach yields predictions for the equilibrium yield and nucleation barriers. These predictions are in good agreement with corresponding Monte Carlo simulations. We show that a few fundamental properties of the connectivity graph determine the most prominent features of the assembly thermodynamics. Surprisingly, we find that polydispersity in the strengths of the designed interactions stabilizes intermediate structures and can be used to sculpt the free-energy landscape for self-assembly. Finally, we demonstrate that weak incidental interactions can preclude assembly at equilibrium due to the combinatorial possibilities for incorrect association.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Deep learning workflow for the inverse design of molecules with specific optoelectronic properties
The inverse design of novel molecules with a desirable optoelectronic property requires consideration of the vast chemical spaces associated with varying chemical composition and molecular size. First principles-based property predictions have become increasingly helpful for assisting the selection of promising candidate chemical species for subsequent experimental validation. However, a brute-force computational screening of the entire chemical space is decidedly impossible. To alleviate the computational burden and accelerate rational molecular design, we here present an iterative deep learning workflow that combines (i) the density-functional tight-binding method for dynamic generation of property training data, (ii) a graph convolutional neural network surrogate model for rapid and reliable predictions of chemical and physical properties, and (iii) a masked language model. As proof of principle, we employ our workflow in the iterative generation of novel molecules with a target energy gap between the highest occupied molecular orbital (HOMO) and the lowest unoccupied molecular orbital (LUMO).
97 MATHEMATICS AND COMPUTING↗
Crystal Graph Convolutional Neural Networks for an Accurate and Interpretable Prediction of Material Properties
The use of machine learning methods for accelerating the design of crystalline materials usually requires manually constructed feature vectors or complex transformation of atom coordinates to input the crystal structure, which either constrains the model to certain crystal types or makes it difficult to provide chemical insights. Here, we develop a crystal graph convolutional neural networks framework to directly learn material properties from the connection of atoms in the crystal, providing a universal and interpretable representation of crystalline materials. Our method provides a highly accurate prediction of density functional theory calculated properties for eight different properties of crystals with various structure types and compositions after being trained with 10 4 data points. Further, our framework is interpretable because one can extract the contributions from local chemical environments to global properties. Using an example of perovskites, we show how this information can be utilized to discover empirical rules for materials design.
36 MATERIALS SCIENCE↗
Graph coarsening: from scientific computing to machine learning
Abstract The general method of graph coarsening or graph reduction has been a remarkably useful and ubiquitous tool in scientific computing and it is now just starting to have a similar impact in machine learning. The goal of this paper is to take a broad look into coarsening techniques that have been successfully deployed in scientific computing and see how similar principles are finding their way in more recent applications related to machine learning. In scientific computing, coarsening plays a central role in algebraic multigrid methods as well as the related class of multilevel incomplete LU factorizations. In machine learning, graph coarsening goes under various names, e.g., graph downsampling or graph reduction. Its goal in most cases is to replace some original graph by one which has fewer nodes, but whose structure and characteristics are similar to those of the original graph. As will be seen, a common strategy in these methods is to rely on spectral properties to define the coarse graph.
Chen, Jie↗
Trust from the past: Bayesian Personalized Ranking based Link Prediction in Knowledge Graphs
Estimating the confidence for a link is a critical task for Knowledge Graph construction. Link prediction, or predicting the likelihood of a link in a knowledge graph based on prior state is a key research direction within this area. We propose a Latent Feature Embedding based link recommendation model for prediction task and utilize Bayesian Personalized Ranking based optimization technique for learning models for each predicate. Experimental results on large-scale knowledge bases such as YAGO2 show that our approach achieves substantially higher performance than several state-of-art approaches. Furthermore, we also study the performance of the link prediction algorithm in terms of topological properties of the Knowledge Graph and present a linear regression model to reason about its expected level of accuracy.
knowledge graphs↗
PCP consensus protein/peptide alphavirus antigens stimulate broad spectrum neutralizing antibodies
Vaccines based on proteins and peptides may be safer and if calculated based on many sequences, more broad-spectrum than those designed based on single strains. Physicochemical Property Consensus (PCP con ) alphavirus (AV) antigens from the B-domain of the E2 envelope protein were designed, synthesized recombinantly and shown to be immunogenic (i.e. sera after inoculation detected the antigen in dotspots and ELISA). Antibodies in sera after inoculation with B-region antigens based on individual AV species (eastern or Venezuelan equine encephalitis (EEEV con , VEEV con ), or chikungunya (CHIKV con ) bound only their cognate protein, while those designed against multiple species (Mosaik con and EVC con ) recognized all three serotype specific antigens. The VEEV con and EEEV con sera only showed antiviral activity against their related strains (in plaque reduction neutralization assays (PRNT 50/80 ). Peptides designed to surface exposed areas of the E2-A-domain of CHIKV con were added to CHIKV con inocula to provide anti-CHIKV antibodies. EVC con , based on three different alphavirus species, combined with E2-A-domain peptides from AllAV con , a PCPcon of 24 diverse AV, generated broad spectrum, antiviral antibodies against VEEV, EEEV and CHIKV, AV with less than 35% amino acid identity to each other (>65% diversity). This is a promising start to a molecularly defined vaccine against all AV. A further study with these antigens can illuminate what areas are most important for a robust immune response, resistant to mutations in rapidly evolving viruses. The validated computational methods can also be used to design broad spectrum antigens against many other pathogen families.
59 BASIC BIOLOGICAL SCIENCES↗
Algebraic Methods of the Study of Quantum Information Transfer Channels
Kraus representation of quantum information transfer channels is widely used in practice. We present examples of Kraus decompositions for channels that possess the covariance property with respect to the maximal commutative group of unitary operators. We show that in some problems (for example, the problem on the estimate of the minimal output entropy of the channel), the choice of a Kraus representation with nonminimal number of Kraus operators is relevant. We also present certain algebraic properties of noncommutative operator graphs generated by Kraus operators for the case of quantum channels that demonstrate the superactivation phenomenon.
97 MATHEMATICS AND COMPUTING↗