DeepAI AI Chat
Log In Sign Up

Topological Graph Neural Networks

by   Max Horn, et al.

Graph neural networks (GNNs) are a powerful architecture for tackling graph learning tasks, yet have been shown to be oblivious to eminent substructures, such as cycles. We present TOGL, a novel layer that incorporates global topological information of a graph using persistent homology. TOGL can be easily integrated into any type of GNN and is strictly more expressive in terms of the Weisfeiler–Lehman test of isomorphism. Augmenting GNNs with our layer leads to beneficial predictive performance, both on synthetic data sets, which can be trivially classified by humans but not by ordinary GNNs, and on real-world data.


page 1

page 2

page 3

page 4


Random Features Strengthen Graph Neural Networks

Graph neural networks (GNNs) are powerful machine learning models for va...

Graph Neural Networks Are More Powerful Than we Think

Graph Neural Networks (GNNs) are powerful convolutional architectures th...

On the Expressivity of Persistent Homology in Graph Learning

Persistent homology, a technique from computational topology, has recent...

A Theoretical Comparison of Graph Neural Network Extensions

We study and compare different Graph Neural Network extensions that incr...

Topological Relational Learning on Graphs

Graph neural networks (GNNs) have emerged as a powerful tool for graph c...

Discriminability of Single-Layer Graph Neural Networks

Network data can be conveniently modeled as a graph signal, where data v...

From Graph Low-Rank Global Attention to 2-FWL Approximation

Graph Neural Networks (GNNs) are known to have an expressive power bound...