SiST‑GNN introduces a simultaneous spatial‑temporal message‑passing framework for dynamic graph neural networks, fusing per‑node temporal embeddings with spatial aggregation in a single operation. By maintaining a recurrent hidden state per node and treating it as a cross‑time edge, the model jointly reasons over topology and evolution. Experiments on link‑prediction and node‑classification benchmarks show significant improvements over prior methods, achieving up to 158% gains in live‑update link prediction and outperforming discrete‑time baselines by 7–23% in dynamic node classification.
By Shubhajit Roy, Anirban Dasgupta
TTGBench is a new benchmark for temporal graph learning that evaluates both structural evolution and semantic drift in text‑attributed graphs. It includes six real‑world, text‑rich datasets with dual volatility and supports multi‑class and multi‑label temporal node classification, addressing gaps left by existing benchmarks. A comprehensive evaluation of 17 state‑of‑the‑art methods shows a clear divide: TGNNs excel at structural prediction but struggle with semantic tracking, while LLM‑based models perform better on semantic tasks but lag in structural prediction.
By Longfei Ma, Zemin Liu, Fei Wu
arXiv:2608. 07333v1 Announce Type: new Abstract: Modeling multivariate time series by representing them as graphs, where individual series act as nodes and pairwise temporal corre- lations serve as edges, has gained significant traction.
By Chen Shao, Yue Wang, Zhenyi Zhu, Zhanbo Huang, Tobias K\"afer, Zonghan Wu, Danai Koutra
arXiv:2608.28853v1 Announce Type: cross
Abstract: Equivariant graph neural networks provide a principled way to model geometric systems, but efficient first-order architectures remain limited in how...
By Alessio Borgi, Mario Severino, Fabrizio Silvestri, Pietro Li\`o
Modeling multivariate time series by representing them as graphs, where individual series act as nodes and pairwise temporal corre- lations serve as edges, has gained significant traction. Recent advances in Graph Neural Networks (GNNs) have demonstrated strong perfor- mance by assuming a static graph topology and aggregating information from neighboring series.
DeltaGNN introduces an information flow control mechanism that uses a new connectivity measure, the information flow score, to mitigate over‑smoothing and over‑squashing in Graph Neural Networks. This approach enables linear computational and memory overhead while effectively capturing both short‑range and long‑range node interactions. Experiments on ten diverse real‑world datasets demonstrate superior performance with limited computational complexity.
By Kevin Mancini, Islem Rekik
The paper introduces SheafDEQ, a subhomogeneous deep-equilibrium architecture that uses adaptive neural-sheaf propagation to allow richer, edge-dependent transformations in implicit graph neural networks while guaranteeing a unique equilibrium. The authors prove that SheafDEQ’s equilibrium is globally reachable from any positive initialization and remains contractive even with bounded communication staleness. Experiments demonstrate that SheafDEQ outperforms fixed-propagation implicit baselines on tasks such as Sums, MNIST Terrain, Coordinates, and community detection, especially as graph connectivity becomes increasingly heterophilic.
By R\'emi Bourgerie, \v{S}ar\={u}nas Girdzijauskas, Viktoria Fodor
arXiv:2607. 05017v1 Announce Type: cross Abstract: The performance of deep learning models crucially depends on the settings of hyperparameters like learning rate, initialization scale, and weight decay.
By Gage DeZoort, Boris Hanin
arXiv:2606. 11831v1 Announce Type: cross Abstract: Neural relational inference (NRI) methods discover interaction graphs from trajectories through variational reasoning on discrete potential edges.
By Qi Shao, Hao Guo, Jiawen Chen, Duxin Chen, Wenwu Yu
arXiv:2608. 02128v1 Announce Type: new Abstract: Training Graph Neural Networks on large graphs is challenged by the memory cost of storing all node representations across layers.
By Antonin Joly, Nicolas Keriven, Aline Roumy
arXiv:2602. 14239v3 Announce Type: replace-cross Abstract: Predicting links in sparse, continuously evolving networks is a central challenge in network science.
By Nafiseh Sadat Sajadi, Behnam Bahrak, Mahdi Jafari Siavoshani
arXiv:2608.29611v1 Announce Type: new
Abstract: Unsupervised action segmentation aims to discover latent action categories and their temporal organization without action annotations. Optimal transpor...
By Yun Li, Jun Xiao, Cong Zhang, Kin-Man Lam