alelab-upenn / graph-scattering-transformsLinks
Code for experimentation on graph scattering transforms
☆30Updated 5 years ago
Alternatives and similar repositories for graph-scattering-transforms
Users that are interested in graph-scattering-transforms are comparing it to the libraries listed below
Sorting:
- Code for Optimal Transport for structured data with application on graphs☆102Updated 2 years ago
- Code for Graph Normalizing Flows.☆63Updated 5 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- Code for the paper "Topological Autoencoders" by Michael Moor, Max Horn, Bastian Rieck, and Karsten Borgwardt.☆150Updated 3 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆37Updated 5 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆45Updated 2 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆29Updated 6 years ago
- Official implementation of Joint Multidimensional Scaling☆22Updated last year
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆42Updated last year
- Neural Graph Differential Equations (Neural GDEs)☆207Updated 4 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆27Updated 2 years ago
- Stochastic algorithms for computing Regularized Optimal Transport☆58Updated 7 years ago
- Learning Autoencoders with Relational Regularization☆46Updated 5 years ago
- GraphCON (ICML 2022)☆59Updated 3 years ago
- ☆37Updated 5 years ago
- A Pytorch implementation of missing data imputation using optimal transport.☆104Updated 4 years ago
- Code implementation of paper: Deep Network Classification by Scattering and Homotopy Dictionary Learning☆25Updated 4 years ago
- Wasserstein Weisfeiler-Lehman Graph Kernels☆85Updated last year
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆44Updated 6 years ago
- Scattering GCN: overcoming oversmoothness in graph convolutional networks☆25Updated 3 years ago
- Official code for the ICLR 2021 paper Neural ODE Processes☆75Updated 3 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 6 years ago
- Code for Sliced Gromov-Wasserstein☆69Updated 5 years ago
- Statistics on the space of asymmetric networks via Gromov-Wasserstein distance☆13Updated 5 years ago
- Code for the KDD 2021 paper 'Filtration Curves for Graph Representation'☆18Updated 2 years ago
- Official implementation for the paper: Permutation Invariant Graph Generation via Score-Based Generative Modeling☆112Updated 2 years ago
- Code corresponding to the paper Diffusion Earth Mover's Distance and Distribution Embeddings☆38Updated 10 months ago
- The essence of my research, distilled for reusability. Enjoy 🥃!☆71Updated last year
- Code for Graphite iterative graph generation☆59Updated 6 years ago
- Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)☆16Updated 5 years ago