arbenson / ScHoLP-TutorialLinks
Tutorial for the ScHoLP.jl library and reproducing results from the accompanying paper.
☆43Updated 6 years ago
Alternatives and similar repositories for ScHoLP-Tutorial
Users that are interested in ScHoLP-Tutorial are comparing it to the libraries listed below
Sorting:
- Code for generative hypergraph clustering via modularity-like objective functions.☆24Updated 3 years ago
- Code, datasets & supplementary for "Structural Patterns and Generative Models of Real-world Hypergraphs"☆32Updated 11 months ago
- This page is a companion for our paper on optimal link prediction, written by Amir Ghasemian, Homa Hosseinmardi, Aram Galstyan, Edoardo M…☆66Updated last year
- Code for generating Higher-order Network (HON) from data with higher-order dependencies☆69Updated 2 years ago
- Data for the paper "Simplicial closure and higher-order link prediction"☆22Updated 6 years ago
- ☆12Updated 3 years ago
- Node Embeddings in Dynamic Graphs☆57Updated 3 years ago
- ☆144Updated 4 years ago
- An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)☆69Updated 2 years ago
- Graph Neural Networks for Community Detection☆64Updated 5 years ago
- A scalable implementation of "Learning Structural Node Embeddings Via Diffusion Wavelets (KDD 2018)".☆187Updated 2 years ago
- tNodeEmbed☆79Updated 2 years ago
- Software for "Configuration Models of Random Hypergraphs"☆29Updated 3 years ago
- ☆13Updated 4 years ago
- Wasserstein Weisfeiler-Lehman Graph Kernels☆85Updated last year
- Inference of high-quality embeddings of complex networks into the hyperbolic disk.☆49Updated 11 months ago
- SIGN: Scalable Inception Graph Network☆95Updated 4 years ago
- Compute graph embeddings via Anonymous Walk Embeddings☆83Updated 7 years ago
- Uncertainty and causal emergence in complex networks☆119Updated 4 years ago
- ☆20Updated 4 years ago
- Code for the paper "Higher-order motif analysis in hypergraphs"☆32Updated 3 years ago
- New Algorithms for Learning on Hypergraphs☆41Updated 3 years ago
- Source code for EvalNE, a Python library for evaluating Network Embedding methods.☆106Updated last year
- A Persistent Weisfeiler–Lehman Procedure for Graph Classification☆63Updated 4 years ago
- Research code for "Choosing to grow a graph" project. Contains code for network generation and model estimation.☆26Updated 5 years ago
- CompleX Group Interactions (XGI) is a Python package for higher-order networks.☆225Updated last week
- Probabilistic generative model for mixed-membership community detection in hypergraphs, that also allows to infer missing hyperedges of a…☆29Updated 2 years ago
- The reference implementation of "Multi-scale Attributed Node Embedding". (Journal of Complex Networks 2021)☆177Updated 3 years ago
- The implementation that infers the temporal latent spaces for a sequence of dynamic graph snapshots☆64Updated 8 years ago
- Source code for our AAAI paper "Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks".☆189Updated 3 years ago