Alternatives and similar repositories for Dynamicalab:

Users that are interested in Dynamicalab 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 11 months ago
• jg-you / plant-pollinator-inference
  Code for "Reconstruction of plant--pollinator networks from observational data"
  ☆20Updated 3 years ago
• junipertcy / Network-Code-Repository
  A centralized repository for network analysis tools.
  ☆11Updated 5 years ago
• jgarciab / NetworkScience
  Summer School on Network Science (UU)
  ☆22Updated 9 months ago
• cclaualc / nullnest
  Constructing a null model and measuring the nestedness of bipartite networks
  ☆12Updated 4 years ago
• KatolaZ / NetBunch
  Software for complex network analysis -- see www.complex-networks.net
  ☆37Updated 7 years ago
• jkbren / networkx-edge-bundling
  hacky way to bundle some edges in networkx and matplotlib
  ☆20Updated 4 years ago
• ryanjgallagher / core_periphery_sbm
  Bayesian network models for inferring core-periphery structure
  ☆36Updated 3 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
• network-cards / network-cards
  Concise, readable summaries of network data
  ☆22Updated last year
• janovergoor / choose2grow
  Research code for "Choosing to grow a graph" project. Contains code for network generation and model estimation.
  ☆26Updated 4 years ago
• polcolomer / RandNetGen
  Random network generator
  ☆17Updated 8 years ago
• ScanLab-ossi / DynamicRandomGraphs
  ☆9Updated 2 years ago
• jg-you / sbm_canonical_mcmc
  C++ implementation of a MCMC sampler for the (canonical) SBM
  ☆11Updated 5 years ago
• KatolaZ / mammult
  Metrics And Models for MULTilayer networks
  ☆24Updated 9 years ago
• jg-you / dyvider
  Dynamic programming algorithms for exact linear clustering in networks.
  ☆16Updated last year
• alexbovet / flow_stability
  Flow stability framework for dynamic community detection in temporal networks
  ☆24Updated last month
• CSHVienna / NetworkInequalities
  Repository of the netin package to generate random scale-free graph generators proposed by members of the Network Inequality CSH group.
  ☆16Updated 2 months ago
• benmaier / tacoma
  Temporal networks in Python. Provides fast tools to analyze temporal contact networks and simulate dynamic processes on them using Gilles…
  ☆105Updated 4 years ago
• jg-you / noisy-networks-measurements
  Noisy network measurement with stan
  ☆56Updated 4 years ago
• jkbren / curvy-networkx-edges
  arched links in networkx drawing
  ☆12Updated 5 years ago
• mcontisc / CRep
  Probabilistic generative model and efficient algorithm to model reciprocity in directed networks.
  ☆16Updated last year
• furkangursoy / signed_backbones
  Extracting the signed backbone of intrinsically dense weighted networks.
  ☆10Updated 4 years ago
• corradomonti / ideological-embeddings
  Code and data for the CIKM2021 paper "Learning Ideological Embeddings From Information Cascades"
  ☆11Updated 3 years ago
• junipertcy / bipartiteSBM
  A Bayesian model+algorithm for community detection in bipartite networks
  ☆57Updated 4 years ago
• mapequation / mapping-hypergraphs
  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
• lordgrilo / ComplexNetworks2021-tda-crash-courses
  ☆18Updated 3 years ago
• narnolddd / FETA3
  FETA: Framework for Evolving Topology Analysis. Java-based graph analysis software.
  ☆11Updated last year
• joelnish / double-edge-swap-mcmc
  Contains methods to uniformly sample graphs with a given degree sequence.
  ☆19Updated 6 years ago