prathasah / random-modular-network-generator
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
- Software for "Configuration Models of Random Hypergraphs"☆27Updated 2 years ago
- Dynamic programming algorithms for exact linear clustering in networks.☆16Updated last year
- Eva: Community Discovery for Labeled Graphs (networkx implementation)☆14Updated 3 years ago
- Code for generating Higher-order Network (HON) from data with higher-order dependencies☆64Updated last year
- Hypergraph Algorithms Package☆95Updated last year
- Probabilistic generative model for mixed-membership community detection in hypergraphs, that also allows to infer missing hyperedges of a…☆24Updated last year
- Code for generative hypergraph clustering via modularity-like objective functions.☆22Updated 2 years ago
- An extended package for clustering similarity☆64Updated this week
- Node Embeddings in Dynamic Graphs☆54Updated 3 years ago
- An implementation of "EdMot: An Edge Enhancement Approach for Motif-aware Community Detection" (KDD 2019)☆132Updated 2 years ago
- Code accompanying the paper "Three hypergraph eigenvector centralities."☆10Updated 5 years ago
- A Python Package for Stochastic Block Model Inference☆37Updated 5 years ago
- This page is a companion for our paper on optimal link prediction, written by Amir Ghasemian, Homa Hosseinmardi, Aram Galstyan, Edoardo M…☆64Updated 10 months ago
- Fast consensus clustering in networks☆22Updated 4 months ago
- ☆25Updated 6 years ago
- RDyn: graph benchmark handling community dynamics☆23Updated 8 months ago
- Py3plex - A multilayer complex network visualization and analysis library in python3☆161Updated last year
- An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)☆69Updated 2 years ago
- 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
- Performant, pure-Python subgraph isomorphism and monomorphism search (aka "motif search")☆58Updated 5 months ago
- Fast generator for random graphs with prescribed degree sequence☆18Updated 8 months ago
- Library of python functions for the analysis of hypergraphs.☆12Updated 3 years ago
- Benchmark for Graph Embedding Methods☆47Updated 4 years ago
- Data for the paper "Simplicial closure and higher-order link prediction"☆19Updated 6 years ago
- ☆48Updated 5 years ago
- Temporal Motif Finder☆25Updated 8 years ago
- NetLSD descriptors for graphs. Compare and analyze graph structure on multiple levels!☆59Updated 4 years ago
- Geo2DR: A Python and PyTorch library for learning distributed representations of graphs.☆45Updated last year
- Inference of high-quality embeddings of complex networks into the hyperbolic disk.☆48Updated 2 months ago
- ☆80Updated last year