GRAND: Graph Neural Diffusion

by   Benjamin Paul Chamberlain, et al.

We present Graph Neural Diffusion (GRAND) that approaches deep learning on graphs as a continuous diffusion process and treats Graph Neural Networks (GNNs) as discretisations of an underlying PDE. In our model, the layer structure and topology correspond to the discretisation choices of temporal and spatial operators. Our approach allows a principled development of a broad new class of GNNs that are able to address the common plights of graph learning models such as depth, oversmoothing, and bottlenecks. Key to the success of our models are stability with respect to perturbations in the data and this is addressed for both implicit and explicit discretisation schemes. We develop linear and nonlinear versions of GRAND, which achieve competitive results on many standard graph benchmarks.


Beltrami Flow and Neural Diffusion on Graphs

We propose a novel class of graph neural networks based on the discretis...

Neural Sheaf Diffusion: A Topological Perspective on Heterophily and Oversmoothing in GNNs

Cellular sheaves equip graphs with "geometrical" structure by assigning ...

Graph Theory for Metro Traffic Modelling

A unifying graph theoretic framework for the modelling of metro transpor...

Tuning the Geometry of Graph Neural Networks

By recursively summing node features over entire neighborhoods, spatial ...

Deep Lagrangian Constraint-based Propagation in Graph Neural Networks

Several real-world applications are characterized by data that exhibit a...

p2pGNN: A Decentralized Graph Neural Network for Node Classification in Peer-to-Peer Networks

In this work, we aim to classify nodes of unstructured peer-to-peer netw...

Simulating Liquids with Graph Networks

Simulating complex dynamics like fluids with traditional simulators is c...