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 2 years ago
- Data for the paper "Simplicial closure and higher-order link prediction"☆21Updated 6 years ago
- Code, datasets & supplementary for "Structural Patterns and Generative Models of Real-world Hypergraphs"☆31Updated 7 months ago
- Software for "Configuration Models of Random Hypergraphs"☆28Updated 2 years ago
- ☆13Updated 4 years ago
- Node Embeddings in Dynamic Graphs☆56Updated 3 years 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
- RDyn: graph benchmark handling community dynamics☆23Updated last year
- GND and GNDR network dismantling algorithm☆21Updated last year
- Code for generating Higher-order Network (HON) from data with higher-order dependencies☆67Updated last year
- Graph Neural Networks for Community Detection☆63Updated 5 years ago
- A package for clustering of Signed Networks☆35Updated 4 years ago
- Code associated to the paper 'Simplicial models of social contagion' Nat. Commun. (2019)☆46Updated 3 years ago
- Experimental Matlab code for methods and some examples in "Higher-order organization of complex networks"☆41Updated 6 years ago
- This repository contains the data and the code associated to the paper "Hyper-cores promote localization and efficient seeding in higher-…☆12Updated last year
- Multilayer network tensor factorization, for community detection, link prediction and measure layer interdependence.☆43Updated 4 years ago
- The code repository for Discovering Conflicting Groups in Signed Networks (NeurIPS 2020)☆15Updated 3 years ago
- tNodeEmbed☆79Updated 2 years ago
- DrBC: A novel graph neural network approach to identify high Betweenness Centraliy (BC) nodes ( CIKM'19 )☆32Updated 4 years ago
- code for the paper in NeurIPS 2019☆40Updated 2 years ago
- Wasserstein Weisfeiler-Lehman Graph Kernels☆81Updated 9 months ago
- Inference of high-quality embeddings of complex networks into the hyperbolic disk.☆49Updated 7 months ago
- Source code from the CIKM 2019 article "Gravity-Inspired Graph Autoencoders for Directed Link Prediction" by G. Salha, S. Limnios, R. Hen…☆45Updated last year
- Probabilistic generative model for mixed-membership community detection in hypergraphs, that also allows to infer missing hyperedges of a…☆26Updated last year
- This code implements the decycling and dismantling procedures devoloped in Braunstein, Alfredo, Luca Dall'Asta, Guilhem Semerjian, and L…☆17Updated 8 years ago
- This repository shows an implementation of the VGAE based model with PyTorch.☆11Updated 2 years ago
- An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)☆70Updated 2 years ago
- Code for the paper "Higher-order motif analysis in hypergraphs"☆30Updated 3 years ago
- ☆12Updated 2 years ago
- the Implementation of "Structural Deep Embedding for Hyper-Networks"（AAA20I8）☆45Updated 6 years ago