prathasah / random-modular-network-generatorLinks
Generates random graphs with tunable strength of community structure
☆28Updated 6 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:
- Software for "Configuration Models of Random Hypergraphs"☆29Updated 3 years ago
- Hypergraph Algorithms Package☆98Updated 2 years ago
- A package for computing Graph Kernels☆104Updated 2 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆88Updated 6 years ago
- Dynamic Network Analysis library☆113Updated last year
- Py3plex - A multilayer complex network visualization and analysis library in python3☆175Updated this week
- Source code for EvalNE, a Python library for evaluating Network Embedding methods.☆107Updated last year
- A Python Package for Stochastic Block Model Inference☆38Updated 6 years ago
- Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.☆164Updated 5 years ago
- NetLSD descriptors for graphs. Compare and analyze graph structure on multiple levels!☆61Updated 5 years ago
- ☆144Updated 4 years ago
- RDyn: graph benchmark handling community dynamics☆23Updated last year
- An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)☆69Updated 3 years ago
- A python package for graph kernels, graph edit distances, and graph pre-image problem.☆128Updated 6 months ago
- Tutorial for the ScHoLP.jl library and reproducing results from the accompanying paper.☆43Updated 6 years ago
- Eva: Community Discovery for Labeled Graphs (networkx implementation)☆14Updated 4 years ago
- Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures☆133Updated 4 years ago
- Automatic feature extraction and node role assignment for transfer learning on graphs (ReFeX & RolX)☆88Updated last year
- An implementation of "EdMot: An Edge Enhancement Approach for Motif-aware Community Detection" (KDD 2019)☆133Updated 3 years ago
- Code for generative hypergraph clustering via modularity-like objective functions.☆25Updated 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
- Python wrapper for the Kavosh network motif finder☆52Updated 11 years ago
- Algorithms for local community detection in networks☆26Updated 9 years ago
- A collection of Python scripts that implement various graph clustering algorithms, specifically for identifying protein complexes from pr…☆94Updated 7 years ago
- Benchmark for Graph Embedding Methods☆48Updated 5 years ago
- Code accompanying the paper "Three hypergraph eigenvector centralities."☆10Updated 6 years ago
- ☆25Updated 7 years ago
- Graph kernels☆55Updated last week
- Fastest random walks generator on networkx graphs☆76Updated last year
- SuNBEaM, (s)pectral (n)on-(b)acktracking (e)igenvalue pseudo-(m)etric, a topological graph distance☆16Updated 5 years ago