LJeub / LocalCommunitiesLinks
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 7 years ago
Alternatives and similar repositories for LocalCommunities
Users that are interested in LocalCommunities are comparing it to the libraries listed below
Sorting:
- 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"☆41Updated 6 years ago
- mixed membership stochastic block model☆13Updated 9 years ago
- OhmNet: Representation learning in multi-layer graphs☆83Updated 5 years ago
- Efficient discovery of overlapping communities in massive networks PK Gopalan, DM Blei Proceedings of the National Academy of Sciences 11…☆73Updated 5 years ago
- LEMON: A local algorithm for fast, high-precision overlapping community detection☆55Updated 8 years ago
- Graph kernels☆55Updated 3 years ago
- Algorithms for local community detection in networks☆26Updated 8 years ago
- ☆144Updated 4 years ago
- "Explainable classification of brain networks via contrast subgraphs" - T. Lanciano, F. Bonchi, A. Gionis☆20Updated 3 years ago
- ☆173Updated 6 years ago
- ☆51Updated 9 years ago
- Matlab code for tree-Wasserstein distance in the paper "Tree-Sliced Variants of Wasserstein Distances", NeurIPS, 2019. (Tam Le, Makoto Y…☆11Updated 5 years ago
- Implementation of the Multiscale Laplacian Graph Kernel☆19Updated 5 years ago
- A Persistent Weisfeiler–Lehman Procedure for Graph Classification☆63Updated 4 years ago
- A package for computing Graph Kernels☆104Updated 2 years ago
- The implementation that infers the temporal latent spaces for a sequence of dynamic graph snapshots☆64Updated 8 years ago
- Compute graph embeddings via Anonymous Walk Embeddings☆82Updated 7 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆89Updated 6 years ago
- Gaussian node embeddings. Implementation of "Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Ranking".☆177Updated 2 years ago
- Tutorial for the ScHoLP.jl library and reproducing results from the accompanying paper.☆43Updated 6 years ago
- Multilayer network tensor factorization, for community detection, link prediction and measure layer interdependence.☆44Updated 4 years ago
- C implementation of algorithms to find the Density-Friendly graph decomposition☆11Updated 5 years ago
- A package for computing Graph Kernels☆33Updated 7 years ago
- An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)☆69Updated 3 years ago
- A Python module for detecting, analysing and visualising persistent homological features of complex networks☆31Updated 4 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆73Updated 6 years ago
- Dynamic Community Finding☆26Updated 7 years ago
- Implementation of SBM-meet-GNN☆23Updated 6 years ago
- Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures☆133Updated 4 years ago