RAwR: Role-Aware Rewiring via Approximate Equitable Partition
Not on the map. Why?
Abstract (arXiv)
While Graph Neural Networks (GNNs) have demonstrated significant efficacy in node classification tasks, where predictions rely on local neighborhood information, the performance of GNNs often drops when prediction tasks depend on long-range interactions. These limitations are attributed to phenomena such as oversquashing, where structural bottlenecks restrict signal propagation across the network topology. To address this challenge, we introduce RAwR, a computationally efficient rewiring framework that augments the input graph with a quotient graph derived from equitable partitions. This approach facilitates accelerated communication between nodes that share identical structural roles, as identified by the Weisfeiler-Leman graph coloring, and thereby reduces the total effective resistance of the system. Furthermore, by employing an approximate definition of the equitable partition, RAwR enables a controllable reduction of the quotient graph, which, in its most condensed state, recovers the conventional Master Node rewiring technique. Empirical evaluations across a diverse suite of benchmarks -- including homophilic, heterophilic, and synthetic long-range datasets -- demonstrate that RAwR achieves state-of-the-art results. Our contribution is further supported by an analytical investigation using a teacher-student model of linear GNNs, which elucidates the theoretical foundations of role-based rewiring. This analysis leads to the formulation of Spectral Role Lift (SRL), a metric designed to identify the optimal approximate equitable partition for maximizing predictive performance.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 24 of its 35 references that are in the map. First posted on arXiv 10 May 2026.
Builds on
24 of 35 references.
References · 24
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2018How Powerful are Graph Neural Networks?cited by 4,393
- 2017Neural Message Passing for Quantum Chemistrycited by 3,487
- 2020On the Bottleneck of Graph Neural Networks and its Practical Implicationscited by 631
- 2021Understanding over-squashing and bottlenecks on graphs via curvaturecited by 478
- 2022Long Range Graph Benchmarkcited by 263
- 2022FoSR: First-order spectral rewiring for addressing oversquashing in GNNscited by 105
- 2022Revisiting Over-smoothing and Over-squashing Using Ollivier-Ricci Curvaturecited by 98
- 2023Understanding Oversquashing in GNNs through the Lens of Effective Resistancecited by 97
- 2023On the Connection Between MPNN and Graph Transformercited by 61
- 2025Position: Graph Learning Will Lose Relevance Due To Poor Benchmarkscited by 53
12 more
- 2021On Positional and Structural Node Features for Graph Neural Networks on Non-attributed Graphscited by 49
- 2025Towards Quantifying Long-Range Interactions in Graph Machine Learning: a Large Graph Dataset and a Measurementcited by 20
- 2024Understanding Virtual Nodes: Oversquashing and Node Heterogeneitycited by 14
- 2025GNNs Getting ComFy: Community and Feature Similarity Guided Rewiringcited by 13
- 2024Joint Graph Rewiring and Feature Denoising via Spectral Resonancecited by 12
- 2025Can You Hear Me Now? A Benchmark for Long-Range Graph Propagationcited by 10
- 20222-hop Neighbor Class Similarity (2NCS): A graph structural metric indicative of graph neural network performancecited by 8
- 2025Dynamic Triangulation-Based Graph Rewiring for Graph Neural Networkscited by 4
- 2024Efficient Network Embedding by Approximate Equitable Partitionscited by 2
- 2013Active Discovery of Network Roles for Predicting the Classes of Network Nodescited by 1
- 2023An Optimization-based Approach To Node Role Discovery in Networks: Approximating Equitable Partitionscited by 1
- 2025Convergence of gradient based training for linear Graph Neural Networkscited by 1
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2024Graph Unlearning with Efficient Partial Retraining
- 2023Recurrent Distance Filtering for Graph Representation Learning
- 2026Closed-Form Node Classification with Exact Graph Unlearning
- 2023Accelerating Scalable Graph Neural Network Inference with Node-Adaptive Propagation
- 2024Node-wise Filtering in Graph Neural Networks: A Mixture of Experts Approach
- 2024Diffusing to the Top: Boost Graph Neural Networks with Minimal Hyperparameter Tuning
- 2025ReDiSC: A Reparameterized Masked Diffusion Model for Scalable Node Classification with Structured Predictions
- 2024Erase then Rectify: A Training-Free Parameter Editing Approach for Cost-Effective Graph Unlearning