REVIEW 2 cited by
Deep Generative Graph Distribution Learning for Synthetic Power Grids
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Power system studies require the topological structures of real-world power networks; however, such data is confidential due to important security concerns. Thus, power grid synthesis (PGS), i.e., creating realistic power grids that imitate actual power networks, has gained significant attention. In this letter, we cast PGS into a graph distribution learning (GDL) problem where the probability distribution functions (PDFs) of the nodes (buses) and edges (lines) are captured. A novel deep GDL (DeepGDL) model is proposed to learn the topological patterns of buses/lines with their physical features (e.g., power injection and line impedance). Having a deep nonlinear recurrent structure, DeepGDL understands complex nonlinear topological properties and captures the graph PDF. Sampling from the obtained PDF, we are able to create a large set of realistic networks that all resemble the original power grid. Simulation results show the significant accuracy of our created synthetic power grids in terms of various topological metrics and power flow measurements.
Forward citations
Cited by 2 Pith papers
-
Operationally Feasible Synthetic Power-Grid Scenarios via Learning the AC-Operable Joint Distribution
A hierarchical diffusion framework with a PYPOWER-based feasibility reward generates AC-operable power-grid scenarios directly, without post-generation correction.
-
A Metric for the Balance of Information in Graph Learning
NNRD, the log average ratio of performance under feature noise to performance under structure noise, is proposed as a dataset-level indicator of which information source a molecular graph task favors.
Discussion (0). Continue with ORCID to comment.