Physics-Aware Random Walk Fingerprints for Scalable Power Grid Graph Classification
Organizations: School of Information Technology and a member of the Deakin Cyber Research & Innovation Hub, Deakin University, Melbourne, Australia
Abstract
Recent benchmarks such as PowerGraph provide large collections of power-grid graphs for cascading-failure classification. Graph neural networks (GNNs) achieve strong predictive performance on this task, but typically require end-to-end training and model-specific tuning, while their latent representations can be difficult to relate to physically meaningful propagation patterns. Random Walk Fingerprints (RWF) offer a scalable and interpretable alternative, but existing variants primarily emphasise topology and node-level information, leaving grid-relevant operational edge states in the walk dynamics. We propose Multi-Channel Physics-Aware Random Walk Fingerprints (MC-PA-RWF) for power systems, a lightweight graph-level representation framework that introduces physical edge states into random-walk propagation. The method constructs multiple edge-weighted channels from domain-relevant attributes, extracts a channel-specific fingerprint from each weighted graph, and concatenates the resulting vectors into a compact representation. Experiments on three PowerGraph benchmark systems show substantial improvements over topology-only RWF and competitive balanced accuracy against strong GNN baselines, including Graph Convolutional Networks (GCN), Graph Attention Networks (GAT), Graph Isomorphism Networks with edge features (GINE), and Transformer-based Graph Convolutional Networks (TransformerConv). At the largest evaluated settings, the node-edge extension MC-PA-RWF+ achieves around 98.04% - 99.32% balanced accuracy and improves failure-class F1 over the strongest GNN baseline by 1.60 -- 5.84 percentage points, with statistically significant gains across all three systems.
Figures & tables
| Method | Time complexity |
|---|---|
| Random walk kernel [ 12 ] | |
| NetLSD [ 13 ] | |
| FGSD [ 14 ] | |
| NetSimile [ 16 ] | |
| RWF-D [ 8 ] | |
| RWF-D-feature [ 8 ] |
| Dataset | Nodes | Edges | Graphs | Used | Classes |
|---|---|---|---|---|---|
| IEEE24 | 24 | 38 | 21,500 | 1k–21.5k | Stable / Failure-prone |
| IEEE39 | 39 | 46 | 28,000 | 1k–28k | Stable / Failure-prone |
| UK | 29 | 99 | 64,000 | 5k–64k | Stable / Failure-prone |
| Family | Method | 1k | 3k | 5k | 10k | 15k | 21.5k |
|---|---|---|---|---|---|---|---|
| RWF (Original) | RWF-D [ 8 ] | 71.78 4.15 | 72.29 4.12 | 66.75 1.22 | 67.51 1.77 | 67.06 1.26 | 67.04 0.74 |
| RWF-D-feature [ 8 ] | 93.00 5.70 | 96.09 1.86 | 96.33 1.59 | 97.02 1.11 | 97.50 1.00 | 97.81 0.45 | |
| GNN | GCN [ 4 ] | 75.53 2.66 | 85.01 4.50 | 89.04 1.54 | 92.80 0.85 | 93.90 1.14 | 95.23 1.25 |
| GAT [ 5 ] | 76.98 2.06 | 88.50 1.95 | 90.29 1.38 | 91.96 1.47 | 93.34 1.99 | 92.90 2.06 | |
| GINE [ 6 ] | 83.38 4.54 | 93.45 2.74 | 92.51 2.81 | 96.82 0.62 | 97.78 0.51 | 97.84 0.82 | |
| TransformerConv [ 7 ] | 88.43 3.20 | 94.42 1.96 | 95.23 1.93 | 97.59 0.67 | 98.06 1.08 | 98.76 0.49 |
| Family | Method | 1k | 3k | 5k | 10k | 20k | 28k |
|---|---|---|---|---|---|---|---|
| RWF (Original) | RWF-D [ 8 ] | 62.43 7.51 | 69.88 3.98 | 73.28 3.16 | 69.51 2.54 | 71.23 1.86 | 71.96 1.48 |
| RWF-D-feature [ 8 ] | 73.65 7.96 | 92.03 3.35 | 95.74 2.70 | 98.12 0.83 | 97.66 0.72 | 98.15 0.37 | |
| GNN | GCN [ 4 ] | 76.67 9.20 | 82.69 3.50 | 84.07 3.37 | 89.05 2.50 | 91.04 1.69 | 93.96 1.30 |
| GAT [ 5 ] | 78.22 6.09 | 83.09 4.33 | 84.56 3.86 | 89.01 1.86 | 90.13 2.37 | 90.48 0.96 | |
| GINE [ 6 ] | 86.75 9.39 | 91.75 2.49 | 94.33 1.31 | 96.56 1.52 | 97.87 0.55 | 97.41 0.80 | |
| TransformerConv [ 7 ] | 77.63 11.17 | 88.25 6.94 | 90.76 6.27 | 94.36 2.98 | 97.17 1.07 | 97.76 0.81 |
| Method | 1k | 3k | 5k | 10k | 20k | 28k |
|---|---|---|---|---|---|---|
| RWF-D-feature [ 8 ] | 82.05 6.76 | 93.99 3.71 | 97.22 1.70 | 98.44 0.48 | 98.51 0.34 | 98.63 0.38 |
| MC-PA-RWF (Adpt.) | 87.19 7.16 | 95.46 3.66 | 97.84 2.57 | 98.50 0.51 | 98.92 0.39 | 98.91 0.40 |
| Family | Method | 5k | 10k | 20k | 64k |
|---|---|---|---|---|---|
| RWF (Original) | RWF-D [ 8 ] | 50.00 0.00 | 50.30 0.68 | 50.00 0.00 | 50.77 0.47 |
| RWF-D-feature [ 8 ] | 50.00 0.00 | 50.00 0.00 | 50.14 0.30 | 51.79 0.27 | |
| RWF-D-feature-balanced | 50.10 4.85 | 52.84 5.25 | 57.51 4.41 | 58.54 1.94 | |
| GNN | GCN [ 4 ] | 91.46 8.17 | 94.39 1.75 | 95.10 1.70 | 96.43 1.25 |
| GAT [ 5 ] | 93.28 7.01 | 90.71 15.25 | 95.09 1.30 | 98.62 0.61 | |
| GINE [ 6 ] | 94.87 3.72 | 97.16 2.16 | 96.37 1.87 | 99.36 0.30 |
| Dataset | Size | Best GNN | GNN F1 | Prop. F1 | -value | Stat. Sig. |
|---|---|---|---|---|---|---|
| IEEE24 [ 2 ] | 21.5k | TransConv | 97.24% | 98.84% | 0.0015 | Yes |
| IEEE39 [ 2 ] | 28k | TransConv | 91.03% | 96.87% | 0.0024 | Yes |
| UK [ 2 ] | 64k | TransConv | 96.95% | 99.05% | 0.0147 | Yes |
Graph Classification
Graph classification assigns labels to whole graphs, using their connectivity, node and edge attributes, and learned representations.
See all 38 papers