Alternatives and similar repositories for sassafras:

Users that are interested in sassafras are comparing it to the libraries listed below

• gcant / temporal-recovery-tree-py
  Recover temporal information from grown trees, using Python
  ☆11Updated 4 years ago
• gstonge / SamplableSet
  An efficient implementation of a set which can be randomly sampled according to the weights of the elements.
  ☆23Updated 10 months ago
• network-cards / network-cards
  Concise, readable summaries of network data
  ☆22Updated last year
• ScanLab-ossi / DynamicRandomGraphs
  ☆9Updated 2 years ago
• gstonge / spreading_CR
  Gillespie algorithm for the simulation of spreading processes on complex networks using a composition and rejection scheme.
  ☆11Updated 3 years ago
• jg-you / plant-pollinator-inference
  Code for "Reconstruction of plant--pollinator networks from observational data"
  ☆19Updated 2 years ago
• pholme / tsir
  Fast code for SIR on temporal networks
  ☆25Updated 3 years ago
• junipertcy / Network-Code-Repository
  A centralized repository for network analysis tools.
  ☆11Updated 5 years ago
• iaciac / temporal-group-interactions
  Code associated to the paper "The temporal dynamics of group interactions in higher-order social networks" by Iacopini et al. Nature Comm…
  ☆13Updated 6 months ago
• jg-you / noisy-networks-measurements
  Noisy network measurement with stan
  ☆55Updated 4 years ago
• jgarciab / NetworkScience
  Summer School on Network Science (UU)
  ☆20Updated 7 months ago
• cclaualc / nullnest
  Constructing a null model and measuring the nestedness of bipartite networks
  ☆12Updated 4 years ago
• ftudisco / node-edge-hypergraph-centrality
  ☆15Updated 4 years ago
• janovergoor / choose2grow
  Research code for "Choosing to grow a graph" project. Contains code for network generation and model estimation.
  ☆26Updated 4 years ago
• jg-you / sbm_canonical_mcmc
  C++ implementation of a MCMC sampler for the (canonical) SBM
  ☆11Updated 5 years ago
• mcontisc / CRep
  Probabilistic generative model and efficient algorithm to model reciprocity in directed networks.
  ☆16Updated last year
• latentnetworks / vimure
  Variational Inference for Multiply-Reported social network data https://doi.org/10.1093/jrsssa/qnac004
  ☆12Updated 9 months ago
• alfonsosemeraro / emoatlas
  A Python library for the detection and visualization of emotions in texts
  ☆22Updated last month
• joelnish / double-edge-swap-mcmc
  Contains methods to uniformly sample graphs with a given degree sequence.
  ☆19Updated 5 years ago
• alexbovet / flow_stability
  Flow stability framework for dynamic community detection in temporal networks
  ☆24Updated 2 weeks ago
• lordgrilo / ComplexNetworks2021-tda-crash-courses
  ☆18Updated 3 years ago
• jkbren / curvy-networkx-edges
  arched links in networkx drawing
  ☆12Updated 5 years ago
• ryanjgallagher / core_periphery_sbm
  Bayesian network models for inferring core-periphery structure
  ☆36Updated 3 years ago
• Yquetzal / NetworkScience_CheatSheets
  Sources for the Network Science Cheatsheets
  ☆23Updated last year
• junipertcy / bipartiteSBM
  A Bayesian model+algorithm for community detection in bipartite networks
  ☆57Updated 4 years ago
• nveldt / HyperModularity.jl
  ☆13Updated 2 years ago
• corradomonti / ideological-embeddings
  Code and data for the CIKM2021 paper "Learning Ideological Embeddings From Information Cascades"
  ☆11Updated 3 years ago
• CSHVienna / NetworkInequalities
  Repository of the netin package to generate random scale-free graph generators proposed by members of the Network Inequality CSH group.
  ☆14Updated 2 weeks ago
• CaseyMiddleton / command_stripper
  Remove unwanted LaTeX commands and their associated closing brackets
  ☆11Updated 7 months ago
• furkangursoy / signed_backbones
  Extracting the signed backbone of intrinsically dense weighted networks.
  ☆10Updated 3 years ago