Design Your Own Universe: A Physics-Informed Agnostic Method for Enhancing Graph Neural Networks
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 31 of its 53 references that are in the map. First posted on arXiv 26 Jan 2024.
Builds on
31 of 53 references.
References · 31
- 2014Microsoft COCO: Common Objects in Contextcited by 17,498
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Graph Attention Networkscited by 8,854
- 2017Neural Message Passing for Quantum Chemistrycited by 3,460
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
- 2020On the Bottleneck of Graph Neural Networks and its Practical Implicationscited by 624
- 2020Masked Label Prediction: Unified Message Passing Model for Semi-Supervised Classificationcited by 500
- 2021Understanding over-squashing and bottlenecks on graphs via curvaturecited by 471
- 2021GRAND: Graph Neural Diffusioncited by 258
- 2022Long Range Graph Benchmarkcited by 258
- 2023A Survey on Oversmoothing in Graph Neural Networkscited by 246
- 2020A Note on Over-Smoothing for Graph Neural Networkscited by 245
19 more
- 2022FoSR: First-order spectral rewiring for addressing oversquashing in GNNscited by 104
- 2023Understanding Oversquashing in GNNs through the Lens of Effective Resistancecited by 94
- 2022On the Trade-off between Over-smoothing and Over-squashing in Deep Graph Neural Networkscited by 63
- 2022Understanding convolution on graphs via energiescited by 58
- 2022Oversquashing in GNNs through the lens of information contraction and graph expansioncited by 52
- 2021Bag of Tricks for Node Classification with Graph Neural Networkscited by 40
- 2021p-Laplacian Based Graph Neural Networkscited by 39
- 2023Mitigating Over-Smoothing and Over-Squashing using Augmentations of Forman-Ricci Curvaturecited by 39
- 2022ACMP: Allen-Cahn Message Passing with Attractive and Repulsive Forces for Graph Neural Networkscited by 31
- 2023From Continuous Dynamics to Graph Neural Networks: Neural Diffusion and Beyondcited by 26
- 2023Exposition on over-squashing problem on GNNs: Current Methods, Benchmarks and Challengescited by 22
- 2023How Curvature Enhance the Adaptation Power of Framelet GCNscited by 13
- 2023Unifying over-smoothing and over-squashing in graph neural networks: A physics informed approach and beyondcited by 13
- 2020Self-Enhanced GNN: Improving Graph Neural Networks Using Model Outputscited by 11
- 2022Label-Enhanced Graph Neural Network for Semi-supervised Node Classificationcited by 11
- 2022Generalized energy and gradient flow via graph frameletscited by 10
- 2023Bregman Graph Neural Networkcited by 4
- 2023Frameless Graph Knowledge Distillationcited by 2
- 2019On Extension of Effective Resistance with Application to Graph Laplacian Definiteness and Power Network Stabilitycited by 1
Built on by
Citing papers per year: 2024: 4; 2025: 2.
6 papers.
- 2024What Is Missing In Homophily? Disentangling Graph Homophily For Graph Neural Networkscited by 9
- 2024Unleash Graph Neural Networks from Heavy Tuningcited by 2
- 2024When Graph Neural Networks Meet Dynamic Mode Decompositioncited by 2
- 2025Demystifying Topological Message-Passing with Relational Structures: A Case Study on Oversquashing in Simplicial Message-Passingcited by 2
- 2024Diffusing to the Top: Boost Graph Neural Networks with Minimal Hyperparameter Tuningcited by 1
- 2025Graph Pseudotime Analysis and Neural Stochastic Differential Equations for Analyzing Retinal Degeneration Dynamics and Beyondcited by 0
- 2025Demystifying Topological Message-Passing with Relational Structures: A Case Study on Oversquashing in Simplicial Message-Passing6 Jun 2025
- 2025Graph Pseudotime Analysis and Neural Stochastic Differential Equations for Analyzing Retinal Degeneration Dynamics and Beyond10 Feb 2025
- 2024Diffusing to the Top: Boost Graph Neural Networks with Minimal Hyperparameter Tuning8 Oct 2024
- 2024When Graph Neural Networks Meet Dynamic Mode Decomposition8 Oct 2024
- 2024What Is Missing In Homophily? Disentangling Graph Homophily For Graph Neural Networks27 Jun 2024
- 2024Unleash Graph Neural Networks from Heavy Tuning21 May 2024