abraunst / decyclerLinks
This code implements the decycling and dismantling procedures devoloped in Braunstein, Alfredo, Luca Dall'Asta, Guilhem Semerjian, and Lenka Zdeborová. "Network Dismantling." Proceedings of the National Academy of Sciences, October 18, 2016, 201605083. doi:10.1073/pnas.1605083113, arxiv:1603.08883.
☆18Updated 9 years ago
Alternatives and similar repositories for decycler
Users that are interested in decycler are comparing it to the libraries listed below
Sorting:
- Repository of the paper "Machine learning dismantling and early-warning signals of disintegration in complex systems" by M. Grassia, M. D…☆44Updated 4 years ago
- GND and GNDR network dismantling algorithm☆21Updated 2 years ago
- Code associated to the paper 'Simplicial models of social contagion' Nat. Commun. (2019)☆51Updated 4 years ago
- CompleX Group Interactions (XGI) is a Python package for higher-order networks.☆228Updated last month
- Multilayer network tensor factorization, for community detection, link prediction and measure layer interdependence.☆44Updated 4 years ago
- Tutorial for the ScHoLP.jl library and reproducing results from the accompanying paper.☆43Updated 6 years ago
- A package for clustering of Signed Networks☆39Updated 4 years ago
- Software for "Configuration Models of Random Hypergraphs"☆29Updated 3 years ago
- ☆16Updated 4 years ago
- This repository contains the data and the code associated to the paper "Hyper-cores promote localization and efficient seeding in higher-…☆12Updated 2 years ago
- Inference of high-quality embeddings of complex networks into the hyperbolic disk.☆49Updated last year
- Several graph clustering algorithms in one library☆18Updated 7 years ago
- HGX is a multi-purpose, open-source Python library for higher-order network analysis☆285Updated last month
- The c++ implementation of Collective Influence (CI) algorithm in Complex Network with DataCastle Competition Solution☆38Updated last year
- Hypergraph Algorithms Package☆98Updated 2 years ago
- Code for generative hypergraph clustering via modularity-like objective functions.☆25Updated 3 years ago
- Fast code for SIR on temporal networks☆26Updated 4 years ago
- ETNgen: A temporal graph generator based on Egocentric Temporal Motifs☆14Updated 2 years ago
- ☆13Updated 3 years ago
- Extended version of the Lancichinetti-Fortunato-Radicchi Benchmark for Undirected Weighted Overlapping networks to evaluate clustering al…☆87Updated 2 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
- RDyn: graph benchmark handling community dynamics☆23Updated last year
- Community Detection in Julia☆22Updated 11 months ago
- Code for the paper "Higher-order motif analysis in hypergraphs"☆32Updated 3 years ago
- Uncertainty and causal emergence in complex networks☆121Updated 4 years ago
- Motif-based weighted spectral clustering in Python, R and Julia☆28Updated last year
- In recent years, community detection has received increased attention thanks to its wide range of applications in many fields. While at f…☆14Updated 6 years ago
- ☆11Updated 9 years ago
- Code for paper: Overlapping Community Detection via Nonnegative Matrix Factorization☆11Updated 11 years ago
- Discovering Polarized Communities in Signed Networks☆13Updated 6 years ago