prathasah / random-modular-network-generator
Generates random graphs with tunable strength of community structure
☆28Updated 5 years ago
Related projects ⓘ
Alternatives and complementary repositories for random-modular-network-generator
- RDyn: graph benchmark handling community dynamics☆22Updated 6 months ago
- Temporal Motif Finder☆25Updated 7 years ago
- Hypergraph Algorithms Package☆96Updated last year
- Dynamic Network Analysis library☆107Updated 4 months ago
- Tutorial for the ScHoLP.jl library and reproducing results from the accompanying paper.☆40Updated 5 years ago
- Performant, pure-Python subgraph isomorphism and monomorphism search (aka "motif search")☆55Updated 2 months ago
- Software for "Configuration Models of Random Hypergraphs"☆27Updated 2 years ago
- Python wrapper for the Kavosh network motif finder☆50Updated 9 years ago
- Dynamic programming algorithms for exact linear clustering in networks.☆16Updated last year
- This page is a companion for our paper on optimal link prediction, written by Amir Ghasemian, Homa Hosseinmardi, Aram Galstyan, Edoardo M…☆62Updated 7 months ago
- GND and GNDR network dismantling algorithm☆18Updated last year
- Jupyter notebooks for examples in the paper "Higher-order organization of complex networks".☆39Updated 7 years ago
- ☆25Updated 6 years ago
- Code for generating Higher-order Network (HON) from data with higher-order dependencies☆64Updated last year
- Local community detection code that implements the methods used in Think Locally, Act Locally: The Detection of Small, Medium-Sized, and …☆13Updated 6 years ago
- Py3plex - A multilayer complex network visualization and analysis library in python3☆160Updated last year
- Probabilistic generative model for mixed-membership community detection in hypergraphs, that also allows to infer missing hyperedges of a…☆23Updated last year
- Code for generative hypergraph clustering via modularity-like objective functions.☆22Updated 2 years ago
- A Python module for detecting, analysing and visualising persistent homological features of complex networks☆28Updated 3 years ago
- MATLAB code for performing the coalescent embedding☆14Updated last year
- This code implements the decycling and dismantling procedures devoloped in Braunstein, Alfredo, Luca Dall'Asta, Guilhem Semerjian, and L…☆16Updated 7 years ago
- A Python Package for Stochastic Block Model Inference☆37Updated 4 years ago
- Fast generator for random graphs with prescribed degree sequence☆18Updated 6 months ago
- ☆51Updated 8 years ago
- Code accompanying the paper "Three hypergraph eigenvector centralities."☆10Updated 5 years ago
- ☆12Updated 2 years ago
- Eva: Community Discovery for Labeled Graphs (networkx implementation)☆14Updated 3 years ago
- ☆48Updated 5 years ago
- Node Embeddings in Dynamic Graphs☆53Updated 2 years ago
- Data for the paper "Simplicial closure and higher-order link prediction"☆19Updated 5 years ago