Design your own universe: a physics-informed agnostic method for enhancing graph neural networks
Abstract
Physics-informed Graph Neural Networks have achieved remarkable performance in learning through graph-structured data by mitigating common GNN challenges such as over-smoothing, over-squashing, and heterophily adaption. Despite these advancements, the development of a simple yet effective paradigm that appropriately integrates previous methods for handling all these challenges is still underway. In this paper, we draw an analogy between the propagation of GNNs and particle systems in physics, proposing a model-agnostic enhancement framework. This framework enriches the graph structure by introducing additional nodes and rewiring connections with both positive and negative weights, guided by node labeling information. We theoretically verify that GNNs enhanced through our approach can effectively circumvent the over-smoothing issue and exhibit robustness against over-squashing. Moreover, we conduct a spectral analysis on the rewired graph to demonstrate that the corresponding GNNs can fit both homophilic and heterophilic graphs. Empirical validations on benchmarks for homophilic, heterophilic graphs, and long-term graph datasets show that GNNs enhanced by our method significantly outperform their original counterparts.
Benchmark Results
Tested on 5 datasets 26 baseline values reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
Classic
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GraphSAGE+CNA | 0.9418
±0.0033 | |
| 2 | GCN+CNA | 0.9366
±0.0048 | |
| 3 | TransformerConv | 0.9350
±0.0058 | |
| 21 | GCN | 0.9004 best reported | best at pub: Understanding Heterophily for Graph Neural Networks (ICML 2024) |
| 39 | SAGE | 0.8911
±0.0012 | |
| 44 | GAT | 0.8897
±0.0014 best reported | best at pub: Learned Low Precision Graph Neural Networks (2020) |
| 51 | H2GCN | 0.8882
±0.0011 best reported | best at pub: Feature Transportation Improves Graph Neural Networks (AAAI 2023) |
| 77 | GPRGNN | 0.8826
±0.0050 best reported | |
| 87 | GRAND | 0.8815 best reported | best at pub: Feature Transportation Improves Graph Neural Networks (AAAI 2023) |
| 108 | APPNP | 0.8787 best reported | best at pub: Orthogonal Graph Neural Networks (AAAI 2021) best today: Feature Transportation Improves Graph Neural Networks (AAAI 2023) |
| 165 | GIN | 0.8660
±0.0091 best reported | best at pub: Weisfeiler and Leman Go Infinite: Spectral and Combinatorial Pre-Colorings (TMLR 2022) best today: Large Language Model Meets Graph Neural Network in Knowledge Distillation (AAAI 2024) |
| 235 | UYGNN | 0.8480
±0.0030 | This paper |
| 237 | ACMP | 0.8476
±0.0074 best reported | best today: Latent-Hysteresis Graph ODEs: Modeling Coupled Topology-Feature Evolution via Continuous Phase Transitions (2026) Difference within reported uncertainty; not counted as underperformance. |
| 306 | UYGAT | 0.8400
±0.0040 | This paper |
| 496 | Replusion | 0.8230
±0.0080 | This paper |
| 546 | LEGCN | 0.8190
±0.0210 | This paper |
| 547 | SJLR | 0.8190 best reported | best today: TSC: A Simple Two-Sided Constraint against Over-Smoothing (KDD 2024) Difference within reported uncertainty; not counted as underperformance. |
| 724 | MLP | 0.7768 best reported | best at pub: Understanding Heterophily for Graph Neural Networks (ICML 2024) |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | CNA | 0.9575
±0.0058 | |
| 2 | IS-GIB | 0.9390
±0.0187 | |
| 3 | EERM | 0.9112
±0.0145 | |
| 20 | APPNP | 0.8142
±0.0026 best reported | best at pub: Feature Expansion for Graph Neural Networks (ICML 2023) |
| 32 | GPRGNN | 0.8102
±0.0071 best reported | best at pub: Feature Expansion for Graph Neural Networks (ICML 2023) |
| 35 | GAT | 0.8080
±0.0026 best reported | best at pub: Feature Expansion for Graph Neural Networks (ICML 2023) |
| 44 | GCN | 0.8033
±0.0088 best reported | best at pub: Gophormer: Ego-Graph Transformer for Node Classification (2021) |
| 61 | GraphSAGE | 0.7923
±0.0053 | |
| 111 | H2GCN | 0.7711
±0.0157 best reported | best at pub: Optimization-Induced Graph Implicit Nonlinear Diffusion (ICML 2022) |
| 122 | GRAND | 0.7657 best reported | best at pub: Feature Transportation Improves Graph Neural Networks (AAAI 2023) |
| 132 | UYGAT | 0.7610
±0.0080 | This paper |
| 172 | UYGNN | 0.7520
±0.0040 | This paper |
| 180 | ACMP | 0.7500
±0.0100 | This paper |
| 309 | LEGCN | 0.7320
±0.0140 | This paper |
| 350 | MLP | 0.7289
±0.0010 best reported | best at pub: On the Equivalence of Graph Convolution and Mixup (TMLR 2023) best today: Gumbel-MPNN: Graph Rewiring with Gumbel-Softmax (2025) |
| 389 | GIN | 0.7250
±0.0080 best reported | best at pub: Towards Self-Explainable Graph Neural Network (2021) Difference within reported uncertainty; not counted as underperformance. |
| 474 | Replusion | 0.7190
±0.0050 | This paper |
| 587 | SJLR | 0.7060
±0.0040 | 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 | |
| 16 | H2GCN | 0.9361
±0.0013 best reported | best at pub: Optimization-Induced Graph Implicit Nonlinear Diffusion (ICML 2022) |
| 17 | APPNP | 0.9355
±0.0060 best reported | best at pub: Tackling Over-Smoothing for General Graph Convolutional Networks (2020) |
| 18 | GCN | 0.9296
±0.0015 best reported | best at pub: Tackling Over-Smoothing for General Graph Convolutional Networks (2020) |
| 20 | GAT | 0.9233
±0.0018 best reported | best at pub: Tackling Over-Smoothing for General Graph Convolutional Networks (2020) |
| 101 | GPRGNN | 0.8911
±0.0008 best reported | best at pub: Feature Expansion for Graph Neural Networks (ICML 2023) |
| 109 | GRAND | 0.8902 best reported | best at pub: Feature Transportation Improves Graph Neural Networks (AAAI 2023) |
| 116 | SAGE | 0.8881
±0.0015 | |
| 157 | GIN | 0.8810 best reported | best at pub: UGSL: A Unified Framework for Benchmarking Graph Structure Learning (2023) |
| 210 | MLP | 0.8690
±0.0074 best reported | best at pub: On the Equivalence of Graph Convolution and Mixup (TMLR 2023) |
| 467 | UYGNN | 0.7990
±0.0050 | This paper |
| 499 | UYGAT | 0.7960
±0.0150 | This paper |
| 550 | Replusion | 0.7930
±0.0120 | This paper |
| 631 | SJLR | 0.7860 best reported | best today: TSC: A Simple Two-Sided Constraint against Over-Smoothing (KDD 2024) |
| 681 | ACMP | 0.7800
±0.0030 | This paper |
| 721 | LEGCN | 0.7740
±0.0050 | This paper |
Heterophilic Graphs
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | P^2GNN | 0.9672
±0.0147 | |
| 2 | DoG | 0.9660
±0.0210 | |
| 3 | GPF-plus | 0.9583
±0.0419 | |
| 28 | GPRGNN | 0.9295
±0.0131 best reported | best at pub: Node-oriented Spectral Filtering for Graph Neural Networks (2022) best today: GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers (ICML 2024) |
| 34 | MLP | 0.9230
±0.0070 | prev best: Node-oriented Spectral Filtering for Graph Neural Networks (2022) Improvement within reported uncertainty; not highlighted. |
| 40 | H2GCN | 0.9189
±0.0393 best reported | best at pub: How Curvature Enhance the Adaptation Power of Framelet GCNs (2023) best today: GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers (ICML 2024) Difference within reported uncertainty; not counted as underperformance. |
| 46 | APPNP | 0.9131
±0.0197 best reported | best at pub: A Quasi-Wasserstein Loss for Learning Graph Neural Networks (WWW 2023) |
| 53 | GraphSAGE | 0.9000
±0.0365 | |
| 56 | UYGAT | 0.8980
±0.0250 | This paper |
| 77 | UYGNN | 0.8890
±0.0150 | This paper |
| 116 | ACMP | 0.8620
±0.0300 best reported | best at pub: Graph Neural Convection-Diffusion with Heterophily (IJCAI 2023) best today: Graph Navier–Stokes Networks (2026) Difference within reported uncertainty; not counted as underperformance. |
| 171 | Replusion | 0.8390
±0.0150 | This paper |
| 208 | LEGCN | 0.8180
±0.0290 | This paper |
| 211 | GAT | 0.8162
±0.0645 best reported | best at pub: A Quasi-Wasserstein Loss for Learning Graph Neural Networks (WWW 2023) best today: Equivariance Everywhere All At Once: A Recipe for Graph Foundation Models (2025) Difference within reported uncertainty; not counted as underperformance. |
| 217 | GRAND | 0.8140
±0.0350 best reported | best at pub: Unifying over-smoothing and over-squashing in graph neural networks: A physics informed approach and beyond (2023) best today: When Graph Neural Networks Meet Dynamic Mode Decomposition (ICLR 2024) Difference within reported uncertainty; not counted as underperformance. |
| 241 | SJLR | 0.8010
±0.0090 | This paper |
| 257 | GCN | 0.7933
±0.0447 best reported | best at pub: Restructuring Graphs for Higher Homophily via Adaptive Spectral Clustering (AAAI 2022) best today: Graph Wave Networks (WWW 2025) Difference within reported uncertainty; not counted as underperformance. |
| 326 | GIN | 0.7460
±0.0080 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | P^2GNN | 0.9541
±0.0272 | |
| 2 | ACM-GCN | 0.9480
±0.0380 | |
| 3 | RF-GCN | 0.9429 | |
| 21 | APPNP | 0.9181
±0.0196 best reported | best at pub: LON-GNN: Spectral GNNs with Learnable Orthonormal Basis (2023) Difference within reported uncertainty; not counted as underperformance. |
| 22 | GPRGNN | 0.9157
±0.0196 best reported | best at pub: LON-GNN: Spectral GNNs with Learnable Orthonormal Basis (2023) best today: Simplified PCNet with Robustness (2024) Difference within reported uncertainty; not counted as underperformance. |
| 24 | MLP | 0.9136
±0.0070 best reported | best at pub: Node-oriented Spectral Filtering for Graph Neural Networks (2022) Difference within reported uncertainty; not counted as underperformance. |
| 44 | UYGAT | 0.8740
±0.0130 | This paper |
| 67 | Replusion | 0.8630
±0.0280 | This paper |
| 68 | H2GCN | 0.8510
±0.0610 | prev best: Graph-Coupled Oscillator Networks (ICML 2022) Improvement within reported uncertainty; not highlighted. |
| 79 | UYGNN | 0.8570
±0.0160 | This paper |
| 84 | ACMP | 0.8540
±0.0700 best reported | best at pub: Graph Neural Networks with a Distribution of Parametrized Graphs (ICML 2023) best today: Graph Navier–Stokes Networks (2026) Difference within reported uncertainty; not counted as underperformance. |
| 138 | SAGE | 0.8269 | |
| 142 | GRAND | 0.8246
±0.0709 best reported | best at pub: Dirichlet Energy Enhancement of Graph Neural Networks by Framelet Augmentation (2023) best today: Graph Navier–Stokes Networks (2026) Difference within reported uncertainty; not counted as underperformance. |
| 158 | GAT | 0.8190
±0.0540 best reported | best at pub: Restructuring Graphs for Higher Homophily via Adaptive Spectral Clustering (AAAI 2022) |
| 165 | LEGCN | 0.8120
±0.0360 | This paper |
| 170 | GCN | 0.8082
±0.0360 best reported | best at pub: Restructuring Graphs for Higher Homophily via Adaptive Spectral Clustering (AAAI 2022) best today: Bayesian Neighborhood Adaptation for Graph Neural Networks (TMLR 2025) Difference within reported uncertainty; not counted as underperformance. |
| 201 | GIN | 0.7800
±0.0190 | This paper |
| 268 | SJLR | 0.7190
±0.0190 | This paper |
