arXiv Machine Learning

Instability in Complex Oscillator Networks: Limitations and Potentials of Network Measures and Machine Learning

arXiv:2402. 17500v2 Announce Type: replace-cross Abstract: A central question of network science is how functional properties of systems emerge from their structure.

arXiv Machine Learning
Sep 17

Stable Filters for Generative Modeling of Graph Signals

The paper studies the stability of graph-aware continuous‑time generative models that use a graph filter combined with a learned graph neural network. It derives explicit Wasserstein bounds showing how relative graph perturbations affect the generated distributions, and proposes a principled framework for designing stable graph filters that preserve heat‑diffusion smoothing while improving structural stability. Experiments on synthetic and fMRI data demonstrate that these stable filters enhance robustness and match or surpass the generative quality of a heat‑equation baseline.

By Martin Schmidt, Gonzalo Mateos
arXiv Machine Learning
Jul 20

Discovering Generalizable Governing Equations for Graph Dynamical Systems with Interpretable Neural Networks

arXiv:2508. 18173v2 Announce Type: replace Abstract: The discovery of symbolic governing equations is a central goal in science; yet, it remains challenging particularly for graph dynamical systems, where the network topology further shapes the system behavior.

By Riccardo Cappi, Paolo Frazzetto, Nicol\`o Navarin, Alessandro Sperduti
Hugging Face Trending Papers
Jul 8

Stability of Flow Models for Graph Signals

Generating signals on graphs requires permutation-equivariant models that exhibit stability with respect to relative structural perturbations. While favorable stability properties of Graph Neural Networks (GNNs) have been well documented, it is unclear how structural errors propagate through the dynamics of continuous generative flow models that are gaining traction for graph signal generation.

arXiv AI
Aug 18

Graph Machine Learning: An Opportunity for Power Systems

arXiv:2608. 16494v1 Announce Type: cross Abstract: Modern power systems face growing operational complexity driven by the integration of renewable energy sources, decentralization, and the need for real-time decision-making across a wide range of timescales.

By Martin Sadric, Sebastian P\"utz, Christian Nauck, Veit Hagenmeyer, Frank Hellmann, Dirk Witthaut, Benjamin Sch\"afer
arXiv Machine Learning
Aug 5

Learning and Clustering on Temporal Graphs: Principles, Primitives, and Pooling

arXiv:2608. 03696v1 Announce Type: new Abstract: This work focuses on the problem of learning on temporal graphs, with particular emphasis on the task of clustering: obtaining coarse-grained representations by aggregating information from nodes, edges, and temporal dynamics - a task related to pooling in machine learning on graphs, or community detection in network science.

By Nelson Aloysio Reis de Almeida Passos, Emanuele Carlini, Salvatore Trani
arXiv AI
Sep 25

Reachability-Based Formal Verification of Graph Neural Networks with Node and Edge Features

The paper extends the neural network verification framework to graph neural networks by introducing GraphStar sets, which model uncertainty over both node and edge features. This allows sound propagation of linear message‑passing operations and ReLU nonlinearities for GCN and GINE layers. Experiments on power system tasks (PF, OPF, CFA) and graph classification benchmarks (ENZYMES, PROTEINS) show that the method, called GNNV, yields tighter robustness guarantees than CORA and provides, for the first time, edge‑aware guarantees for GINE‑based models under joint node and edge perturbations.

By Anne M. Tumlin, Ben Wooding, Zhenxuan Shao, Diego Manzanas Lopez, Tyler Derr, Taylor T. Johnson