Alternatives and similar repositories for random_graph

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

• jg-you / dyvider
  Dynamic programming algorithms for exact linear clustering in networks.
  ☆16Updated last year
• PhilChodrow / HypergraphModularity
  Code for generative hypergraph clustering via modularity-like objective functions.
  ☆24Updated 3 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
• AntonioLonga / ETNgen
  ETNgen: A temporal graph generator based on Egocentric Temporal Motifs
  ☆13Updated last year
• mcontisc / Hypergraph-MT
  Probabilistic generative model for mixed-membership community detection in hypergraphs, that also allows to infer missing hyperedges of a…
  ☆27Updated last year
• nveldt / HypergraphHomophily
  ☆12Updated 2 years ago
• barahona-research-group / PyGenStability
  PyGenStability: Multiscale community detection with generalized Markov Stability
  ☆40Updated 2 months ago
• arbenson / ScHoLP-Data
  Data for the paper "Simplicial closure and higher-order link prediction"
  ☆21Updated 6 years ago
• prathasah / random-modular-network-generator
  Generates random graphs with tunable strength of community structure
  ☆28Updated 5 years ago
• pathpy / pathpyG
  GPU-accelerated Next-Generation Network Analytics and Graph Learning for Time Series Data on Complex Networks.
  ☆45Updated 2 weeks ago
• ftudisco / node-edge-hypergraph-centrality
  ☆15Updated 4 years ago
• dicai / pygraphon
  Python library for working with graphons
  ☆22Updated 7 years ago
• michaelschaub / generalizedLouvain
  Implements a generalized Louvain algorithm (C++ backend and Matlab interface)
  ☆22Updated 5 years ago
• xyjprc / hon
  Code for generating Higher-order Network (HON) from data with higher-order dependencies
  ☆67Updated last year
• arbenson / Hyper-Evec-Centrality
  Code accompanying the paper "Three hypergraph eigenvector centralities."
  ☆10Updated 6 years ago
• lizliz / teaspoon
  ☆44Updated 2 years ago
• aplbrain / grandiso-networkx
  Performant, pure-Python subgraph isomorphism and monomorphism search (aka "motif search")
  ☆62Updated 10 months ago
• FraLotito / higher-order-motifs
  Code for the paper "Higher-order motif analysis in hypergraphs"
  ☆31Updated 3 years ago
• arbenson / ScHoLP-Tutorial
  Tutorial for the ScHoLP.jl library and reproducing results from the accompanying paper.
  ☆43Updated 6 years ago
• mcontisc / CRep
  Probabilistic generative model and efficient algorithm to model reciprocity in directed networks.
  ☆16Updated last year
• csabath95 / NeuLay
  Accelerating Network Layouts Using Graph Neural Networks
  ☆25Updated 2 years ago
• cdebacco / MultiTensor
  Multilayer network tensor factorization, for community detection, link prediction and measure layer interdependence.
  ☆43Updated 4 years ago
• benedekrozemberczki / spatiotemporal_datasets
  Spatiotemporal datasets collected for network science, deep learning and general machine learning research.
  ☆60Updated last year
• alexbovet / flow_stability
  Flow stability framework for dynamic community detection in temporal networks
  ☆29Updated this week
• lordgrilo / ComplexNetworks2021-tda-crash-courses
  ☆18Updated 3 years ago
• xgi-org / xgi
  CompleX Group Interactions (XGI) is a Python package for higher-order networks.
  ☆217Updated last week
• ftheberge / Ensemble-Clustering-for-Graphs
  Code, notebooks and examples with ECG: Ensemble Clustering for Graphs
  ☆32Updated 3 years ago
• GiulioRossetti / dynetx
  Dynamic Network Analysis library
  ☆112Updated last year
• alan-turing-institute / SigNet
  A package for clustering of Signed Networks
  ☆37Updated 4 years ago
• michaelschaub / PartitionStability
  ☆25Updated 6 years ago