prathasah / random-modular-network-generatorLinks
Generates random graphs with tunable strength of community structure
☆28Updated 5 years ago
Alternatives and similar repositories for random-modular-network-generator
Users that are interested in random-modular-network-generator are comparing it to the libraries listed below
Sorting:
- Benchmark for Graph Embedding Methods☆48Updated 4 years ago
- NetLSD descriptors for graphs. Compare and analyze graph structure on multiple levels!☆60Updated 5 years ago
- Dynamic Network Analysis library☆112Updated last year
- RDyn: graph benchmark handling community dynamics☆23Updated last year
- Local Community Detection in Multiple Netwrks☆14Updated 4 months ago
- Local community detection code that implements the methods used in Think Locally, Act Locally: The Detection of Small, Medium-Sized, and …☆13Updated 7 years ago
- Dynamic programming algorithms for exact linear clustering in networks.☆16Updated last year
- A Python Package for Stochastic Block Model Inference☆38Updated 5 years ago
- Software for "Configuration Models of Random Hypergraphs"☆28Updated 3 years ago
- Fast generator for random graphs with prescribed degree sequence☆18Updated last year
- OhmNet: Representation learning in multi-layer graphs☆83Updated 4 years ago
- Algorithms for learning network structure from effective resistances and other random-walk-based similarities.☆31Updated 7 years ago
- Code for generative hypergraph clustering via modularity-like objective functions.☆24Updated 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
- Data for the paper "Simplicial closure and higher-order link prediction"☆21Updated 6 years ago
- pure python code for rank aggregation/voting☆32Updated 3 years ago
- Graph kernels☆56Updated 3 years ago
- An implementation of "EdMot: An Edge Enhancement Approach for Motif-aware Community Detection" (KDD 2019)☆133Updated 2 years ago
- A Python module for detecting, analysing and visualising persistent homological features of complex networks☆30Updated 4 years ago
- Hypergraph Algorithms Package☆98Updated last year
- A Persistent Weisfeiler–Lehman Procedure for Graph Classification☆61Updated 4 years ago
- Node Embeddings in Dynamic Graphs☆56Updated 3 years ago
- Temporal Motif Finder☆25Updated 8 years ago
- A collection of Python scripts that implement various graph clustering algorithms, specifically for identifying protein complexes from pr…☆94Updated 6 years ago
- LEMON: A local algorithm for fast, high-precision overlapping community detection☆54Updated 7 years ago
- Probabilistic generative model for mixed-membership community detection in hypergraphs, that also allows to infer missing hyperedges of a…☆27Updated last year
- Tutorial for the ScHoLP.jl library and reproducing results from the accompanying paper.☆43Updated 6 years ago
- A package for computing Graph Kernels☆104Updated last year
- Geo2DR: A Python and PyTorch library for learning distributed representations of graphs.☆46Updated last year
- Comparative metrics for dynamic networks in Python☆69Updated 2 years ago