Beltrami Flow and Neural Diffusion on Graphs
Abstract
We propose a novel class of graph neural networks based on the discretised Beltrami flow, a non-Euclidean diffusion PDE. In our model, node features are supplemented with positional encodings derived from the graph topology and jointly evolved by the Beltrami flow, producing simultaneously continuous feature learning and topology evolution. The resulting model generalises many popular graph neural networks and achieves state-of-the-art results on several benchmarks.
Benchmark Results
Tested on 5 datasets 4 baseline values reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
Classic
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | CNA | 0.9575
±0.0058 | |
| 2 | IS-GIB | 0.9390
±0.0187 | |
| 3 | EERM | 0.9112
±0.0145 | |
| 44 | GCN | 0.8033
±0.0088 | |
| 350 | MLP | 0.7289
±0.0010 | |
| 391 | GDE | 0.7250
±0.0050 | This paper |
| 411 | GODE | 0.7240
±0.0060 | This paper |
| 590 | CGNN | 0.7050
±0.0123 best reported | best at pub: GRAND: Graph Neural Diffusion (ICML 2021) best today: Gauge-Equivariant Graph Networks via Self-Interference Cancellation (2025) |
| 665 | AdaLanczos | 0.6870
±0.0100 | This paper |
| 745 | Lanczos | 0.6620
±0.0190 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | LGTL | 0.9518
±0.0011 | |
| 2 | MixHop (LO) | 0.9513
±0.0038 | |
| 3 | GraphSAGE (LO) | 0.9511
±0.0036 | |
| 18 | GCN | 0.9296
±0.0015 best reported | best at pub: Tackling Over-Smoothing for General Graph Convolutional Networks (2020) |
| 116 | SAGE | 0.8881
±0.0015 | |
| 210 | MLP | 0.8690
±0.0074 | |
| 345 | BLEND-kNN | 0.8150
±0.0050 | This paper |
| 394 | BLEND | 0.8070
±0.0070 | This paper |
| 430 | CGNN | 0.8020
±0.0030 | This paper |
| 440 | GODE | 0.8010
±0.0030 | This paper |
| 459 | GDE | 0.7990
±0.0030 | This paper |
| 654 | Lanczos | 0.7830
±0.0030 | This paper |
| 670 | AdaLanczos | 0.7810
±0.0040 | This paper |
| 754 | GS-maxpool | 0.7660
±0.0080 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GraphTARIF | 0.9703
±0.0019 | |
| 2 | GAT | 0.9669
±0.0014 best reported | best at pub: Graph Contrastive Learning with Adaptive Augmentation (WWW 2020) best today: Graph Transductive Sharpening: Leveraging Unlabeled Predictions in Node Classification (2026) Difference within reported uncertainty; not counted as underperformance. |
| 3 | GAT+T | 0.9660
±0.0007 | |
| 7 | SAGE | 0.9643
±0.0027 | |
| 8 | GCN | 0.9632
±0.0008 best reported | best at pub: Graph Contrastive Learning with Adaptive Augmentation (WWW 2020) |
| 82 | CGNN | 0.9435
±0.0056 best reported | best today: Graph Wave Networks (WWW 2025) |
| 230 | BLEND | 0.9290
±0.0060 | This paper |
| 296 | GDE | 0.9240
±0.0200 | This paper |
| 380 | GS-mean | 0.9140
±0.0130 | This paper |
| 390 | MLP | 0.9128
±0.0063 | |
| 393 | MoNet | 0.9124
±0.0130 best reported | best today: Building Shortcuts between Distant Nodes with Biaffine Mapping for Graph Convolutional Networks (2023) Difference within reported uncertainty; not counted as underperformance. |
| 403 | GAT-ppr | 0.9090
±0.0030 | This paper |
| 435 | GS-maxpool | 0.9040
±0.0130 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GraphTARIF | 0.9461
±0.0017 | |
| 2 | GCN | 0.9412
±0.0008 best reported | best at pub: Learning on Attribute-Missing Graphs (2020) |
| 3 | GAT | 0.9398
±0.0022 best reported | best at pub: Graph Contrastive Learning with Adaptive Augmentation (WWW 2020) best today: Graph Transductive Sharpening: Leveraging Unlabeled Predictions in Node Classification (2026) Difference within reported uncertainty; not counted as underperformance. |
| 8 | SAGE | 0.9351
±0.0006 | |
| 195 | CGNN | 0.8831
±0.0065 best reported | best today: Graph Wave Networks (WWW 2025) |
| 257 | BLEND | 0.8690
±0.0060 | This paper |
| 300 | GAT-ppr | 0.8540
±0.0030 | This paper |
| 320 | MLP | 0.8463 | |
| 367 | MoNet | 0.8350
±0.0220 | This paper |
| 385 | GDE | 0.8290
±0.0060 | This paper |
| 391 | GS-mean | 0.8240
±0.0180 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | DoG | 0.9690
±0.0030 | |
| 2 | GWN-fa | 0.9667
±0.0026 | |
| 3 | GWN-sym | 0.9666
±0.0026 | |
| 4 | CGNN | 0.9621
±0.0032 best reported | best today: Graph Wave Networks (WWW 2025) |
| 6 | GraphSAGE | 0.9593
±0.0025 | |
| 12 | GCN | 0.9514
±0.0025 best reported | best at pub: Unifying Graph Convolutional Neural Networks and Label Propagation (2020) best today: Graph Wave Networks (WWW 2025) |
| 21 | GAT | 0.9437
±0.0028 best reported | best at pub: Unifying Graph Convolutional Neural Networks and Label Propagation (2020) best today: Graph Wave Networks (WWW 2025) |
| 84 | BLEND | 0.9290
±0.0020 | This paper |
| 88 | MLP | 0.9280
±0.0020 | |
| 135 | GDE | 0.9160
±0.0010 | This paper |
| 140 | GAT-ppr | 0.9130
±0.0010 | This paper |
| 141 | GS-mean | 0.9130
±0.0280 | This paper |
| 155 | MoNet | 0.9082
±0.0160 best reported | best at pub: GraphMix: Improved Training of GNNs for Semi-Supervised Learning (2019) best today: Building Shortcuts between Distant Nodes with Biaffine Mapping for Graph Convolutional Networks (2023) Difference within reported uncertainty; not counted as underperformance. |
| 186 | GS-maxpool | 0.8500
±0.0110 | This paper |
