Alternatives and similar repositories for Equivalence

Users that are interested in Equivalence are comparing it to the libraries listed below

• bluer555 / KernelGCN
  Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs
  ☆34Updated 5 years ago
• vikasverma1077 / GraphMix
  Code for reproducing results in GraphMix paper
  ☆72Updated 2 years ago
• PurdueMINDS / RelationalPooling
  ☆35Updated 5 years ago
• karl-zhao / benchmarking-gnns-pyg
  ☆31Updated 2 years ago
• ermongroup / graphite
  Code for Graphite iterative graph generation
  ☆59Updated 5 years ago
• chrsmrrs / sparsewl
  Code for "Weisfeiler and Leman go sparse: Towards higher-order graph embeddings"
  ☆22Updated 3 years ago
• cvignac / SMP
  ☆28Updated 3 years ago
• chentingpc / gfn
  Code for "Are Powerful Graph Neural Nets Necessary? A Dissection on Graph Classification"
  ☆52Updated 5 years ago
• cshjin / gnn_in_neurips_2019
  A comprehensive collection of GNN works in NeurIPS 2019.
  ☆21Updated 5 years ago
• matenure / OTCoarsening
  Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport
  ☆36Updated 4 years ago
• KangchengHou / gntk
  Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)
  ☆104Updated 5 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 4 years ago
• yifan-h / CS-GNN
  Measuring and Improving the Use of Graph Information in Graph Neural Networks
  ☆82Updated 10 months ago
• dalab / matrix-manifolds
  Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper
  ☆36Updated 4 years ago
• ebonilla / VGCN
  Variational Graph Convolutional Networks
  ☆23Updated 4 years ago
• leichen2018 / Ring-GNN
  ☆12Updated 5 years ago
• nimadehmamy / Understanding-GCN
  code for the paper in NeurIPS 2019
  ☆40Updated 2 years ago
• flyingtango / DiGCL
  The PyTorch implementation of Directed Graph Contrastive Learning (DiGCL), NeurIPS-2021
  ☆35Updated 3 years ago
• danielzuegner / robust-gcn
  Implementation of the paper "Certifiable Robustness and Robust Training for Graph Convolutional Networks".
  ☆43Updated 4 years ago
• LingxiaoShawn / PairNorm
  Source code for PairNorm (ICLR 2020)
  ☆77Updated 5 years ago
• acbull / LADIES
  Code for NeurIPS'19 "Layer-Dependent Importance Sampling for Training Deep and Large Graph Convolutional Networks"
  ☆76Updated 2 years ago
• guillaumejaume / edGNN
  Code for the paper: "edGNN: A simple and powerful GNN for labeled graphs"
  ☆43Updated 2 years ago
• nikhil-dce / SBM-meet-GNN
  Implementation of SBM-meet-GNN
  ☆23Updated 6 years ago
• HongtengXu / Relational-Factorization-Model
  Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)
  ☆31Updated 2 years ago
• hadarser / ProvablyPowerfulGraphNetworks
  ☆16Updated 5 years ago
• leichen2018 / GNN-Substructure-Counting
  The official implementation of ''Can Graph Neural Networks Count Substructures?'' NeurIPS 2020
  ☆34Updated 4 years ago
• tech-srl / bottleneck
  Code for the paper: "On the Bottleneck of Graph Neural Networks and Its Practical Implications"
  ☆94Updated 3 years ago
• Haggaim / InvariantGraphNetworks
  Code for the ICLR 2019 paper "Invariant and Equiovariant Graph Networks"
  ☆24Updated 5 years ago
• kd383 / NetworkDOS
  Network Density of States (https://arxiv.org/abs/1905.09758) (KDD 2019)
  ☆25Updated 5 years ago
• nkeriven / random-graph-gnn
  ☆12Updated 4 years ago