ermongroup / graphiteLinks
Code for Graphite iterative graph generation
☆59Updated 6 years ago
Alternatives and similar repositories for graphite
Users that are interested in graphite are comparing it to the libraries listed below
Sorting:
- Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)☆104Updated 5 years ago
- Learning Discrete Structures for Graph Neural Networks (TensorFlow implementation)☆199Updated last year
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 6 years ago
- Graph Auto-Encoder in PyTorch☆81Updated 2 years ago
- Code for reproducing results in GraphMix paper☆72Updated 2 years ago
- Code for "Are Powerful Graph Neural Nets Necessary? A Dissection on Graph Classification"☆53Updated 5 years ago
- Wasserstein Weisfeiler-Lehman Graph Kernels☆85Updated last year
- Implementation of the paper "NetGAN: Generating Graphs via Random Walks".☆196Updated 4 years ago
- Conditional Structure Generation through Graph Variational Generative Adversarial Nets, NeurIPS 2019.☆54Updated 6 years ago
- Code for Optimal Transport for structured data with application on graphs☆102Updated 2 years ago
- PyTorch Implementation of GraphTSNE, ICLR’19☆137Updated 6 years ago
- learning point processes by means of optimal transport and wasserstein distance☆54Updated 7 years ago
- Source code for PairNorm (ICLR 2020)☆79Updated 5 years ago
- ☆35Updated 6 years ago
- ☆25Updated 5 years ago
- Official Implementation of ICML 2019 Paper. MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixing; an…☆125Updated 6 years ago
- Equivalence Between Structural Representations and Positional Node Embeddings☆22Updated 5 years ago
- Implementation of SBM-meet-GNN☆23Updated 6 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆44Updated 6 years ago
- Compute graph embeddings via Anonymous Walk Embeddings☆83Updated 7 years ago
- D-VAE: A Variational Autoencoder for Directed Acyclic Graphs, NeurIPS 2019☆143Updated 5 years ago
- Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport☆37Updated 4 years ago
- Code and data for the paper `Bayesian Semi-supervised Learning with Graph Gaussian Processes'☆38Updated 7 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆37Updated 5 years ago
- Hyperbolic Graph Neural Networks☆242Updated 6 years ago
- Code for Graph Normalizing Flows.☆63Updated 5 years ago
- ☆16Updated 5 years ago
- ☆37Updated 6 years ago
- This is a TensorFlow implementation of the Adversarially Regularized Graph Autoencoder(ARGA) model as described in our paper: Pan, S., …☆187Updated 3 years ago
- ☆44Updated 8 years ago