mlsanityData to 7 Oct 2026

Stuart-Landau Oscillatory Graph Neural Network

arXiv 2511.08094 ↗First posted 11 Nov 2025cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

Oscillatory Graph Neural Networks (OGNNs) are an emerging class of physics-inspired architectures designed to mitigate oversmoothing and vanishing gradient problems in deep GNNs. In this work, we introduce the Complex-Valued Stuart-Landau Graph Neural Network (SLGNN), a novel architecture grounded in Stuart-Landau oscillator dynamics. Stuart-Landau oscillators are canonical models of limit-cycle behavior near Hopf bifurcations, which are fundamental to synchronization theory and are widely used in e.g. neuroscience for mesoscopic brain modeling. Unlike harmonic oscillators and phase-only Kuramoto models, Stuart-Landau oscillators retain both amplitude and phase dynamics, enabling rich phenomena such as amplitude regulation and multistable synchronization. The proposed SLGNN generalizes existing phase-centric Kuramoto-based OGNNs by allowing node feature amplitudes to evolve dynamically according to Stuart-Landau dynamics, with explicit tunable hyperparameters (such as the Hopf-parameter and the coupling strength) providing additional control over the interplay between feature amplitudes and network structure. We conduct extensive experiments across node classification, graph classification, and graph regression tasks, demonstrating that SLGNN outperforms existing OGNNs and establishes a novel, expressive, and theoretically grounded framework for deep oscillatory architectures on graphs.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 28 of its 57 references that are in the map. First posted on arXiv 11 Nov 2025.

Builds on

28 of 57 references.

References · 28

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  2. 2017Graph Attention Networkscited by 8,854
  3. 2017Neural Message Passing for Quantum Chemistrycited by 3,460
  4. 2019Optuna: A Next-generation Hyperparameter Optimization Frameworkcited by 2,455
  5. 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
  6. 2017MoleculeNet: A Benchmark for Molecular Machine Learningcited by 1,037
  7. 2020Geom-GCN: Geometric Graph Convolutional Networkscited by 821
  8. 2019Graph Neural Networks for Social Recommendationcited by 711
  9. 2019Multi-scale Attributed Node Embeddingcited by 543
  10. 2023A critical look at the evaluation of GNNs under heterophily: Are we really making progress?cited by 332
  11. 2019Revisiting Graph Neural Networks: All We Have is Low-Pass Filterscited by 260
  12. 2021GRAND: Graph Neural Diffusioncited by 258
16 more
  1. 2023A Survey on Oversmoothing in Graph Neural Networkscited by 246
  2. 2020Graph Random Neural Network for Semi-Supervised Learning on Graphscited by 213
  3. 2019Graph Neural Ordinary Differential Equationscited by 153
  4. 2019Continuous Graph Neural Networkscited by 114
  5. 2021PDE-GCN: Novel Architectures for Graph Neural Networks Motivated by Partial Differential Equationscited by 106
  6. 2022Revisiting Over-smoothing and Over-squashing Using Ollivier-Ricci Curvaturecited by 96
  7. 2020Coupled Oscillatory Recurrent Neural Network (coRNN): An accurate and (gradient) stable architecture for learning long time dependenciescited by 81
  8. 2021UnICORNN: A recurrent model for learning very long time dependenciescited by 56
  9. 2022GREAD: Graph Neural Reaction-Diffusion Networkscited by 54
  10. 2023How does over-squashing affect the power of GNNs?cited by 53
  11. 2024Oscillatory State-Space Modelscited by 35
  12. 2022SVD-GCN: A Simplified Graph Convolution Paradigm for Recommendationcited by 16
  13. 2023Feature Transportation Improves Graph Neural Networkscited by 15
  14. 2024Towards Graph Foundation Models for Personalizationcited by 12
  15. 2025Are We Measuring Oversmoothing in Graph Neural Networks Correctly?cited by 6
  16. 2023Unique Nash equilibrium of a nonlinear model of opinion dynamics on networks with friction-inspired stubbornnesscited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 3.

3 papers.