Metraipolis › archive › dc_e01faeae765f

From Graphs to Feeders: Constraint-Guided Diffusion for Rule-Compliant Feeder Generation — arXiv:2609.29879

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.29879
License (as archived)
CC0-1.0
Archived
2026-10-08T05:26:12.430Z
SHA-256 of the archived text
c88dc75d18434ba3d708e04b8a2f68bbf5d623aa2240d799ac1d07fe2d19d3d6
Stable URL of this page
https://metraipolis.com/documento/dc_e01faeae765f

How to cite

From Graphs to Feeders: Constraint-Guided Diffusion for Rule-Compliant Feeder Generation — arXiv:2609.29879 — arXiv (en), https://arxiv.org/abs/2609.29879 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e01faeae765f (Metraipolis archive dc_e01faeae765f, sha256 c88dc75d18434ba3d708e04b8a2f68bbf5d623aa2240d799ac1d07fe2d19d3d6)
BibTeX
@misc{dce01faeae765f,
  title = {From Graphs to Feeders: Constraint-Guided Diffusion for Rule-Compliant Feeder Generation — arXiv:2609.29879},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.29879},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e01faeae765f; sha256 c88dc75d18434ba3d708e04b8a2f68bbf5d623aa2240d799ac1d07fe2d19d3d6},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.29879. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Generative modeling approaches often focus on recovering broad statistical characteristics from the training data. In the context of graph generation, this may refer to degree distributions, clustering coefficients, or spectral properties. However, generating usable distribution feeders when detailed feeder models are unavailable requires more than matching generic graph statistics: the sampled topology must also obey electrical compatibility and radiality rules. We therefore formulate feeder synthesis as a constraint-guided graph generation problem and propose the Power-Grid-constrained Discrete Denoising Diffusion model, PG-DiGress, which learns categorical node and edge patterns from feeder data, while respecting domain-specific rules. Specifically, it injects feeder constraints into the reverse diffusion process through soft masks that suppress incompatible edge classes during denoising, followed by a final projection step that rebuilds a connected, rule-compliant feeder graph. We evaluate PG-DiGress using graph-distribution similarity, feeder-rule satisfaction, structural validity, and downstream model construction. Compared with the unconstrained baseline, PG-DiGress increases the strict feeder pass rate from 13.7% to 96.8%. We also successfully convert the generated graphs into executable feeder models for downstream analysis.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-25 in cs.LG).
Categorie arXiv: Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2609.29879 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T04:50:39.488Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).