Beyond 1-WL with Local Ego-Network Encodings
Not on the map. Why?
Abstract (arXiv)
Identifying similar network structures is key to capture graph isomorphisms and learn representations that exploit structural information encoded in graph data. This work shows that ego-networks can produce a structural encoding scheme for arbitrary graphs with greater expressivity than the Weisfeiler-Lehman (1-WL) test. We introduce IGEL, a preprocessing step to produce features that augment node representations by encoding ego-networks into sparse vectors that enrich Message Passing (MP) Graph Neural Networks (GNNs) beyond 1-WL expressivity. We describe formally the relation between IGEL and 1-WL, and characterize its expressive power and limitations. Experiments show that IGEL matches the empirical expressivity of state-of-the-art methods on isomorphism detection while improving performance on seven GNN architectures.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 34 of its 42 references that are in the map. First posted on arXiv 27 Nov 2022.
Builds on
34 of 42 references.
References · 34
- 2017Graph Attention Networkscited by 8,854
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2018How Powerful are Graph Neural Networks?cited by 4,355
- 2017Neural Message Passing for Quantum Chemistrycited by 3,460
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
- 2016node2vec: Scalable Feature Learning for Networkscited by 1,913
- 2014DeepWalk: Online Learning of Social Representationscited by 1,543
- 2018Graph Convolutional Neural Networks for Web-Scale Recommender Systemscited by 1,133
- 2021Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gaugescited by 1,131
- 2018Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networkscited by 878
- 2015Convolutional Networks on Graphs for Learning Molecular Fingerprintscited by 751
- 2020TUDataset: A collection of benchmark datasets for learning with graphscited by 718
22 more
- 2020Benchmarking Graph Neural Networkscited by 672
- 2016Interaction Networks for Learning about Objects, Relations and Physicscited by 503
- 2019Provably Powerful Graph Networkscited by 385
- 2020Improving Graph Neural Network Expressivity via Subgraph Isomorphism Countingcited by 312
- 2020Can Graph Neural Networks Count Substructures?cited by 235
- 2021Weisfeiler and Lehman Go Cellular: CW Networkscited by 218
- 2019Position-aware Graph Neural Networkscited by 203
- 2021Identity-aware Graph Neural Networkscited by 197
- 2020The Surprising Power of Graph Neural Networks with Random Node Initializationcited by 190
- 2020Design Space for Graph Neural Networkscited by 182
- 2021Equivariant Subgraph Aggregation Networkscited by 154
- 2021From Stars to Subgraphs: Uplifting Any GNN with Local Structure Awarenesscited by 154
- 2021Nested Graph Neural Networkscited by 136
- 2021Weisfeiler and Leman go Machine Learning: The Story so farcited by 121
- 2021Breaking the Limits of Message Passing Graph Neural Networkscited by 101
- 2018NeVAE: A Deep Generative Model for Molecular Graphscited by 66
- 2018On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Propertiescited by 63
- 2019k-hop Graph Neural Networkscited by 57
- 2022Message passing all the way upcited by 47
- 2021Ego-GNNs: Exploiting Ego Structures in Graph Neural Networkscited by 17
- 2017On the expressive power of query languages for matricescited by 14
- 2018On the expressive power of linear algebra on graphscited by 14
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 1.
2 papers.