kd383 / NetworkDOSLinks
Network Density of States (https://arxiv.org/abs/1905.09758) (KDD 2019)
☆25Updated 5 years ago
Alternatives and similar repositories for NetworkDOS
Users that are interested in NetworkDOS are comparing it to the libraries listed below
Sorting:
- Implementation of SBM-meet-GNN☆23Updated 6 years ago
- Equivalence Between Structural Representations and Positional Node Embeddings☆22Updated 5 years ago
- Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)☆104Updated 5 years ago
- Compute graph embeddings via Anonymous Walk Embeddings☆83Updated 7 years ago
- Implicit Graph Neural Networks☆62Updated 3 years ago
- Code for "Are Powerful Graph Neural Nets Necessary? A Dissection on Graph Classification"☆52Updated 5 years ago
- Wasserstein Weisfeiler-Lehman Graph Kernels☆83Updated 10 months ago
- SIGN: Scalable Inception Graph Network☆96Updated 4 years ago
- A Persistent Weisfeiler–Lehman Procedure for Graph Classification☆61Updated 4 years ago
- Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)☆16Updated 5 years ago
- Code for Graphite iterative graph generation☆59Updated 6 years ago
- Learning Steady-States of Iterative Algorithms over Graphs☆40Updated 6 years ago
- Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs☆34Updated 5 years ago
- D-VAE: A Variational Autoencoder for Directed Acyclic Graphs, NeurIPS 2019☆139Updated 4 years ago
- ☆28Updated 3 years ago
- Scalable Graph Neural Networks for Heterogeneous Graphs☆72Updated 4 years ago
- Code for the ICLR 2019 paper "Invariant and Equiovariant Graph Networks"☆24Updated 5 years ago
- ☆31Updated 2 years ago
- Code for the paper: "On the Bottleneck of Graph Neural Networks and Its Practical Implications"☆94Updated 3 years ago
- A Python implementation of a fast approximation of the Weisfeiler-Lehman Graph Kernels.☆24Updated 6 years ago
- ☆35Updated 6 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆36Updated 5 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆44Updated 5 years ago
- LDP for graph classification☆23Updated 5 years ago
- Code for reproducing results in GraphMix paper☆72Updated 2 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 5 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- Code for NeurIPS'19 "Layer-Dependent Importance Sampling for Training Deep and Large Graph Convolutional Networks"☆76Updated 2 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆31Updated 2 years ago
- ☆143Updated 4 years ago