Diss-l-ECT: Dissecting Graph Data with Local Euler Characteristic Transforms
Not on the map. Why?
Abstract (arXiv)
The Euler Characteristic Transform (ECT) is an efficiently-computable geometrical-topological invariant that characterizes the global shape of data. In this paper, we introduce the Local Euler Characteristic Transform (ℓ-ECT), a novel extension of the ECT particularly designed to enhance expressivity and interpretability in graph representation learning. Unlike traditional Graph Neural Networks (GNNs), which may lose critical local details through aggregation, the ℓ-ECT provides a lossless representation of local neighborhoods. This approach addresses key limitations in GNNs by preserving nuanced local structures while maintaining global interpretability. Moreover, we construct a rotation-invariant metric based on ℓ-ECTs for spatial alignment of data spaces. Our method exhibits superior performance compared to standard GNNs on a variety of node-classification tasks, while also offering theoretical guarantees that demonstrate its effectiveness.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 50 of its 67 references that are in the map. First posted on arXiv 3 Oct 2024.
Builds on
50 of 67 references.
References · 50
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Graph Attention Networkscited by 8,854
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2016Layer Normalizationcited by 5,579
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
- 2018How Powerful are Graph Neural Networks?cited by 4,355
- 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,414
- 2019Simplifying Graph Convolutional Networkscited by 1,470
- 2018Pitfalls of Graph Neural Network Evaluationcited by 994
- 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 970
- 2020Geom-GCN: Geometric Graph Convolutional Networkscited by 821
38 more
- 2022Recipe for a General, Powerful, Scalable Graph Transformercited by 702
- 2020Adaptive Universal Generalized PageRank Graph Neural Networkcited by 592
- 2019Multi-scale Attributed Node Embeddingcited by 543
- 2020Masked Label Prediction: Unified Message Passing Model for Semi-Supervised Classificationcited by 500
- 2021Understanding over-squashing and bottlenecks on graphs via curvaturecited by 471
- 2021Beyond Low-frequency Information in Graph Convolutional Networkscited by 361
- 2023A critical look at the evaluation of GNNs under heterophily: Are we really making progress?cited by 332
- 2021Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methodscited by 309
- 2020Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networkscited by 253
- 2023A Survey on Oversmoothing in Graph Neural Networkscited by 246
- 2020Can Graph Neural Networks Count Substructures?cited by 235
- 2021Weisfeiler and Lehman Go Topological: Message Passing Simplicial Networkscited by 219
- 2020Graph Neural Networks with Heterophilycited by 202
- 2022Finding Global Homophily in Graph Neural Networks When Meeting Heterophilycited by 179
- 2022How Powerful are Spectral Graph Neural Networkscited by 169
- 2022Revisiting Heterophily For Graph Neural Networkscited by 169
- 2023On Over-Squashing in Message Passing Neural Networks: The Impact of Width, Depth, and Topologycited by 163
- 2021Weisfeiler and Leman go Machine Learning: The Story so farcited by 121
- 2020Simplicial Neural Networkscited by 105
- 2021Breaking the Limit of Graph Neural Networks by Improving the Assortativity of Graphs with Local Mixing Patternscited by 95
- 2023On the Expressive Power of Geometric Graph Neural Networkscited by 89
- 2021Topological Graph Neural Networkscited by 86
- 2023Everything is Connected: Graph Neural Networkscited by 85
- 2021GBK-GNN: Gated Bi-Kernel Graph Neural Networks for Modeling Both Homophily and Heterophilycited by 84
- 2023Attending to Graph Transformerscited by 81
- 2019Graph Filtration Learningcited by 68
- 2024Position: Topological Deep Learning is the New Frontier for Relational Learningcited by 65
- 2020Graph Kernels: State-of-the-Art and Future Challengescited by 63
- 2019Learning metrics for persistence-based summaries and applications for graph classificationcited by 57
- 2021Improving Graph Neural Networks with Simple Architecture Designcited by 41
- 2021Simplicial Convolutional Neural Networkscited by 40
- 2023Curvature Filtrations for Graph Generative Model Evaluationcited by 18
- 2023Differentiable Euler Characteristic Transforms for Shape Classificationcited by 18
- 2023Simplicial Representation Learning with Neural k-Formscited by 18
- 2024Topological Neural Networks go Persistent, Equivariant, and Continuouscited by 15
- 2022Modeling the Machine Learning Multiversecited by 11
- 2022Topological Singularity Detection at Multiple Scalescited by 11
- 2024Mapping the Multiverse of Latent Representationscited by 5
Built on by
Citing papers per year: 2024: 1; 2025: 2; 2026: 3.
6 papers.
- 2024Point Cloud Synthesis Using Inner Product Transformscited by 2
- 2025LEAP: Local ECT-Based Learnable Positional Encodings for Graphscited by 2
- 2025On topological descriptors for graph productscited by 2
- 2026Global and Local Topology-Aware Attention with Persistent Homology and Euler Biases for Time-Series Forecastingcited by 0
- 2026Geometry-Aware Simplicial Message Passingcited by 0
- 2026Encoding the Euler Characteristic Transformcited by 0
- 2026Encoding the Euler Characteristic Transform9 Jun 2026
- 2026Geometry-Aware Simplicial Message Passing7 May 2026
- 2026Global and Local Topology-Aware Attention with Persistent Homology and Euler Biases for Time-Series Forecasting4 May 2026
- 2025On topological descriptors for graph products12 Nov 2025
- 2025LEAP: Local ECT-Based Learnable Positional Encodings for Graphs1 Oct 2025
- 2024Point Cloud Synthesis Using Inner Product Transforms9 Oct 2024