rkdarst / dynbenchLinks
Dynamic benchmark code for Phys. Rev. E 92, 012805
☆10Updated 10 years ago
Alternatives and similar repositories for dynbench
Users that are interested in dynbench are comparing it to the libraries listed below
Sorting:
- Extended version of the Lancichinetti-Fortunato-Radicchi Benchmark for Undirected Weighted Overlapping networks to evaluate clustering al…☆86Updated last year
- RDyn: graph benchmark handling community dynamics☆23Updated last year
- Experimental Matlab code for methods and some examples in "Higher-order organization of complex networks"☆41Updated 6 years ago
- Multilayer network tensor factorization, for community detection, link prediction and measure layer interdependence.☆44Updated 4 years ago
- GND and GNDR network dismantling algorithm☆21Updated 2 years ago
- LEMON: A local algorithm for fast, high-precision overlapping community detection☆55Updated 8 years ago
- Community Detection in Graphs (master's degree short project)☆39Updated 3 years ago
- A Python framework for generating multilayer networks with planted mesoscale structure.☆18Updated 2 years ago
- ☆51Updated 9 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
- Dynamic community detection based on network structural perturbation and topological similarity☆12Updated 6 years ago
- Some overlapping community detection algorithms (Until 2016). by Yulin Che (https://github.com/CheYulin) for the PhD qualification exam (…☆210Updated 3 years ago
- In recent years, community detection has received increased attention thanks to its wide range of applications in many fields. While at f…☆14Updated 6 years ago
- Graph Neural Networks for Community Detection☆64Updated 5 years ago
- Network dataset extraction library – part of the KONECT project by Jérôme Kunegis, University of Namur☆27Updated 2 years ago
- ☆144Updated 4 years ago
- A novel approach to evaluate community detection algorithms on ground truth☆22Updated 4 years ago
- Data for the paper "Simplicial closure and higher-order link prediction"☆22Updated 6 years ago
- A NetworkX implementation of Label Propagation from a "Near Linear Time Algorithm to Detect Community Structures in Large-Scale Networks"…☆125Updated 2 years ago
- Algorithm for structural reduction of multi-layer networks☆23Updated last year
- Code for generating Higher-order Network (HON) from data with higher-order dependencies☆69Updated 2 years ago
- An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)☆69Updated 2 years ago
- The implementation that infers the temporal latent spaces for a sequence of dynamic graph snapshots☆64Updated 8 years ago
- ☆11Updated 4 years ago
- ☆13Updated 9 years ago
- souece code of e-lstm-d☆21Updated 5 years ago
- Source code for blog post at https://hautahi.com/im_greedycelf☆28Updated 5 years ago
- Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.☆163Updated 4 years ago
- Jupyter notebooks for examples in the paper "Higher-order organization of complex networks".☆40Updated 8 years ago
- Code associated to the paper 'Simplicial models of social contagion' Nat. Commun. (2019)☆51Updated 3 years ago