Complex-Weighted Convolutional Networks: Provable Expressiveness via Complex Diffusion
Abstract
Graph Neural Networks (GNNs) have achieved remarkable success across diverse applications, yet they remain limited by oversmoothing and poor performance on heterophilic graphs. To address these challenges, we introduce a novel framework that equips graphs with a complex-weighted structure, assigning each edge a complex number to drive a diffusion process that extends random walks into the complex domain. We prove that this diffusion is highly expressive: with appropriately chosen complex weights, any node-classification task can be solved in the steady state of a complex random walk. Building on this insight, we propose the Complex-Weighted Convolutional Network (CWCN), which learns suitable complex-weighted structures directly from data while enriching diffusion with learnable matrices and nonlinear activations. CWCN is simple to implement, requires no additional hyperparameters beyond those of standard GNNs, and achieves competitive performance on benchmark datasets. Our results demonstrate that complex-weighted diffusion provides a principled and general mechanism for enhancing GNN expressiveness, opening new avenues for models that are both theoretically grounded and practically effective.https://github.com/clopezamado/complex-weighted-convolutional-networks.git
Benchmark Results
Tested on 3 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 | |
| 28 | GPRGNN | 0.9295
±0.0131 best reported | best at pub: GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers (ICML 2024) |
| 34 | MLP | 0.9230
±0.0070 | |
| 53 | GraphSAGE | 0.9000
±0.0365 | |
| 126 | SCN | 0.8595
±0.0695 | This paper |
| 168 | CWCN | 0.8405
±0.0645 | This paper |
| 182 | BLEND | 0.8324
±0.0464 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | P^2GNN | 0.9541
±0.0272 | |
| 2 | ACM-GCN | 0.9480
±0.0380 | |
| 3 | RF-GCN | 0.9429 | |
| 24 | MLP | 0.9136
±0.0070 | |
| 96 | SCN | 0.8486
±0.0471 | This paper |
| 121 | CWCN | 0.8351
±0.0815 | This paper |
| 138 | SAGE | 0.8269 |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | DiGGR | 0.4535
±0.0353 | |
| 2 | TRIGON | 0.4402
±0.0028 | |
| 3 | DoG | 0.4320
±0.0120 | |
| 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 | |
| 52 | GPRGNN | 0.3992
±0.0067 best reported | best at pub: LON-GNN: Spectral GNNs with Learnable Orthonormal Basis (2023) best today: GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers (ICML 2024) |
| 56 | FAGCN | 0.3970 best reported | best at pub: Beyond Low-frequency Information in Graph Convolutional Networks (AAAI 2021) |
| 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 best reported | best at pub: A Quasi-Wasserstein Loss for Learning Graph Neural Networks (WWW 2023) |
| 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) |
| 87 | Geom-GCN | 0.3810 best reported | best at pub: Beyond Low-frequency Information in Graph Convolutional Networks (AAAI 2021) |
| 96 | GREAD | 0.3790
±0.0117 | This paper |
| 103 | SCN | 0.3781
±0.0115 | This paper |
| 135 | GCN | 0.3690 best reported | best at pub: Beyond Low-frequency Information in Graph Convolutional Networks (AAAI 2021) |
| 161 | CWCN | 0.3651
±0.0126 | This paper |
| 162 | MixHop | 0.3648
±0.0120 best reported | best at pub: Towards Deep Attention in Graph Neural Networks: Problems and Remedies (ICML 2023) |
| 182 | GAT | 0.3605
±0.0035 best reported | best at pub: Hierarchical Graph Transformer with Adaptive Node Sampling (NeurIPS 2022) |
| 201 | BLEND | 0.3563
±0.0101 | This paper |
| 266 | GIN | 0.3410
±0.0030 | |
| 408 | PairNorm | 0.2740
±0.0124 | This paper |
