dicai / pygraphonLinks
Python library for working with graphons
☆22Updated 7 years ago
Alternatives and similar repositories for pygraphon
Users that are interested in pygraphon are comparing it to the libraries listed below
Sorting:
- Learning Tree structures and Tree metrics☆23Updated 11 months ago
- A Python Library for Deep Probabilistic Modeling☆61Updated 8 months ago
- Tutorial for the ScHoLP.jl library and reproducing results from the accompanying paper.☆43Updated 6 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆36Updated 5 years ago
- Simplicial neural networks (SNNs), a generalization of graph neural networks to data that live on a class of topological spaces called si…☆80Updated 4 years ago
- Re-Examining Linear Embeddings for High-dimensional Bayesian Optimization☆41Updated 3 years ago
- ☆52Updated last year
- Implementation of "Fast and Flexible Temporal Point Processes with Triangular Maps" (Oral @ NeurIPS 2020)☆23Updated last year
- ☆51Updated 11 months ago
- A Python module for detecting, analysing and visualising persistent homological features of complex networks☆30Updated 4 years ago
- A curated collection of papers on probabilistic circuits, computational graphs encoding tractable probability distributions.☆50Updated last year
- First-order knowledge compilation for lifted probabilistic inference☆11Updated 8 years ago
- Uncertainty and causal emergence in complex networks☆115Updated 3 years ago
- Library for Bayesian Quadrature☆32Updated 6 years ago
- Codebase for "Demystifying Black-box Models with Symbolic Metamodels", NeurIPS 2019.☆50Updated 5 years ago
- "Variational inference tools to leverage estimator sensitivity."☆16Updated 2 years ago
- ☆20Updated 4 years ago
- ☆15Updated 6 years ago
- PyTorch implementation for "Probabilistic Circuits for Variational Inference in Discrete Graphical Models", NeurIPS 2020☆17Updated 3 years ago
- Python implementation of smooth optimal transport.☆59Updated 4 years ago
- SuNBEaM, (s)pectral (n)on-(b)acktracking (e)igenvalue pseudo-(m)etric, a topological graph distance☆15Updated 5 years ago
- Counterexample-Guided Learning of Monotonic Networks☆18Updated 3 years ago
- Code for the Structural Agnostic Model (https://arxiv.org/abs/1803.04929)☆52Updated 4 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆26Updated 2 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- A recreation of the Lorentz embeddings paper from ICML 2018 (Nickel 2018)☆20Updated 6 years ago
- Code in support of the paper Continuous Mixtures of Tractable Probabilistic Models☆11Updated 9 months ago
- Synthetic data sets apt for Topological Data Analysis☆37Updated 3 months ago
- A package for clustering of Signed Networks☆37Updated 4 years ago
- Dynamic causal Bayesian optimisation☆39Updated 2 years ago