Alternatives and similar repositories for graph-scattering-transforms

Users that are interested in graph-scattering-transforms are comparing it to the libraries listed below

• tvayer / FGW
  Code for Optimal Transport for structured data with application on graphs
  ☆102Updated 2 years ago
• trneedham / Spectral-Gromov-Wasserstein
  Graph matching and clustering by comparing heat kernels via optimal transport.
  ☆27Updated 2 years ago
• jliu / graph-normalizing-flows
  Code for Graph Normalizing Flows.
  ☆63Updated 6 years ago
• dalab / matrix-manifolds
  Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper
  ☆37Updated 5 years ago
• trneedham / gromov-wasserstein-statistics
  Statistics on the space of asymmetric networks via Gromov-Wasserstein distance
  ☆15Updated 5 years ago
• thibsej / unbalanced_gromov_wasserstein
  Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport
  ☆45Updated 2 years ago
• tk-rusch / GraphCON
  GraphCON (ICML 2022)
  ☆59Updated 3 years ago
• Zymrael / gde
  Neural Graph Differential Equations (Neural GDEs)
  ☆209Updated 4 years ago
• BorgwardtLab / topological-autoencoders
  Code for the paper "Topological Autoencoders" by Michael Moor, Max Horn, Bastian Rieck, and Karsten Borgwardt.
  ☆151Updated 3 years ago
• TheGravLab / A-Unifying-Framework-for-Spectrum-Preserving-Graph-Sparsification-and-Coarsening
  Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)
  ☆16Updated 5 years ago
• dimkal89 / rvae
  ☆37Updated 5 years ago
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆35Updated 4 years ago
• juntang-zhuang / TorchDiffEqPack
  ☆48Updated 2 years ago
• francoispierrepaty / SubspaceRobustWasserstein
  Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"
  ☆29Updated 6 years ago
• dms-net / scatteringGCN
  Scattering GCN: overcoming oversmoothness in graph convolutional networks
  ☆25Updated 3 years ago
• crisbodnar / ndp
  Official code for the ICLR 2021 paper Neural ODE Processes
  ☆75Updated 3 years ago
• muhanzhang / D-VAE
  D-VAE: A Variational Autoencoder for Directed Acyclic Graphs, NeurIPS 2019
  ☆145Updated 5 years ago
• HongtengXu / gwl
  Gromov-Wasserstein Learning for Graph Matching and Node Embedding
  ☆73Updated 6 years ago
• j-zarka / SparseScatNet
  Code implementation of paper: Deep Network Classification by Scattering and Homotopy Dictionary Learning
  ☆25Updated 4 years ago
• BorgwardtLab / WWL
  Wasserstein Weisfeiler-Lehman Graph Kernels
  ☆86Updated last year
• ermongroup / graphite
  Code for Graphite iterative graph generation
  ☆59Updated 6 years ago
• BorisMuzellec / MissingDataOT
  A Pytorch implementation of missing data imputation using optimal transport.
  ☆104Updated 4 years ago
• sigvae / SIGraphVAE
  ☆25Updated 6 years ago
• tvayer / SGW
  Code for Sliced Gromov-Wasserstein
  ☆69Updated 5 years ago
• KangchengHou / gntk
  Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)
  ☆105Updated 5 years ago
• cvignac / SMP
  ☆29Updated 4 years ago
• Hermina / GOT
  Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"
  ☆43Updated last year
• yincheng / GGP
  Code and data for the paper `Bayesian Semi-supervised Learning with Graph Gaussian Processes'
  ☆38Updated 7 years ago
• a-norcliffe / sonode
  Experiments from the paper "On Second Order Behaviour in Augmented Neural ODEs"
  ☆59Updated last year
• ermongroup / GraphScoreMatching
  Official implementation for the paper: Permutation Invariant Graph Generation via Score-Based Generative Modeling
  ☆113Updated 2 years ago