LGAISep 17, 2025

State Space Models over Directed Graphs

arXiv:2509.13735v1h-index: 10
Originality Incremental advance
AI Analysis

This addresses the challenge of directed graph learning for domains relying on causal dependencies, representing an incremental advancement by extending state space models from undirected to directed graphs.

The paper tackled the problem of effectively capturing long-range causal dependencies and balancing accuracy with training efficiency in directed graph learning by proposing DirGraphSSM, a novel directed graph neural network architecture based on state space models, which achieved state-of-the-art performance on three tasks and competitive results on two others with 1.5x to 2x training speed improvements.

Directed graphs are ubiquitous across numerous domains, where the directionality of edges encodes critical causal dependencies. However, existing GNNs and graph Transformers tailored for directed graphs face two major challenges: (1) effectively capturing long-range causal dependencies derived from directed edges; (2) balancing accuracy and training efficiency when processing large-scale graph datasets. In recent years, state space models (SSMs) have achieved substantial progress in causal sequence tasks, and their variants designed for graphs have demonstrated state-of-the-art accuracy while maintaining high efficiency across various graph learning benchmarks. However, existing graph state space models are exclusively designed for undirected graphs, which limits their performance in directed graph learning. To this end, we propose an innovative approach DirEgo2Token which sequentializes directed graphs via k-hop ego graphs. This marks the first systematic extension of state space models to the field of directed graph learning. Building upon this, we develop DirGraphSSM, a novel directed graph neural network architecture that implements state space models on directed graphs via the message-passing mechanism. Experimental results demonstrate that DirGraphSSM achieves state-of-the-art performance on three representative directed graph learning tasks while attaining competitive performance on two additional tasks with 1.5$\times $ to 2$\times $ training speed improvements compared to existing state-of-the-art models.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes