Alternatives and similar repositories for random-graph-gnn

Users that are interested in random-graph-gnn are comparing it to the libraries listed below

• dalab / matrix-manifolds
  Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper
  ☆36Updated 4 years ago
• leichen2018 / Ring-GNN
  ☆12Updated 5 years ago
• bluer555 / KernelGCN
  Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs
  ☆34Updated 5 years ago
• delta2323 / GB-GNN
  Optimization and Generalization Analysis of Transduction through Gradient Boosting and Application to Multi-scale Graph Neural Networks
  ☆13Updated 4 years ago
• samihaija / isvd
  Official implementation of NeurIPS'21: Implicit SVD for Graph Representation Learning
  ☆20Updated 3 years ago
• chingyaoc / TMD
  NeurIPS 2022: Tree Mover’s Distance: Bridging Graph Metrics and Stability of Graph Neural Networks
  ☆36Updated last year
• YuGuangWang / HaarPool
  PyTorch Codes for Haar Graph Pooling
  ☆11Updated 2 years ago
• PurdueMINDS / RelationalPooling
  ☆35Updated 5 years ago
• karl-zhao / benchmarking-gnns-pyg
  ☆31Updated 2 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
• trneedham / Spectral-Gromov-Wasserstein
  Graph matching and clustering by comparing heat kernels via optimal transport.
  ☆26Updated 2 years ago
• BorgwardtLab / filtration_curves
  Code for the KDD 2021 paper 'Filtration Curves for Graph Representation'
  ☆18Updated last year
• cvignac / SMP
  ☆28Updated 3 years ago
• wooden-spoon / relational-ERM
  Software relating to relational empirical risk minimization
  ☆17Updated 3 years ago
• qslim / epcb-gnns
  ☆10Updated 2 years ago
• RPaolino / loopy
  ☆9Updated 9 months ago
• Haggaim / InvariantGraphNetworks
  Code for the ICLR 2019 paper "Invariant and Equiovariant Graph Networks"
  ☆24Updated 5 years ago
• delta2323 / gnn-asymptotics
  Code for Graph Neural Networks Exponentially Lose Expressive Power for Node Classification.
  ☆30Updated 5 years ago
• PurdueMINDS / Equivalence
  Equivalence Between Structural Representations and Positional Node Embeddings
  ☆22Updated 5 years ago
• nimadehmamy / Understanding-GCN
  code for the paper in NeurIPS 2019
  ☆40Updated 2 years ago
• G-Taxonomy-Workgroup / GTaxoGym
  Taxonomy of Benchmarks in Graph Representation Learning
  ☆19Updated 2 years ago
• csinva / mdl-complexity
  MDL Complexity computations and experiments from the paper "Revisiting complexity and the bias-variance tradeoff".
  ☆18Updated last year
• uestc-lese / SPGRL
  ☆17Updated 2 years ago
• inspire-group / robustness-via-transport
  ☆12Updated 5 years ago
• hichamjanati / mtw
  Wasserstein regularization for sparse multi-task regression
  ☆15Updated 4 years ago
• hadarser / SetToGraphPaper
  SetToGraph paper repository
  ☆22Updated 4 years ago
• hongyuanmei / nce-mpp
  Source code for Noise-Contrastive Estimation for Multivariate Point Processes (NeurIPS 2020).
  ☆15Updated 4 years ago
• lzzcd001 / ade-code
  Code for "Exponential Family Estimation via Adversarial Dynamics Embedding" (NeurIPS 2019)
  ☆13Updated 5 years ago
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆35Updated 4 years ago
• francoispierrepaty / SubspaceRobustWasserstein
  Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"
  ☆28Updated 5 years ago