arbenson / higher-order-organization-julia
Jupyter notebooks for examples in the paper "Higher-order organization of complex networks".
☆39Updated 7 years ago
Alternatives and similar repositories for higher-order-organization-julia:
Users that are interested in higher-order-organization-julia are comparing it to the libraries listed below
- Community Detection in Julia☆22Updated 4 months ago
- Julia package for network research☆37Updated 4 years ago
- A Python module for detecting, analysing and visualising persistent homological features of complex networks☆30Updated 3 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
- Code for generating Higher-order Network (HON) from data with higher-order dependencies☆66Updated last year
- Dynamic benchmark code for Phys. Rev. E 92, 012805☆10Updated 9 years ago
- Experimental Matlab code for methods and some examples in "Higher-order organization of complex networks"☆41Updated 6 years ago
- an implementation of latent Dirichlet allocation (LDA) with stochastic variational inference☆20Updated 8 years ago
- ☆11Updated 8 years ago
- Multilayer network tensor factorization, for community detection, link prediction and measure layer interdependence.☆42Updated 4 years ago
- Graph kernels☆56Updated 3 years ago
- Tutorial for the ScHoLP.jl library and reproducing results from the accompanying paper.☆42Updated 6 years ago
- Bayesian multi-tensor factorization methods, with side information☆29Updated 4 years ago
- Dynamic Community Finding☆26Updated 7 years ago
- Python library for working with graphons☆22Updated 7 years ago
- A Bayesian model+algorithm for community detection in bipartite networks☆57Updated 4 years ago
- Metrics And Models for MULTilayer networks☆24Updated 9 years ago
- Working with time-dependent networks in Julia☆52Updated 6 years ago
- Algorithms inspired by graph Laplacians: linear equation solvers, sparsification, clustering, optimization, etc.☆225Updated 6 months ago
- An algorithm for finding multiple core-periphery pairs in networks.☆12Updated 3 years ago
- Four of the main kernels on graphs Python implementation.☆16Updated 8 years ago
- ☆65Updated 4 years ago
- Temporal Motif Finder☆25Updated 8 years ago
- Efficient discovery of overlapping communities in massive networks PK Gopalan, DM Blei Proceedings of the National Academy of Sciences 11…☆74Updated 4 years ago
- ☆51Updated 8 years ago
- Hypergraph Algorithms Package☆96Updated last year
- LEMON: A local algorithm for fast, high-precision overlapping community detection☆54Updated 7 years ago
- Multilinear PageRank☆15Updated 7 years ago
- CoreScope: Graph Mining Using k-Core Analysis - Patterns, Anomalies and Algorithms (ICDM'16 & KAIS'18)☆16Updated 6 months ago
- A Persistent Weisfeiler–Lehman Procedure for Graph Classification☆61Updated 3 years ago