Effective Resistance Rewiring: A Simple Topological Correction for Over-Squashing
Not on the map. Why?
Abstract (arXiv)
Graph Neural Networks struggle to capture long-range dependencies due to over-squashing, where information from exponentially growing neighborhoods must pass through a small number of structural bottlenecks. While recent rewiring methods attempt to alleviate this limitation, many rely on local criteria such as curvature, which can overlook global connectivity constraints that restrict information flow. We introduce Effective Resistance Rewiring (ERR), a simple topology correction strategy that uses effective resistance as a global signal to detect structural bottlenecks. ERR iteratively adds edges between node pairs with the largest resistance while removing edges with minimal resistance, strengthening weak communication pathways while controlling graph densification under a fixed edge budget. The procedure is parameter-free beyond the rewiring budget and relies on a single global measure aggregating all paths between node pairs. Beyond predictive performance with GCN models, we analyze how rewiring affects message propagation. By tracking cosine similarity between node embeddings across layers, we examine how the relationship between initial node features and learned representations evolves during message passing, comparing graphs with and without rewiring. This analysis helps determine whether improvements arise from better long-range communication rather than changes in embedding geometry. Experiments on homophilic and heterophilic graphs, including directed settings with DirGCN, reveal a trade-off between over-squashing and oversmoothing, where oversmoothing corresponds to the loss of representation diversity across layers. Resistance-guided rewiring improves connectivity and signal propagation but can accelerate representation mixing in deep models. Combining ERR with normalization techniques such as PairNorm stabilizes this trade-off and improves performance.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 23 of its 31 references that are in the map. First posted on arXiv 12 Mar 2026.
Builds on
23 of 31 references.
References · 23
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,414
- 2019Similarity of Neural Network Representations Revisitedcited by 1,695
- 2016Understanding intermediate layers using linear classifier probescited by 1,279
- 2018Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learningcited by 1,099
- 2019BERT Rediscovers the Classical NLP Pipelinecited by 1,046
- 2020Geom-GCN: Geometric Graph Convolutional Networkscited by 821
- 2020On the Bottleneck of Graph Neural Networks and its Practical Implicationscited by 624
- 2019Measuring and Relieving the Over-smoothing Problem for Graph Neural Networks from the Topological Viewcited by 544
- 2021Understanding over-squashing and bottlenecks on graphs via curvaturecited by 471
- 2019PairNorm: Tackling Oversmoothing in GNNscited by 297
- 2023A Survey on Oversmoothing in Graph Neural Networkscited by 246
11 more
- 2023On Over-Squashing in Message Passing Neural Networks: The Impact of Width, Depth, and Topologycited by 163
- 2022Not too little, not too much: a theoretical analysis of graph (over)smoothingcited by 106
- 2021Dirichlet Energy Constrained Learning for Deep Graph Neural Networkscited by 97
- 2023Understanding Oversquashing in GNNs through the Lens of Effective Resistancecited by 94
- 2022DiffWire: Inductive Graph Rewiring via the Lov'asz Boundcited by 79
- 2020Directed Graph Convolutional Networkcited by 73
- 2022On the Trade-off between Over-smoothing and Over-squashing in Deep Graph Neural Networkscited by 63
- 2023How does over-squashing affect the power of GNNs?cited by 53
- 2025On Vanishing Gradients, Over-Smoothing, and Over-Squashing in GNNs: Bridging Recurrent and Graph Learningcited by 42
- 2024Spectral Graph Pruning Against Over-Squashing and Over-Smoothingcited by 23
- 2013A New Notion of Effective Resistance for Directed Graphs-Part I: Definition and Propertiescited by 4
Built on by
Citing papers per year: 2026: 1.
1 paper.