PC-Conv: Unifying Homophily and Heterophily with Two-fold Filtering
Abstract
Recently, many carefully crafted graph representation learning methods have achieved impressive performance on either strong heterophilic or homophilic graphs, but not both. Therefore, they are incapable of generalizing well across real-world graphs with different levels of homophily. This is attributed to their neglect of homophily in heterophilic graphs, and vice versa. In this paper, we propose a two-fold filtering mechanism to extract homophily in heterophilic graphs and vice versa. In particular, we extend the graph heat equation to perform heterophilic aggregation of global information from a long distance. The resultant filter can be exactly approximated by the Possion-Charlier (PC) polynomials. To further exploit information at multiple orders, we introduce a powerful graph convolution PC-Conv and its instantiation PCNet for the node classification task. Compared with state-of-the-art GNNs, PCNet shows competitive performance on well-known homophilic and heterophilic graphs. Our implementation is available at https://github.com/uestclbh/PC-Conv.
Benchmark Results
Tested on 4 datasets 9 baseline values reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
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 | |
| 5 | ACM-GCN | 0.9557
±0.0360 best reported | best at pub: From Node Interaction to Hop Interaction: New Effective and Scalable Graph Learning Paradigm (2022) best today: $P^2$GNN: Two Prototype Sets to boost GNN Performance (2026) |
| 34 | MLP | 0.9230
±0.0070 | |
| 39 | GGCN | 0.9213
±0.0305 best reported | best at pub: Understanding convolution on graphs via energies (TMLR 2022) best today: Graph Wave Networks (WWW 2025) |
| 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. |
| 53 | GraphSAGE | 0.9000
±0.0365 | |
| 104 | WRGAT | 0.8698 best reported | best at pub: From Node Interaction to Hop Interaction: New Effective and Scalable Graph Learning Paradigm (2022) best today: Global-Local Graph Neural Networks for Node-Classification (2024) Difference within reported uncertainty; not counted as underperformance. |
| 141 | GloGNN | 0.8524
±0.0490 best reported | best at pub: Finding Global Homophily in Graph Neural Networks When Meeting Heterophily (ICML 2022) best today: $P^2$GNN: Two Prototype Sets to boost GNN Performance (2026) Difference within reported uncertainty; not counted as underperformance. |
| 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) |
| 276 | MixHop | 0.7784
±0.0773 | This paper |
| 325 | LINKX | 0.7460
±0.0837 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | P^2GNN | 0.9541
±0.0272 | |
| 2 | ACM-GCN | 0.9480
±0.0380 best reported | best at pub: From Node Interaction to Hop Interaction: New Effective and Scalable Graph Learning Paradigm (2022) best today: Heterophily-informed Message Passing (TMLR 2025) |
| 3 | RF-GCN | 0.9429 | |
| 15 | GGCN | 0.9230
±0.0367 best reported | best at pub: Understanding convolution on graphs via energies (TMLR 2022) best today: $P^2$GNN: Two Prototype Sets to boost GNN Performance (2026) Difference within reported uncertainty; not counted as underperformance. |
| 24 | MLP | 0.9136
±0.0070 | |
| 68 | H2GCN | 0.8623
±0.0471 best reported | best at pub: Graph-Coupled Oscillator Networks (ICML 2022) best today: $P^2$GNN: Two Prototype Sets to boost GNN Performance (2026) Difference within reported uncertainty; not counted as underperformance. |
| 74 | GloGNN | 0.8595
±0.0510 | This paper |
| 123 | LINKX | 0.8346
±0.0061 best reported | best at pub: GPNet: Simplifying Graph Neural Networks via Multi-channel Geometric Polynomials (2022) best today: Differentiable Cluster Graph Neural Network (2024) Difference within reported uncertainty; not counted as underperformance. |
| 138 | SAGE | 0.8269 | |
| 158 | GAT | 0.8190
±0.0540 best reported | best at pub: Restructuring Graphs for Higher Homophily via Adaptive Spectral Clustering (AAAI 2022) |
| 160 | WRGAT | 0.8162
±0.0390 | This paper |
| 183 | MixHop | 0.7950
±0.0630 best reported | best at pub: Label-Wise Graph Convolutional Network for Heterophilic Graphs (2021) Difference within reported uncertainty; not counted as underperformance. |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | DiGGR | 0.4535
±0.0353 | |
| 2 | TRIGON | 0.4402
±0.0028 | |
| 3 | DoG | 0.4320
±0.0120 | |
| 16 | ACM-GCN | 0.4198
±0.0089 best reported | best at pub: ES-GNN: Generalizing Graph Neural Networks Beyond Homophily with Edge Splitting (2022) best today: $P^2$GNN: Two Prototype Sets to boost GNN Performance (2026) |
| 38 | GCNII | 0.4082
±0.0179 best reported | best at pub: Feature Expansion for Graph Neural Networks (ICML 2023) best today: $P^2$GNN: Two Prototype Sets to boost GNN Performance (2026) |
| 42 | MLP | 0.4026
±0.0108 | |
| 58 | GloGNN | 0.3959
±0.0029 best reported | best at pub: SignGT: Signed Attention-based Graph Transformer for Graph Representation Learning (2023) Difference within reported uncertainty; not counted as underperformance. |
| 62 | GGCN | 0.3929
±0.0048 best reported | best at pub: Feature Transportation Improves Graph Neural Networks (AAAI 2023) best today: $P^2$GNN: Two Prototype Sets to boost GNN Performance (2026) Difference within reported uncertainty; not counted as underperformance. |
| 68 | GraphSAGE | 0.3899
±0.0085 | |
| 71 | H2GCN | 0.3885
±0.0117 best reported | best at pub: ES-GNN: Generalizing Graph Neural Networks Beyond Homophily with Edge Splitting (2022) best today: $P^2$GNN: Two Prototype Sets to boost GNN Performance (2026) |
| 75 | WRGAT | 0.3860
±0.0110 best reported | best at pub: ES-GNN: Generalizing Graph Neural Networks Beyond Homophily with Edge Splitting (2022) |
| 162 | MixHop | 0.3648
±0.0120 best reported | best at pub: Towards Deep Attention in Graph Neural Networks: Problems and Remedies (ICML 2023) |
| 180 | LINKX | 0.3610
±0.0155 | This paper |
| 182 | GAT | 0.3605
±0.0035 best reported | best at pub: Hierarchical Graph Transformer with Adaptive Node Sampling (NeurIPS 2022) |
LINKX Benchmarks
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | DC-GNN | 0.8669
±0.0022 | |
| 2 | M2M-GNN | 0.8594
±0.0040 | |
| 3 | GloGNN | 0.8574
±0.0042 | prev best: Uplifting Message Passing Neural Network with Graph Original Information (2022) Improvement within reported uncertainty; not highlighted. |
| 9 | PCNet | 0.8475
±0.0051 | This paper |
| 11 | LINKX | 0.8471
±0.0052 | This paper |
| 13 | GPRGNN | 0.8455
±0.0054 best reported | best at pub: Clarify Confused Nodes via Separated Learning (2023) |
| 17 | MixHop | 0.8363
±0.0054 best reported | best at pub: Uplifting Message Passing Neural Network with Graph Original Information (2022) Difference within reported uncertainty; not counted as underperformance. |
| 24 | H2GCN | 0.8320
±0.0055 best reported | best at pub: Clarify Confused Nodes via Separated Learning (2023) |
| 26 | ACM-GCN | 0.8298
±0.0063 best reported | best at pub: Clarify Confused Nodes via Separated Learning (2023) Difference within reported uncertainty; not counted as underperformance. |
| 27 | GCNII | 0.8292
±0.0059 | This paper |
| 29 | GIN | 0.8268
±0.0032 | |
| 31 | GCN | 0.8247
±0.0027 | This paper |
| 36 | GAT | 0.8153
±0.0055 | This paper |
| 51 | MLP | 0.7534
±0.0064 best reported | best at pub: Clarify Confused Nodes via Separated Learning (2023) |
| 54 | WRGAT | 0.7432
±0.0053 | This paper |
