SEARCH · Engineering Papers
Results for “Graph Theory in Probability”
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.
Equivariant, safe and sensitive — graph networks for new physics
This study introduces a novel Graph Neural Network (GNN) architecture that leverages infrared and collinear (IRC) safety and equivariance to enhance the analysis of collider data for Beyond the Standard Model (BSM) discoveries. By integrating equivariance in the rapidity-azimuth plane with IRC-safe principles, our model significantly reduces computational overhead while ensuring theoretical consistency in identifying BSM scenarios amidst Quantum Chromodynamics backgrounds. The proposed GNN architecture demonstrates superior performance in tagging semi-visible jets, highlighting its potential as a robust tool for advancing BSM search strategies at high-energy colliders.
Efficient 3D Molecular Design with an E(3) Invariant Transformer VAE
This work introduces a three-dimensional (3D) invariant graph-to-string transformer variational autoencoders (VAE) (Vagrant) for generating molecules with accurate density functional theory (DFT)-level properties. Vagrant learns to model the joint probability distribution of a 3D molecular structure and its properties by encoding molecular structures into a 3D-aware latent space. Directed navigation through this latent space implicitly optimizes the 3D structure of a molecule, and the latent embedding can be used to condition a generative transformer to predict the candidate structure as a one-dimensional (1D) sequence. Additionally, we introduce two novel sampling methods that exploit the latent characteristics of a VAE to improve performance. Here, we show that our method outperforms comparable 3D autoregressive and diffusion methods for predicting quantum chemical property values of novel molecules in terms of both sample quality and computational efficiency.
Defender Policy Evaluation and Resource Allocation With MITRE ATT&CK Data and Evaluations.
Abstract not provided.
Systematic planning of moving target defence for maximising detection effectiveness against false data injection attacks in smart grid
Abstract Moving target defence (MTD) has been gaining traction to thwart false data injection attacks against state estimation (SE) in the power grid. MTD actively perturbs the reactance of transmission lines equipped with distributed flexible AC transmission system (D‐FACTS) devices to falsify the attacker's knowledge about the system configuration. However, the existing literature has not systematically studied what influences the detection effectiveness of MTD and how it can be improved based on the topology analysis. These problems are tackled here from the perspective of an MTD plan in which the D‐FACTS placement is determined. We first exploit the relation between the rank of the composite matrix and the detecting effectiveness. Then, we rigorously derive upper and lower bounds on the attack detecting probability of MTDs with a given rank of the composite matrix. Furthermore, we analyse existing planning methods and highlight the importance of bus coverage by D‐FACTS devices. To improve the detection effectiveness, we propose a novel graph theory–based planning algorithm to retain the maximum rank of the composite matrix while covering all necessary buses. Comparative results on multiple systems show the high detecting effectiveness of the proposed algorithm in both DC‐ and AC‐SE.
Max-independent set and the quantum alternating operator ansatz
he maximum-independent set (MIS) problem of graph theory using the quantum alternating operator ansatz is studied. We perform simulations on the Rigetti Forest simulator for the square ring, K 2,3 , and K3,3 graphs and analyze the dependence of the algorithm on the depth of the circuit and initial states. The probability distribution of observation of the feasible states representing maximum-independent sets is observed to be asymmetric for the MIS problem, which is unlike the Max-Cut problem where the probability distribution of feasible states is symmetric. For asymmetric graphs, it is shown that the algorithm clearly favors the independent set with the larger number of elements even for finite circuit depth. Finally, we also compare the approximation ratios for the algorithm when we choose different initial states for the square ring graph and show that it is dependent on the choice of the initial state.
Beyond the universal Dyson singularity for 1-D chains with hopping disorder
We study a simple non-interacting nearest neighbor tight-binding model in one dimension with disorder, where the hopping terms are chosen randomly. This model exhibits a well-known singularity at the band center both in the density of states and localization length. If the probability distribution of the hopping terms is well-behaved, then the singularities exhibit universal behavior, the functional form of which was first discovered by Freeman Dyson in the context of a chain of classical harmonic oscillators. We show here that this universal form can be violated in a tunable manner if the hopping elements are chosen from a divergent probability distribution. We also demonstrate a connection between a breakdown of universality in this quantum problem and an analogous scenario in the classical domain — that of random walks and diffusion with anomalous exponents.
Analysis and Mitigation of Cascading Failures Using a Stochastic Interaction Graph with Eigen-analysis
In studies on complex network systems using graph theory, eigen-analysis is typically performed on an undirected graph model of the network. However, when analyzing cascading failures in a power system, the interactions among failures suggest the need for a directed graph beyond the topology of the power system to model directions of failure propagation. To accurately quantify failure interactions for effective mitigation strategies, this paper proposes a stochastic interaction graph model and associated eigen-analysis. Different types of modes on failure propagations are defined and characterized by the eigenvalues of a stochastic interaction matrix, whose absolute values are unity, zero, or in between. Finding and interpreting these modes helps identify the probable patterns of failure propagation, either local or widespread, and the participating components based on eigenvectors. Then, by lowering the failure probabilities of critical components highly participating in a mode of widespread failures, cascading can be mitigated. Here, the validity of the proposed stochastic interaction graph model, eigen-analysis and the resulting mitigation strategies is demonstrated using simulated cascading failure data on an NPCC 140-bus system.
Scaling quantum approximate optimization on near-term hardware
The quantum approximate optimization algorithm (QAOA) is an approach for near-term quantum computers to potentially demonstrate computational advantage in solving combinatorial optimization problems. However, the viability of the QAOA depends on how its performance and resource requirements scale with problem size and complexity for realistic hardware implementations. Here, we quantify scaling of the expected resource requirements by synthesizing optimized circuits for hardware architectures with varying levels of connectivity. Assuming noisy gate operations, we estimate the number of measurements needed to sample the output of the idealized QAOA circuit with high probability. We show the number of measurements, and hence total time to solution, grows exponentially in problem size and problem graph degree as well as depth of the QAOA ansatz, gate infidelities, and inverse hardware graph degree. These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.
Faster Johnson–Lindenstrauss transforms via Kronecker products
The Kronecker product is an important matrix operation with a wide range of applications in signal processing, graph theory, quantum computing and deep learning. In this work, we introduce a generalization of the fast Johnson–Lindenstrauss projection for embedding vectors with Kronecker product structure, the Kronecker fast Johnson–Lindenstrauss transform (KFJLT). The KFJLT reduces the embedding cost by an exponential factor of the standard fast Johnson–Lindenstrauss transform’s cost when applied to vectors with Kronecker structure, by avoiding explicitly forming the full Kronecker products. Here, we prove that this computational gain comes with only a small price in embedding power: consider a finite set of $p$ points in a tensor product of $d$ constituent Euclidean spaces $\bigotimes _{k=d}^{1}{\mathbb{R}}^{n_k}$, and let $N = \prod _{k=1}^{d}n_k$. With high probability, a random KFJLT matrix of dimension $m \times N$ embeds the set of points up to multiplicative distortion $(1\pm \varepsilon )$ provided $m \gtrsim \varepsilon ^{-2} \, \log ^{2d - 1} (p) \, \log N$. We conclude by describing a direct application of the KFJLT to the efficient solution of large-scale Kronecker-structured least squares problems for fitting the CP tensor decomposition.
Resilience of electric utilities during the COVID-19 pandemic in the framework of the CIGRE definition of Power System Resilience
Resilience is a vital concept in engineering, business, and natural sciences, and is a measure of the ability of an entity to withstand High Impact Low Probability (HILP) events. During the COVID-19 pandemic, which started in late 2019/early 2020, power system utilities around the globe have responded in effective and efficient ways to enhance the resilience of their organisations, both in terms of real-time operations and prudent management of its infrastructure, in order to continue their mandate in providing reliable supply to meet customer demands. Here, this paper presents the CIGRE definition for power system resilience, established by the C4.47 Working Group in 2018, and demonstrates the application of resilience-oriented thinking within the electrical sector. The response and recovery efforts are described, with respect to the key actionable measures integral to the power system resilience definition, taken before, during and after the COVID-19 pandemic. A practical conceptual framework is also presented for thinking about resilience in terms of three key components of resilience strategies: organisational, infrastructure and operational resilience. The paper also discusses the different strategies adopted in response to COVID-19, based on the C4.47 members’ experiences during the pandemic. Finally, a case study is presented, which proves the effectiveness of a set of response measures, using graph theory and the characteristics of the staff-asset interactions.
Guest Editorial: Planning and operation of resilient distribution system for integrated multi-energy
Resilience is the ability of power systems to prepare for and adapt to low-probability, high-impact incidents and withstand and recover rapidly from disruptions. With the ageing of electricity distribution infrastructure and increasing threats of weather-related incidents and natural disasters, the need to effectively enhance the resilience of the electricity distribution system has become urgent and has attracted worldwide attention. Although there are an increasing number of publications related to enhancing resilience strategies, resilience is an emerging concept in power systems. Existing practices are mostly focused on deploying distributed energy resources (DERs) and microgrids, hardening the existing infrastructures and building redundant capacities. However, from a broader perspective, resilience enhancement of power distribution system is a systematic engineering, involving long-term system planning and upgrading (e.g., deployment of smart grid technologies and intelligent switches), short-term proactive scheduling, real-time robust and resilient control of DERs, and post-event restoration and recovery strategies. Based on this point, this Special Issue in IET Energy System Integration focuses on soliciting the most recent and original technologies, scheduling and control strategies for improving the resilience of power distribution system. Eight papers are presented in this Special Issue, covering various aspects related to resilience enhancement of power distribution system, including fault-tolerant frequency measurement, robust scheduling of integrated electricity and district heating systems, robust control of DERs, efficient methods for safety verification as well as novel graph theory-based approach to restore the distribution systems after multiple simultaneous faults. A brief introduction of these 8 papers is provided below.