The paper extends the Strong Expressive Lottery Ticket Hypothesis to relational and temporal graph neural networks by proving that sufficiently large RGNNs contain sparse subnetworks preserving 1‑relational Weisfeiler‑Leman expressivity. It derives a probabilistic lower bound for random pruning to achieve such subnetworks and shows that common TGNNs and cross‑graph message passing can be reformulated as RGNNs to inherit these guarantees. Experiments validate the bound, compare it to empirical probabilities on synthetic data, and explore the relationship between pre‑training expressivity, optimization behavior, and prediction quality on temporal and molecular benchmarks.
By Lorenz Kummer, Samir Moustafa, Anatol Ehrlich, Franka Bause, Marco Nennstiel, Przemys{\l}aw Andrzej Wa{\l}\c{e}ga, Nils Morten Kriege
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:2606. 08491v1 Announce Type: new Abstract: Relational deep learning (RDL) converts relational databases (RDBs) into heterogeneous graphs, but graphs derived directly from database schemas are often not well suited for how graph neural networks (GNNs) perform relational reasoning.
By Yao Cheng, Siqiang Luo
arXiv:2602.13106v2 Announce Type: replace-cross
Abstract: In recent years, there has been growing interest in understanding neural architectures' ability to learn to execute discrete algorithms, a li...
By Solveig Wittig, Antonis Vasileiou, Robert R. Nerem, Timo Stoll, Floris Geerts, Yusu Wang, Christopher Morris
arXiv:2507.07138v2 Announce Type: replace
Abstract: Graph Neural Networks (GNNs) often struggle to capture the link-specific structural patterns crucial for accurate link prediction, as their node-ce...
By Francesco Ferrini, Veronica Lachi, Antonio Longa, Bruno Lepri, Andrea Passerini
arXiv:2602. 01553v3 Announce Type: replace-cross Abstract: Link prediction is a core challenge in graph machine learning, demanding models that capture rich and complex topological dependencies.
By Quang Truong, Yu Song, Donald Loveland, Mingxuan Ju, Tong Zhao, Neil Shah, Jiliang Tang
arXiv:2607. 20555v1 Announce Type: new Abstract: The lottery ticket hypothesis proposes that large random neural networks contain sparse subnetworks that can match the performance of dense models after comparable training.
By Bryce A. Christopherson, Jack Baretz, Darian Colgrove, Salah Dandan
arXiv:2505.11298v2 Announce Type: replace
Abstract: Graph Neural Networks (GNNs) are powerful tools for learning on structured data, yet the relationship between their expressivity and predictive per...
By Sohir Maskey, Raffaele Paolino, Fabian Jogl, Gitta Kutyniok, Johannes F. Lutzeyer
Graph Hierarchical Recurrence (GHR) is a new framework that enhances Graph Neural Networks and Graph Transformers by jointly processing the input graph and a pooled hierarchical abstraction. It addresses the limitation of existing models in handling predictions that depend on correlations between distant graph regions, especially under out-of-range generalization where test instances require interactions beyond training distances. Across many long-range benchmarks, GHR consistently improves performance, achieving state‑of‑the‑art or competitive results on multiple tasks.
By Stefano Carotti, Marco Pacini, Alessio Gravina, Davide Bacciu, Bruno Lepri, Sebastiano Bontorin
arXiv:2510. 04567v3 Announce Type: replace-cross Abstract: Graph Neural Networks (GNNs) are powerful tools for processing relational data but often struggle to generalize to unseen graphs, giving rise to the development of Graph Foundational Models (GFMs).
By Weishuo Ma, Yanbo Wang, Xiyuan Wang, Lei Zou, Muhan Zhang
Bridge-LP is a new framework for link prediction on text‑attributed graphs that combines Graph Neural Networks and Language Models. It introduces three design components: jumping connections for robust language model training, compressed embeddings to encode neighborhood information, and a cache embedding strategy to reduce computational cost. Experiments on nine datasets show that Bridge‑LP outperforms 40 existing models, achieving up to a 43.06% improvement in Mean Reciprocal Rank.
By Chen Shao, Ruirui Wang, Tobias Kafer, Danai Koutra
The paper introduces xVGAE, a hierarchical variational graph autoencoder designed for exchangeable graphs. Leveraging the Aldous-Hoover theorem, the model uses a graph-level latent variable, exchangeable node-specific latent variables, and a graphon function to learn and generate graph distributions efficiently. Experiments demonstrate that xVGAE produces high-quality graphs quickly while capturing key structural properties of the training data.
By Daniele Micheletti, Federica Zoe Ricci, Erik B. Sudderth