janovergoor / choose2growLinks
Research code for "Choosing to grow a graph" project. Contains code for network generation and model estimation.
☆26Updated 5 years ago
Alternatives and similar repositories for choose2grow
Users that are interested in choose2grow are comparing it to the libraries listed below
Sorting:
- 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
- A Bayesian model+algorithm for community detection in bipartite networks☆58Updated 5 years ago
- Contains methods to uniformly sample graphs with a given degree sequence.☆19Updated 6 years ago
- Software for "Configuration Models of Random Hypergraphs"☆28Updated 3 years ago
- A centralized repository for network analysis tools.☆11Updated 5 years ago
- This page is a companion for our paper on overfitting and underfitting of community detection methods on real networks, written by Amir G…☆27Updated last year
- ☆16Updated 2 years ago
- Bayesian network models for inferring core-periphery structure☆36Updated 3 years ago
- Code for generating Higher-order Network (HON) from data with higher-order dependencies☆69Updated 2 years ago
- Metrics And Models for MULTilayer networks☆24Updated 9 years ago
- Data and source code for the paper "How choosing random-walk model and network representation matters for flow-based community detection …☆11Updated 4 years ago
- Bipartite Configuration Model for Python☆16Updated 4 years ago
- A python3 module for maximum entropy models on networks.☆44Updated last year
- Temporal networks in Python. Provides fast tools to analyze temporal contact networks and simulate dynamic processes on them using Gilles…☆105Updated 5 years ago
- A Python Package for Stochastic Block Model Inference☆38Updated 5 years ago
- Noisy network measurement with stan☆56Updated 4 years ago
- Software and pre-processed data for "Using Embeddings to Correct for Unobserved Confounding in Networks"☆57Updated 2 years ago
- CRAN package for estimating various rank (centrality) measures of nodes in bipartite graphs (two-mode networks).☆40Updated 3 years ago
- Recover temporal information from grown trees, using Python☆11Updated 4 years ago
- Tutorial for the ScHoLP.jl library and reproducing results from the accompanying paper.☆43Updated 6 years ago
- Echo Chamber Model☆35Updated 3 years ago
- Multilayer network tensor factorization, for community detection, link prediction and measure layer interdependence.☆44Updated 4 years ago
- Node Embeddings in Dynamic Graphs☆57Updated 3 years ago
- DynetLSM: latent space models for dynamic networks☆23Updated 2 years ago
- An efficient implementation of a set which can be randomly sampled according to the weights of the elements.☆24Updated last year
- Network Diffusion Library - (for NetworkX and iGraph)☆292Updated last week
- evently: simulation, fitting of Hawkes processes☆16Updated 2 years ago
- pathpy is an OpenSource python package for the modeling and analysis of pathways and temporal networks using higher-order and multi-order…☆145Updated 5 years ago
- Code accompanying the paper "Three hypergraph eigenvector centralities."☆10Updated 6 years ago
- Temporal network visualization☆15Updated 4 years ago