Directed Homophily-Aware Graph Neural Network
Abstract
Graph Neural Networks (GNNs) have achieved significant success in various learning tasks on graph-structured data. Nevertheless, most GNNs struggle to generalize to heterophilic neighborhoods. Additionally, many GNNs ignore the directional nature of real-world graphs, resulting in suboptimal performance on directed graphs with asymmetric structures. In this work, we propose Directed Homophily-aware Graph Neural Network (DHGNN), a novel framework that addresses these limitations by incorporating homophily-aware and direction-sensitive components. DHGNN employs a resettable gating mechanism to adaptively modulate message contributions based on homophily levels and informativeness, and a structure-aware noise-tolerant fusion module to effectively integrate node representations from the original and reverse directions. Extensive experiments on both homophilic and heterophilic directed graph datasets demonstrate that DHGNN outperforms state-of-the-art methods in node classification and link prediction. In particular, DHGNN improves over the best baseline by up to 15.07\
Benchmark Results
Tested on 3 datasets 17 baseline values reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
Heterophilic Graphs
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | Hetero-S (GAT 8-layer) | 0.8693 | |
| 2 | Dir-GNN+CNA | 0.8586
±0.0180 | |
| 3 | GAT | 0.8560 best reported | best at pub: The Heterophilic Snowflake Hypothesis: Training and Empowering GNNs for Heterophilic Graphs (KDD 2024) |
| 7 | Dir-GNN | 0.8048
±0.0146 best reported | best at pub: Graph Neural Networks Need Cluster-Normalize-Activate Modules (NeurIPS 2024) Difference within reported uncertainty; not counted as underperformance. |
| 10 | DHGNN | 0.8011
±0.0173 | This paper |
| 14 | NDDGNN | 0.7979
±0.0104 | This paper |
| 25 | FSGNN | 0.7827
±0.0128 | This paper |
| 28 | ACM-GCN | 0.7476
±0.0220 | prev best: Diffusion on Graph: Augmentation of Graph Structure for Node Classification (TMLR 2025) |
| 44 | G^2 | 0.7140
±0.0238 | This paper |
| 45 | GloGNN | 0.7133
±0.0242 best reported | best at pub: GPNet: Simplifying Graph Neural Networks via Multi-channel Geometric Polynomials (2022) best today: $P^2$GNN: Two Prototype Sets to boost GNN Performance (2026) |
| 52 | GCN | 0.7033 best reported | best at pub: Understanding Heterophily for Graph Neural Networks (ICML 2024) |
| 64 | LINKX | 0.6842
±0.0132 | This paper |
| 72 | GPRGNN | 0.6748
±0.0040 best reported | best at pub: LON-GNN: Spectral GNNs with Learnable Orthonormal Basis (2023) best today: $P^2$GNN: Two Prototype Sets to boost GNN Performance (2026) |
| 108 | SAGE | 0.6340
±0.0300 | |
| 133 | H2GCN | 0.6030
±0.0231 best reported | best at pub: Optimization-Induced Graph Implicit Nonlinear Diffusion (ICML 2022) Difference within reported uncertainty; not counted as underperformance. |
| 147 | MagNet | 0.5832
±0.0287 | prev best: Scale-aware Message Passing For Graph Node Classification (2024) Improvement within reported uncertainty; not highlighted. |
| 169 | MLP | 0.5429 best reported | best at pub: Understanding Heterophily for Graph Neural Networks (ICML 2024) |
| 179 | DI-GCN | 0.5224
±0.0365 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | IBG-NN | 0.7763
±0.0179 | |
| 2 | Dir-GNN+CNA | 0.7747
±0.0128 | |
| 3 | DHGNN | 0.7684
±0.0161 | This paper |
| 7 | Dir-GNN | 0.7560
±0.0190 best reported | best at pub: Scale-aware Message Passing For Graph Node Classification (2024) Difference within reported uncertainty; not counted as underperformance. |
| 8 | NDDGNN | 0.7538
±0.0195 | This paper |
| 11 | FSGNN | 0.7416 best reported | best at pub: Simplifying approach to Node Classification in Graph Neural Networks (2021) Difference within reported uncertainty; not counted as underperformance. |
| 19 | GloGNN | 0.7121
±0.0184 | |
| 25 | ACM-GCN | 0.6740
±0.0221 | |
| 31 | G^2 | 0.6426
±0.0238 | This paper |
| 39 | H2GCN | 0.6190
±0.0140 best reported | best at pub: Efficient Learning on Large Graphs using a Densifying Regularity Lemma (2025) |
| 40 | LINKX | 0.6181
±0.0180 | This paper |
| 46 | GCN | 0.6067 best reported | best at pub: Understanding Heterophily for Graph Neural Networks (ICML 2024) |
| 67 | GAT | 0.5630
±0.0220 best reported | best at pub: Restructuring Graphs for Higher Homophily via Adaptive Spectral Clustering (AAAI 2022) |
| 76 | GPRGNN | 0.5435
±0.0087 | prev best: LON-GNN: Spectral GNNs with Learnable Orthonormal Basis (2023) |
| 120 | SAGE | 0.4460
±0.0130 | |
| 136 | MagNet | 0.4270
±0.0150 best reported | |
| 172 | MLP | 0.3930
±0.0079 best reported | best at pub: Understanding Heterophily for Graph Neural Networks (ICML 2024) |
| 189 | DI-GCN | 0.3774
±0.0154 | This paper |
Heterophily Benchmark
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | Dir-Poly | 0.9451
±0.0022 | |
| 2 | D-CDE | 0.9387
±0.0041 | |
| 3 | LargeScaleNet | 0.9358
±0.0024 | |
| 14 | NDDGNN | 0.9176
±0.0027 | This paper |
| 24 | Dir-GNN | 0.9123
±0.0032 | This paper |
| 26 | GraphSAGE | 0.9106
±0.0027 | |
| 36 | DHGNN | 0.8905
±0.0053 | This paper |
| 47 | MagNet | 0.8807
±0.0027 | This paper |
| 77 | GCN | 0.8272
±0.0082 best reported | best at pub: HyperAggregation: Aggregating over Graph Edges with Hypernetworks (2024) |
| 80 | G^2 | 0.8216
±0.0078 | This paper |
| 83 | GAT | 0.8145
±0.0009 best reported | best at pub: Graph Neural Networks for Graphs with Heterophily: A Survey (2022) best today: Gumbel-MPNN: Graph Rewiring with Gumbel-Softmax (2025) |
| 92 | FSGNN | 0.7992
±0.0056 | This paper |
| 115 | ACM-GCN | 0.7189
±0.0061 best reported | best at pub: Graph Neural Networks for Graphs with Heterophily: A Survey (2022) |
| 129 | H2GCN | 0.6809
±0.0029 best reported | best at pub: Unleashing the Potential of Fractional Calculus in Graph Neural Networks with FROND (ICLR 2024) best today: Distributed-Order Fractional Graph Operating Network (NeurIPS 2024) |
| 133 | GPRGNN | 0.6704
±0.0092 best reported | best at pub: NTFormer: A Composite Node Tokenized Graph Transformer for Node Classification (2024) |
| 135 | MLP | 0.6665
±0.0047 best reported | best at pub: HyperAggregation: Aggregating over Graph Edges with Hypernetworks (2024) |
| 154 | GloGNN | 0.6385
±0.0049 best reported | best at pub: Unleashing the Potential of Fractional Calculus in Graph Neural Networks with FROND (ICLR 2024) best today: Distributed-Order Fractional Graph Operating Network (NeurIPS 2024) |
| 168 | LINKX | 0.5914
±0.0045 best reported | best at pub: Graph Neural Networks for Graphs with Heterophily: A Survey (2022) |
| 183 | DI-GCN | 0.5271
±0.0032 | This paper |
