BorgwardtLab / filtration_curves
Code for the KDD 2021 paper 'Filtration Curves for Graph Representation'
☆18Updated last year
Alternatives and similar repositories for filtration_curves:
Users that are interested in filtration_curves are comparing it to the libraries listed below
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- Python-based persistent homology algorithms☆19Updated last year
- Official repository for the ICLR 2022 paper "Evaluation Metrics for Graph Generative Models: Problems, Pitfalls, and Practical Solutions"…☆14Updated 2 years ago
- Simplicial neural network benchmarking software☆17Updated 2 years ago
- This repository reproduces the results in the paper "How expressive are transformers in spectral domain for graphs?"(published in TMLR)☆12Updated 2 years ago
- ☆12Updated 3 years ago
- Official repository for On Over-Squashing in Message Passing Neural Networks (ICML 2023)☆14Updated last year
- ☆27Updated 3 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆26Updated 2 years ago
- Geo2DR: A Python and PyTorch library for learning distributed representations of graphs.☆45Updated last year
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆36Updated 4 years ago
- This repository holds code and other relevant files for the Learning on Graphs 2022 tutorial "Graph Rewiring: From Theory to Applications…☆55Updated 2 years ago
- Deep Graph Mapper: Seeing Graphs through the Neural Lens☆58Updated last year
- WKPI: A kernel based on persistent homology☆12Updated 4 years ago
- Topological Graph Neural Networks (ICLR 2022)☆122Updated 2 years ago
- Differentiable Euler Characteristic Transform☆17Updated 10 months ago
- ☆30Updated 2 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆31Updated 2 years ago
- Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)☆16Updated 4 years ago
- The official implementation of the Graph Barlow Twins method with the experimental pipeline☆30Updated last year
- A Persistent Weisfeiler–Lehman Procedure for Graph Classification☆61Updated 3 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆43Updated 5 years ago
- ☆20Updated 4 years ago
- "Shift-Robust GNNs: Overcoming the Limitations of Localized Graph Training Data" (NeurIPS 21')☆47Updated 2 years ago
- NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks☆36Updated last year
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 5 years ago
- Scattering GCN: overcoming oversmoothness in graph convolutional networks☆25Updated 2 years ago
- ☆12Updated 5 years ago
- ☆27Updated 3 months ago
- Graph transport network (GTN), as proposed in "Scalable Optimal Transport in High Dimensions for Graph Distances, Embedding Alignment, an…☆15Updated 2 years ago