Alternatives and similar repositories for graphpca

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

• liuxt / graphlet_counting
  Codes for graphlet counting
  ☆12Updated 7 years ago
• arbenson / ScHoLP-Tutorial
  Tutorial for the ScHoLP.jl library and reproducing results from the accompanying paper.
  ☆43Updated 6 years ago
• ftudisco / node-edge-hypergraph-centrality
  ☆15Updated 4 years ago
• xyjprc / hon
  Code for generating Higher-order Network (HON) from data with higher-order dependencies
  ☆67Updated last year
• Aghasemian / OptimalLinkPrediction
  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
• alexbovet / flow_stability
  Flow stability framework for dynamic community detection in temporal networks
  ☆29Updated last week
• SamirMoustafa / Time-Series-Classification
  The official implementation for the paper R.Castro, S.Moustafa, P.Pilyugina, E.Burnaev "Topologically-based Variational Autoencoder for T…
  ☆17Updated 5 years ago
• networkgeometry / mercator
  Inference of high-quality embeddings of complex networks into the hyperbolic disk.
  ☆48Updated 8 months ago
• lordgrilo / Holes
  A Python module for detecting, analysing and visualising persistent homological features of complex networks
  ☆30Updated 4 years ago
• iaciac / simplagion
  Code associated to the paper 'Simplicial models of social contagion' Nat. Commun. (2019)
  ☆46Updated 3 years ago
• uhlerlab / conditional_independence
  Parametric and non-parametric conditional independence testing.
  ☆10Updated 4 years ago
• leotrs / sunbeam
  SuNBEaM, (s)pectral (n)on-(b)acktracking (e)igenvalue pseudo-(m)etric, a topological graph distance
  ☆15Updated 5 years ago
• mgao97 / Higher-Order-Network
  ☆14Updated 7 months ago
• dicai / pygraphon
  Python library for working with graphons
  ☆22Updated 7 years ago
• ferencberes / online-centrality
  Temporal Walk Based Centrality Metric for Graph Streams
  ☆14Updated 2 years ago
• jg-you / dyvider
  Dynamic programming algorithms for exact linear clustering in networks.
  ☆16Updated 2 years ago
• dzambon / cdg
  Change Detection in a sequence of Graphs
  ☆22Updated 3 years ago
• alan-turing-institute / SigNet
  A package for clustering of Signed Networks
  ☆37Updated 4 years ago
• Murali-group / halp
  Hypergraph Algorithms Package
  ☆98Updated 2 years ago
• simondelarue / dynGNN
  Representation and learning framework for dynamic graphs using Graph Neural Networks.
  ☆12Updated 3 years ago
• nickruggeri / Hy-MMSBM
  Inference and sampling on the Hy-MMSBM probabilistic model for hypergraphs.
  ☆17Updated last year
• AlexDuvalinho / GraphSVX
  Explanation method for Graph Neural Networks (GNNs)
  ☆69Updated 2 months ago
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆35Updated 4 years ago
• 000Justin000 / gnn-residual-correlation
  ☆20Updated 4 years ago
• 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
• FraLotito / higher-order-motifs
  Code for the paper "Higher-order motif analysis in hypergraphs"
  ☆31Updated 3 years ago
• sweichwald / tidybench
  TIme series DiscoverY BENCHmark (tidybench)
  ☆38Updated last year
• lordgrilo / ComplexNetworks2021-tda-crash-courses
  ☆18Updated 3 years ago
• GraphFramEx / graphframex
  GraphFramEx: a systematic evaluation framework for explainability methods on GNNs
  ☆44Updated last year
• GiulioRossetti / RDyn
  RDyn: graph benchmark handling community dynamics
  ☆23Updated last year