DeepAI AI Chat
Log In Sign Up

Weisfeiler and Lehman Go Topological: Message Passing Simplicial Networks

by   Cristian Bodnar, et al.

The pairwise interaction paradigm of graph machine learning has predominantly governed the modelling of relational systems. However, graphs alone cannot capture the multi-level interactions present in many complex systems and the expressive power of such schemes was proven to be limited. To overcome these limitations, we propose Message Passing Simplicial Networks (MPSNs), a class of models that perform message passing on simplicial complexes (SCs) - topological objects generalising graphs to higher dimensions. To theoretically analyse the expressivity of our model we introduce a Simplicial Weisfeiler-Lehman (SWL) colouring procedure for distinguishing non-isomorphic SCs. We relate the power of SWL to the problem of distinguishing non-isomorphic graphs and show that SWL and MPSNs are strictly more powerful than the WL test and not less powerful than the 3-WL test. We deepen the analysis by comparing our model with traditional graph neural networks with ReLU activations in terms of the number of linear regions of the functions they can represent. We empirically support our theoretical claims by showing that MPSNs can distinguish challenging strongly regular graphs for which GNNs fail and, when equipped with orientation equivariant layers, they can improve classification accuracy in oriented SCs compared to a GNN baseline. Additionally, we implement a library for message passing on simplicial complexes that we envision to release in due course.


How Powerful are K-hop Message Passing Graph Neural Networks

The most popular design paradigm for Graph Neural Networks (GNNs) is 1-h...

A Topological characterisation of Weisfeiler-Leman equivalence classes

Graph Neural Networks (GNNs) are learning models aimed at processing gra...

Mapping the Internet: Modelling Entity Interactions in Complex Heterogeneous Networks

Even though machine learning algorithms already play a significant role ...

Let's Agree to Degree: Comparing Graph Convolutional Networks in the Message-Passing Framework

In this paper we cast neural networks defined on graphs as message-passi...

Provably expressive temporal graph networks

Temporal graph networks (TGNs) have gained prominence as models for embe...

Fine-grained Expressivity of Graph Neural Networks

Numerous recent works have analyzed the expressive power of message-pass...

HOOD: Hierarchical Graphs for Generalized Modelling of Clothing Dynamics

We propose a method that leverages graph neural networks, multi-level me...

Code Repositories


Message Passing on Simplicial and Cell Complexes

view repo


Simplicial Weisfeiler and Lehman for graph isomorphism test

view repo