LJeub / LocalCommunities
Local community detection code that implements the methods used in Think Locally, Act Locally: The Detection of Small, Medium-Sized, and Large Communities in Large Networks. (http://arxiv.org/abs/1403.3795)
☆13Updated 6 years ago
Alternatives and similar repositories for LocalCommunities:
Users that are interested in LocalCommunities are comparing it to the libraries listed below
- Algorithms for local community detection in networks☆25Updated 8 years ago
- Algorithms for learning network structure from effective resistances and other random-walk-based similarities.☆31Updated 7 years ago
- Experimental Matlab code for methods and some examples in "Higher-order organization of complex networks"☆40Updated 5 years ago
- Tutorial for the ScHoLP.jl library and reproducing results from the accompanying paper.☆40Updated 5 years ago
- RDyn: graph benchmark handling community dynamics☆23Updated 9 months ago
- ☆16Updated 8 years ago
- "Explainable classification of brain networks via contrast subgraphs" - T. Lanciano, F. Bonchi, A. Gionis☆20Updated 2 years ago
- Dynamic Community Finding☆26Updated 6 years ago
- mixed membership stochastic block model☆13Updated 8 years ago
- Fast consensus clustering in networks☆22Updated 5 months ago
- LEMON: A local algorithm for fast, high-precision overlapping community detection☆54Updated 7 years ago
- Graph kernels☆56Updated 3 years ago
- A novel approach to evaluate community detection algorithms on ground truth☆22Updated 3 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆31Updated 4 years ago
- Graph Recurrent Networks with Attributed Random Walks☆28Updated last year
- MATLAB code for performing the coalescent embedding☆14Updated last year
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆42Updated 5 years ago
- A Persistent Weisfeiler–Lehman Procedure for Graph Classification☆60Updated 3 years ago
- Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).☆24Updated 4 years ago
- ☆8Updated 4 years ago
- Implementation of "Bayesian Robust Attributed Graph Clustering: Joint Learning of Partial Anomalies and Group Structure".☆24Updated 4 years ago
- Node Embeddings in Dynamic Graphs☆56Updated 3 years ago
- The source codes for D2AGE model. Distance-aware DAG Embedding for Proximity Search on Heterogeneous Graphs.☆12Updated 6 years ago
- Matlab code for tree-Wasserstein distance in the paper "Tree-Sliced Variants of Wasserstein Distances", NeurIPS, 2019. (Tam Le, Makoto Y…☆12Updated 4 years ago
- The implementation that infers the temporal latent spaces for a sequence of dynamic graph snapshots☆65Updated 7 years ago
- OhmNet: Representation learning in multi-layer graphs☆82Updated 4 years ago
- ☆51Updated 8 years ago
- CoreScope: Graph Mining Using k-Core Analysis - Patterns, Anomalies and Algorithms (ICDM'16 & KAIS'18)☆15Updated 3 months ago
- Multilayer network tensor factorization, for community detection, link prediction and measure layer interdependence.☆41Updated 4 years ago
- A Python framework for generating multilayer networks with planted mesoscale structure.☆18Updated last year