mlsanityData to 7 Oct 2026

Stable Transformers for Graph Generation

arXiv 2609.39739 ↗First posted 30 Sep 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Graph generative models increasingly rely on Graph Transformers (GT) to capture complex dependencies among nodes and edges. While deeper architectures should provide greater expressive capacity and a broader receptive field, their effectiveness can decline with depth: repeated self-attention progressively contracts node representations, impeding information flow and gradient propagation. We analyse this phenomenon from a dynamical systems perspective, focusing on how the denoiser's spectral dynamics affect graph generation. We show that standard GT denoisers become increasingly dissipative as depth grows, leading to vanishing gradients and representation collapse. To isolate the effect of these dynamics, we construct a permutation-equivariant GT with inherently stable, non-dissipative transport. We also introduce a damping mechanism that continuously interpolates between non-dissipative and increasingly contractive regimes, enabling a direct assessment of how dissipation influences generation. Experiments on synthetic and molecular graph generation benchmarks show that the gap between these regimes widens with depth: non-dissipative dynamics preserve representation diversity and gradient flow, sustaining strong generative performance, whereas greater contraction progressively impairs it. These findings identify the denoiser's dynamical regime as a key design factor for deep graph generative models.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 50 of its 62 references that are in the map. First posted on arXiv 30 Sep 2026.

Builds on

50 of 62 references.

References · 50

  1. 2017Attention Is All You Needcited by 59,932
  2. 2022Flow Matching for Generative Modelingcited by 5,426
  3. 2018Neural Ordinary Differential Equationscited by 3,733
  4. 2021Efficiently Modeling Long Sequences with Structured State Spacescited by 2,424
  5. 2020A Generalization of Transformer Networks to Graphscited by 653
  6. 2020On the Bottleneck of Graph Neural Networks and its Practical Implicationscited by 624
  7. 2022DiGress: Discrete Denoising diffusion for graph generationcited by 503
  8. 2020Masked Label Prediction: Unified Message Passing Model for Semi-Supervised Classificationcited by 500
  9. 2021Understanding over-squashing and bottlenecks on graphs via curvaturecited by 471
  10. 2021Attention is Not All You Need: Pure Attention Loses Rank Doubly Exponentially with Depthcited by 411
  11. 2018GraphRNN: Generating Realistic Graphs with Deep Auto-regressive Modelscited by 406
  12. 2023Resurrecting Recurrent Neural Networks for Long Sequencescited by 397
38 more
  1. 2017Stable Architectures for Deep Neural Networkscited by 340
  2. 2024Discrete Flow Matchingcited by 301
  3. 2024Generative Flows on Discrete State-Spaces: Enabling Multimodal Flows with Applications to Protein Co-Designcited by 294
  4. 2015Unitary Evolution Recurrent Neural Networkscited by 291
  5. 2022Score-based Generative Modeling of Graphs via the System of Stochastic Differential Equationscited by 273
  6. 2018Molecular Sets (MOSES): A Benchmarking Platform for Molecular Generation Modelscited by 270
  7. 2020Permutation Invariant Graph Generation via Score-Based Generative Modelingcited by 263
  8. 2023A Survey on Oversmoothing in Graph Neural Networkscited by 246
  9. 2020A Note on Over-Smoothing for Graph Neural Networkscited by 245
  10. 2019Efficient Graph Generation with Graph Recurrent Attention Networkscited by 231
  11. 2023On Over-Squashing in Message Passing Neural Networks: The Impact of Width, Depth, and Topologycited by 163
  12. 2019Graph Neural Ordinary Differential Equationscited by 153
  13. 2022Signal Propagation in Transformers: Theoretical Perspectives and the Role of Rank Collapsecited by 136
  14. 2019AntisymmetricRNN: A Dynamical System View on Recurrent Neural Networkscited by 112
  15. 2022SPECTRE: Spectral Conditioning Helps to Overcome the Expressivity Limits of One-shot Graph Generatorscited by 96
  16. 2017Orthogonal Recurrent Neural Networks with Scaled Cayley Transformcited by 82
  17. 2024Variational Flow Matching for Graph Generationcited by 78
  18. 2024DeFoG: Discrete Flow Matching for Graph Generationcited by 76
  19. 2023Efficient and Degree-Guided Graph Generation via Discrete Diffusion Modelingcited by 75
  20. 2024Discrete-state Continuous-time Diffusion for Graph Generationcited by 73
  21. 2020GraphGen: A Scalable Approach to Domain-agnostic Labeled Graph Generationcited by 65
  22. 2020Scalable Deep Generative Modeling for Sparse Graphscited by 63
  23. 2022Anti-Symmetric DGN: a stable architecture for Deep Graph Networkscited by 58
  24. 2023Graph Generation with Diffusion Mixturecited by 52
  25. 2023Conditional Diffusion Based on Discrete Graph Structures for Molecular Graph Generationcited by 46
  26. 2024Graph Diffusion Transformers for Multi-Conditional Molecular Generationcited by 44
  27. 2025On Vanishing Gradients, Over-Smoothing, and Over-Squashing in GNNs: Bridging Recurrent and Graph Learningcited by 42
  28. 2016Recurrent Orthogonal Networks and Long-Memory Taskscited by 38
  29. 2023Efficient and Scalable Graph Generation through Iterative Local Expansioncited by 35
  30. 2024Cometh: A continuous-time discrete-state graph diffusion modelcited by 29
  31. 2024Pard: Permutation-Invariant Autoregressive Diffusion for Graph Generationcited by 25
  32. 2023Improving Graph Generation by Restricting Graph Bandwidthcited by 15
  33. 2025Flow Matching Meets Biology and Life Science: A Surveycited by 14
  34. 2024Advancing Graph Generation through Beta Diffusioncited by 13
  35. 2024Improving Molecular Graph Generation with Flow Matching and Optimal Transportcited by 10
  36. 2025Generating Directed Graphs with Dual Attention and Asymmetric Encodingcited by 3
  37. 2023Graph Generation with K2-treescited by 2
  38. 2025Short-Range Oversquashingcited by 2

Built on by

Not cited yet.