Learning and Structurally Validating Simulation Scenario Continuations in Dynamic Graph Systems
Not on the map. Why?
Abstract (arXiv)
Data-driven generative models can extend partially observed simulation trajectories into ensembles of alternative future scenarios. However, consistency with a learned trajectory distribution does not ensure that generated continuations satisfy the structural conditions of the simulated system. This paper presents a method for learned scenario continuation and post-generation structural validation in dynamic graph simulations. A conditional diffusion model generates future graph-state trajectories from partial histories, while an external symbolic layer evaluates each continuation using a Boolean admissibility indicator and a continuous violation score. This information supports hard filtering and soft weighting, with optional projection considered as a deterministic repair baseline. The method is evaluated on two controlled dynamic-graph regimes sharing the same continuation architecture and training protocol but differing in dimensionality and dependency complexity. Evaluation considers invalid probability mass, scenario retention, effective sample size, diversity, robustness, and calibration. In the compact positive-control regime, unconstrained invalid mass is 0.002996, indicating near-complete overlap between the learned and admissible scenario spaces. In the medium-complexity regime, invalid mass rises to 0.155929. Hard filtering removes all invalid scenarios while retaining 84.4% of generated continuations. Soft weighting preserves an effective sample size ratio of 0.998764 but reduces invalid mass only to 0.148807. These results show that learned-distribution support, structural admissibility, and probability calibration can diverge and should therefore be assessed separately in learned simulation-scenario generation and management.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 14 of its 24 references that are in the map. First posted on arXiv 23 Jul 2026.
Builds on
14 of 24 references.
References · 14
- 2020Denoising Diffusion Probabilistic Modelscited by 20,851
- 2020Denoising Diffusion Implicit Modelscited by 9,655
- 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 8,964
- 2022Flow Matching for Generative Modelingcited by 5,426
- 2017On Calibration of Modern Neural Networkscited by 4,860
- 2018Neural Ordinary Differential Equationscited by 3,733
- 2022Diffusion Posterior Sampling for General Noisy Inverse Problemscited by 1,375
- 2019Normalizing Flows for Probabilistic Modeling and Inferencecited by 1,315
- 2019Can You Trust Your Model's Uncertainty? Evaluating Predictive Uncertainty Under Dataset Shiftcited by 1,274
- 2020A Review of Uncertainty Quantification in Deep Learning: Techniques, Applications and Challengescited by 813
- 2019Representation Learning for Dynamic Graphs: A Surveycited by 260
- 2023Spatio-Temporal Graph Neural Networks for Predictive Learning in Urban Computing: A Surveycited by 140
2 more
- 2013Multilayer Networkscited by 86
- 2024Constrained Synthesis with Projected Diffusion Modelscited by 83
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026Chain-of-Trajectories: Unlocking the Intrinsic Generative Optimality of Diffusion Models via Graph-Theoretic Planning
- 2026Beyond Static Graph World Models: Learning Stochastic Latent Dynamics over Evolving Topologies
- 2024Generative Modelling of Structurally Constrained Graphs
- 2024Discrete-state Continuous-time Diffusion for Graph Generation
- 2026A Structural Dynamics Graph World Model: Unified Modeling, Constrained Rollout, and Interpretable Calibration
- 2025Diffusion-Free Graph Generation with Next-Scale Prediction
- 2026WorldGraph: Graph-Native World Modeling
- 2025Fast Graph Generation via Autoregressive Noisy Filtration Modeling