ermongroup / graphite
Code for Graphite iterative graph generation
☆59Updated 5 years ago
Related projects ⓘ
Alternatives and complementary repositories for graphite
- Code for Graph Normalizing Flows.☆59Updated 5 years ago
- Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)☆101Updated 4 years ago
- Conditional Structure Generation through Graph Variational Generative Adversarial Nets, NeurIPS 2019.☆54Updated 5 years ago
- Code for "Are Powerful Graph Neural Nets Necessary? A Dissection on Graph Classification"☆51Updated 4 years ago
- Implementation of SBM-meet-GNN☆22Updated 5 years ago
- Graph Auto-Encoder in PyTorch☆81Updated last year
- ☆35Updated 5 years ago
- Learning Discrete Structures for Graph Neural Networks (TensorFlow implementation)☆192Updated 8 months ago
- ☆25Updated 5 years ago
- Code and data for the paper `Bayesian Semi-supervised Learning with Graph Gaussian Processes'☆38Updated 6 years ago
- Compute graph embeddings via Anonymous Walk Embeddings☆81Updated 6 years ago
- PyTorch Implementation of GraphTSNE, ICLR’19☆133Updated 5 years ago
- Source code for PairNorm (ICLR 2020)☆76Updated 4 years ago
- D-VAE: A Variational Autoencoder for Directed Acyclic Graphs, NeurIPS 2019☆130Updated 4 years ago
- Code for reproducing results in GraphMix paper☆72Updated 2 years ago
- GraphGen: A Scalable Approach to Domain-agnostic Labeled Graph Generation☆50Updated last year
- Wasserstein Weisfeiler-Lehman Graph Kernels☆78Updated 2 months ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆35Updated 4 years ago
- Code for the ICLR 2019 paper "Invariant and Equiovariant Graph Networks"☆23Updated 4 years ago
- ☆30Updated last year
- Graph Filter Neural Network (ICPR'20)☆48Updated 4 years ago
- code for the paper in NeurIPS 2019☆40Updated last year
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆71Updated 5 years ago
- Learning Steady-States of Iterative Algorithms over Graphs☆40Updated 6 years ago
- Implementation of the paper "NetGAN: Generating Graphs via Random Walks".☆191Updated 3 years ago
- AISTATS 2019: Confidence-based Graph Convolutional Networks for Semi-Supervised Learning☆58Updated 5 years ago
- ☆37Updated 5 years ago
- Code for "Weisfeiler and Leman go sparse: Towards higher-order graph embeddings"☆22Updated 2 years ago
- Equivalence Between Structural Representations and Positional Node Embeddings☆21Updated 4 years ago
- Official Implementation of ICML 2019 Paper. MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixing; an…☆123Updated 5 years ago