PowerGrow: Feasible Co-Growth of Structures and Dynamics for Power Grid Synthesis

• URL: http://arxiv.org/abs/2509.12212v1
• Date: Fri, 29 Aug 2025 01:47:27 GMT
• Title: PowerGrow: Feasible Co-Growth of Structures and Dynamics for Power Grid Synthesis
• Authors: Xinyu He, Chenhan Xiao, Haoran Li, Ruizhong Qiu, Zhe Xu, Yang Weng, Jingrui He, Hanghang Tong,
• Abstract summary: We present PowerGrow, a co-generative framework that significantly reduces computational overhead while maintaining operational validity.<n> Experiments across benchmark settings show that PowerGrow outperforms prior diffusion models in fidelity and diversity.<n>This demonstrates its ability to generate operationally valid and realistic power grid scenarios.
• Score: 75.14189839277928
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Modern power systems are becoming increasingly dynamic, with changing topologies and time-varying loads driven by renewable energy variability, electric vehicle adoption, and active grid reconfiguration. Despite these changes, publicly available test cases remain scarce, due to security concerns and the significant effort required to anonymize real systems. Such limitations call for generative tools that can jointly synthesize grid structure and nodal dynamics. However, modeling the joint distribution of network topology, branch attributes, bus properties, and dynamic load profiles remains a major challenge, while preserving physical feasibility and avoiding prohibitive computational costs. We present PowerGrow, a co-generative framework that significantly reduces computational overhead while maintaining operational validity. The core idea is dependence decomposition: the complex joint distribution is factorized into a chain of conditional distributions over feasible grid topologies, time-series bus loads, and other system attributes, leveraging their mutual dependencies. By constraining the generation process at each stage, we implement a hierarchical graph beta-diffusion process for structural synthesis, paired with a temporal autoencoder that embeds time-series data into a compact latent space, improving both training stability and sample fidelity. Experiments across benchmark settings show that PowerGrow not only outperforms prior diffusion models in fidelity and diversity but also achieves a 98.9\% power flow convergence rate and improved N-1 contingency resilience. This demonstrates its ability to generate operationally valid and realistic power grid scenarios.

Related papers

• TGSBM: Transformer-Guided Stochastic Block Model for Link Prediction [13.840265247620556]
  Link prediction is a cornerstone of the Web ecosystem, powering applications from recommendation and search to knowledge graph completion and collaboration forecasting.<n>Existing approaches face notable limitations: traditional graph neural networks struggle to capture global dependencies, while recent graph transformers achieve strong performance but incur lack of interpretable structural structure.<n>We propose text-Guided Block Model, a framework that integrates the principled generative structure of Overlapping Block Models with the power of sparse Graph Transformers.
  arXiv  Detail & Related papers  (2026-01-28T14:32:24Z)
• Smooth embeddings in contracting recurrent networks driven by regular dynamics: A synthesis for neural representation [45.88028371034407]
  Recent empirical work has documented topology-preserving latent organization in trained recurrent models.<n>Recent theoretical results in reservoir computing establish conditions under which the synchronization map is an embedding.<n>Our contribution is an integrated framework that assembles generalized synchronization and embedding guarantees for contracting reservoirs.
  arXiv  Detail & Related papers  (2026-01-26T23:10:39Z)
• A Dynamic Recurrent Adjacency Memory Network for Mixed-Generation Power System Stability Forecasting [2.053651537270821]
  Dynamic recurrent adjacency memory network (DRAMN) combines physics-informed analysis with deep learning for real-time power system stability forecasting.<n>DRAMN achieves state-of-the-art accuracy while providing enhanced interpretability for power system operators.
  arXiv  Detail & Related papers  (2025-11-02T05:40:16Z)
• Power Grid Control with Graph-Based Distributed Reinforcement Learning [60.49805771047161]
  This work advances a graph-based distributed reinforcement learning framework for real-time, scalable grid management.<n>A Graph Neural Network (GNN) is employed to encode the network's topological information within the single low-level agent's observation.<n>Experiments on the Grid2Op simulation environment show the effectiveness of the approach.
  arXiv  Detail & Related papers  (2025-09-02T22:17:25Z)
• Grid-Agent: An LLM-Powered Multi-Agent System for Power Grid Control [4.3210078529580045]
  This paper introduces Grid-Agent, an autonomous AI-driven framework to detect and remediate grid violations.<n>Grid-Agent integrates semantic reasoning with numerical precision through modular agents.<n>Experiments on IEEE and CIGRE benchmark networks demonstrate superior mitigation performance.
  arXiv  Detail & Related papers  (2025-08-07T01:10:28Z)
• Generative Pre-trained Autoregressive Diffusion Transformer [74.25668109048418]
  GPDiT is a Generative Pre-trained Autoregressive Diffusion Transformer.<n>It unifies the strengths of diffusion and autoregressive modeling for long-range video synthesis.<n>It autoregressively predicts future latent frames using a diffusion loss, enabling natural modeling of motion dynamics.
  arXiv  Detail & Related papers  (2025-05-12T08:32:39Z)
• Leveraging Low-Rank and Sparse Recurrent Connectivity for Robust Closed-Loop Control [63.310780486820796]
  We show how a parameterization of recurrent connectivity influences robustness in closed-loop settings. We find that closed-form continuous-time neural networks (CfCs) with fewer parameters can outperform their full-rank, fully-connected counterparts.
  arXiv  Detail & Related papers  (2023-10-05T21:44:18Z)
• Long-term Wind Power Forecasting with Hierarchical Spatial-Temporal Transformer [112.12271800369741]
  Wind power is attracting increasing attention around the world due to its renewable, pollution-free, and other advantages. Accurate wind power forecasting (WPF) can effectively reduce power fluctuations in power system operations. Existing methods are mainly designed for short-term predictions and lack effective spatial-temporal feature augmentation.
  arXiv  Detail & Related papers  (2023-05-30T04:03:15Z)
• An Interpretable Approach to Load Profile Forecasting in Power Grids using Galerkin-Approximated Koopman Pseudospectra [0.3160121582090025]
  This paper presents an interpretable machine learning approach that characterizes dynamics within an operator-theoretic framework for electricity forecasting in power grids.<n>We represent the dynamics of load data using the Koopman operator, which provides a linear, infinite-dimensional representation of the nonlinear dynamics.<n>Our approach captures temporal coherent patterns due to seasonal changes and finer time scales, such as time of day and day of the week.
  arXiv  Detail & Related papers  (2023-04-16T16:56:52Z)
• Evaluating Distribution System Reliability with Hyperstructures Graph Convolutional Nets [74.51865676466056]
  We show how graph convolutional networks and hyperstructures representation learning framework can be employed for accurate, reliable, and computationally efficient distribution grid planning. Our numerical experiments show that the proposed Hyper-GCNNs approach yields substantial gains in computational efficiency.
  arXiv  Detail & Related papers  (2022-11-14T01:29:09Z)
• Predicting Dynamic Stability from Static Features in Power Grid Models using Machine Learning [0.0]
  We propose a combination of network science metrics and machine learning models to predict the risk of desynchronisation events. We train and test such models on simulated data from several synthetic test grids. We find that the integrated models are capable of predicting desynchronisation events with an average precision greater than $0.996$ when averaging over all data sets.
  arXiv  Detail & Related papers  (2022-10-17T17:16:48Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.