Expressive Power of Temporal Message Passing
Przemyslaw Andrzej Walega, Michael Rawson
Abstract
Graph neural networks (GNNs) have recently been adapted to temporal settings, often employing temporal versions of the message-passing mechanism known from GNNs. We divide temporal message passing mechanisms from literature into two main types: global and local, and establish Weisfeiler-Leman characterisations for both. This allows us to formally analyse expressive power of temporal message-passing models. We show that global and local temporal message-passing mechanisms have incomparable expressive power when applied to arbitrary temporal graphs. However, the local mechanism is strictly more expressive than the global mechanism when applied to colour-persistent temporal graphs, whose node colours are initially the same in all time points. Our theoretical findings are supported by experimental evidence, underlining practical implications of our analysis.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext bd3d3e90-f009-411e-bb02-063e73a37955Cited by top-tier papers3
- The Logical Expressiveness of Temporal GNNs via Two-Dimensional Product LogicsMarco Sälzer, Przemyslaw Andrzej Walega, Martin LangeNeurIPS 2025 · 3 citations
- Weisfeiler and Leman Go Gambling: Why Expressive Lottery Tickets WinLorenz Kummer, Samir Moustafa, Anatol Ehrlich, Franka Bause et al.ICML 2025
- A Unifying Relational Perspective on Expressive Lottery TicketsLorenz Kummer, Samir Moustafa, Anatol Ehrlich, Franka Bause et al.ICML 2026
Builds on4
- On the Equivalence Between Temporal and Static Equivariant Graph RepresentationsJianfei Gao, Bruno RibeiroICML 2022 · 84 citations
- The Logical Expressiveness of Graph Neural NetworksPablo Barceló, Egor V. Kostylev, Mikaël Monet, Jorge Pérez et al.ICLR 2020 · 17 citations
- The Descriptive Complexity of Graph Neural NetworksMartin GroheLICS 2023 · 7 citations
- Calibrate and Boost Logical Expressiveness of GNN Over Multi-Relational and Temporal GraphsYeyuan Chen, Dingmin WangNeurIPS 2023 · 2 citations
Related papers
- A New Perspective on "How Graph Neural Networks Go Beyond Weisfeiler-Lehman?"Asiri Wijesinghe, Qing WangICLR 2022 · 120 citations
- Repetition Makes Perfect: Recurrent Graph Neural Networks Match Message Passing LimitEran Rosenbluth, Martin GroheAAAI 2026 · 1 citation
- Let's Agree to Degree: Comparing Graph Convolutional Networks in the Message-Passing FrameworkFloris Geerts, Filip Mazowiecki, Guillermo A. PérezICML 2021 · 42 citations
- From Relational Pooling to Subgraph GNNs: A Universal Framework for More Expressive Graph Neural NetworksCai Zhou, Xiyuan Wang, Muhan ZhangICML 2023 · 22 citations
- Graph Neural Networks with Local Graph ParametersPablo Barceló, Floris Geerts, Juan L. Reutter, Maksimilian RyschkovNeurIPS 2021 · 81 citations
