Alternatives and similar repositories for plfit

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

• keflavich / plfit
  Power Law Distribution Fitting in python (and fortran and cython)
  ☆89Updated 5 years ago
• Hoosier-Clusters / clusim
  An extended package for clustering similarity
  ☆66Updated 5 months ago
• nkahmed / PGD
  A Parallel Graphlet Decomposition Library for Large Graphs
  ☆87Updated 6 years ago
• Murali-group / halp
  Hypergraph Algorithms Package
  ☆98Updated last year
• arbenson / Hyper-Evec-Centrality
  Code accompanying the paper "Three hypergraph eigenvector centralities."
  ☆10Updated 6 years ago
• arbenson / higher-order-organization-julia
  Jupyter notebooks for examples in the paper "Higher-order organization of complex networks".
  ☆40Updated 7 years ago
• alexbovet / flow_stability
  Flow stability framework for dynamic community detection in temporal networks
  ☆29Updated this week
• KatolaZ / mammult
  Metrics And Models for MULTilayer networks
  ☆24Updated 9 years ago
• adbroido / SFAnalysis
  ☆46Updated 5 years ago
• KatolaZ / NetBunch
  Software for complex network analysis -- see www.complex-networks.net
  ☆37Updated 7 years ago
• cdebacco / MultiTensor
  Multilayer network tensor factorization, for community detection, link prediction and measure layer interdependence.
  ☆43Updated 4 years ago
• jg-you / sbm_canonical_mcmc
  C++ implementation of a MCMC sampler for the (canonical) SBM
  ☆11Updated 5 years ago
• afternone / CommunityDetection.jl
  Community Detection in Julia
  ☆22Updated 6 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 5 years ago
• maxdan94 / Density-Friendly
  C implementation of algorithms to find the Density-Friendly graph decomposition
  ☆11Updated 5 years ago
• kunegis / konect-toolbox
  Octave/Matlab toolbox for network analysis – part of the KONECT project by Jérôme Kunegis, University of Namur
  ☆26Updated 2 years ago
• danspielman / Laplacians.jl
  Algorithms inspired by graph Laplacians: linear equation solvers, sparsification, clustering, optimization, etc.
  ☆230Updated last month
• dgleich / mlpagerank
  Multilinear PageRank
  ☆15Updated 8 years ago
• aaronmcdaid / Overlapping-NMI
  ☆51Updated 8 years ago
• PhilChodrow / hypergraph
  Software for "Configuration Models of Random Hypergraphs"
  ☆28Updated 3 years ago
• leotrs / sunbeam
  SuNBEaM, (s)pectral (n)on-(b)acktracking (e)igenvalue pseudo-(m)etric, a topological graph distance
  ☆15Updated 5 years ago
• bagrow / linkcomm
  Programs to identify link communities in complex networks
  ☆96Updated 4 years ago
• kfoynt / LocalGraphClustering
  ☆142Updated 4 years ago
• adityat / fastconsensus
  Fast consensus clustering in networks
  ☆22Updated 9 months ago
• erichson / ristretto
  Randomized Dimension Reduction Library
  ☆115Updated 4 years ago
• prathasah / random-modular-network-generator
  Generates random graphs with tunable strength of community structure
  ☆28Updated 5 years ago
• xyjprc / hon
  Code for generating Higher-order Network (HON) from data with higher-order dependencies
  ☆67Updated last year
• skojaku / km_config
  An algorithm for finding multiple core-periphery pairs in networks.
  ☆12Updated 3 years ago
• netsiphd / netrd
  A library for network {reconstruction, distances, dynamics}
  ☆170Updated 2 years ago
• ezod / hypergraph
  Python module for graphs and hypergraphs.
  ☆38Updated 8 years ago