Expressive Power of Temporal Message Passing
Wałęga, Przemysław Andrzej, Rawson, Michael
–arXiv.org Artificial Intelligence
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.
arXiv.org Artificial Intelligence
Aug-19-2024
- Country:
- Oceania > Australia
- New South Wales > Sydney (0.04)
- North America
- United States
- Maryland (0.04)
- Texas > Travis County
- Austin (0.04)
- New York > New York County
- New York City (0.04)
- Massachusetts > Suffolk County
- Boston (0.04)
- Louisiana > Orleans Parish
- New Orleans (0.04)
- Hawaii > Honolulu County
- Honolulu (0.04)
- California > San Diego County
- San Diego (0.04)
- Canada > British Columbia
- United States
- Europe
- Greece (0.04)
- Austria (0.04)
- United Kingdom > England
- Oxfordshire > Oxford (0.04)
- Greater London > London (0.04)
- Sweden > Stockholm
- Stockholm (0.04)
- France > Hauts-de-France
- Asia > Taiwan
- Taiwan Province > Taipei (0.04)
- Africa > Ethiopia
- Addis Ababa > Addis Ababa (0.04)
- Oceania > Australia
- Genre:
- Research Report (0.82)
- Technology: