Alternatives and similar repositories for online-centrality:

Users that are interested in online-centrality are comparing it to the libraries listed below

• ryanrossi / dynamic-pagerank
  Dynamic PageRank
  ☆16Updated 9 years ago
• lkovanen / TMFinder
  Temporal Motif Finder
  ☆25Updated 8 years ago
• arbenson / ScHoLP-Tutorial
  Tutorial for the ScHoLP.jl library and reproducing results from the accompanying paper.
  ☆41Updated 5 years ago
• mdeff / learning-from-graphs-webconf2021
  Learning from Graphs: From Mathematical Principles to Practical Tools
  ☆11Updated 3 years ago
• ferencberes / online-node2vec
  Node Embeddings in Dynamic Graphs
  ☆56Updated 3 years ago
• mengchillee / AutoAudit
  Code for paper "AutoAudit: Mining Accounting and Time-Evolving Graphs" (Big Data 2020)
  ☆16Updated last year
• zli37 / bayesianRuleSet
  Using Bayesian inference to mine rule sets
  ☆10Updated 5 years ago
• palash1992 / GEM-Benchmark
  Benchmark for Graph Embedding Methods
  ☆47Updated 4 years ago
• dzambon / cdg
  Change Detection in a sequence of Graphs
  ☆22Updated 2 years ago
• arbenson / cflp
  Code for core-fringe link prediction
  ☆11Updated 5 years ago
• galanisl / NetHypGeom
  Tools for the generation, analysis and visualisation of complex networks in hyperbolic space.
  ☆26Updated 6 years ago
• jg-you / dyvider
  Dynamic programming algorithms for exact linear clustering in networks.
  ☆15Updated last year
• GiulioRossetti / Eva
  Eva: Community Discovery for Labeled Graphs (networkx implementation)
  ☆14Updated 3 years ago
• jamesross2 / random_graph
  Fast generator for random graphs with prescribed degree sequence
  ☆18Updated 10 months ago
• overtime3 / overtime
  A Temporal Networks Library written in Python
  ☆12Updated 3 years ago
• xyjprc / hon
  Code for generating Higher-order Network (HON) from data with higher-order dependencies
  ☆66Updated last year
• brandones / graphpca
  Python implementation of PCA on graph ECTD
  ☆12Updated 9 months ago
• vermaMachineLearning / FGSD
  Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).
  ☆24Updated 5 years ago
• lordgrilo / Holes
  A Python module for detecting, analysing and visualising persistent homological features of complex networks
  ☆30Updated 3 years ago
• arangoml / fastgraphml
  Given an input graph (ArangoDB or PyG) it generates graph embeddings using Low-Code framework built on top of PyG.
  ☆68Updated 9 months ago
• moorecsys / moorecsys.github.io
  Tutorial on Multi-Objective Recommender Systems @ KDD 2021
  ☆19Updated 2 years ago
• polinapolina / temporal-pagerank
  ☆13Updated 8 years ago
• nveldt / HypergraphHomophily
  ☆12Updated 2 years ago
• nd7141 / graph_datasets
  Data for "Understanding Isomorphism Bias in Graph Data Sets" paper.
  ☆89Updated 5 years ago
• paulmorio / geo2dr
  Geo2DR: A Python and PyTorch library for learning distributed representations of graphs.
  ☆45Updated last year
• biomedical-cybernetics / coalescent_embedding
  MATLAB code for performing the coalescent embedding
  ☆14Updated last year
• michaelschaub / PartitionStability
  ☆25Updated 6 years ago
• GiulioRossetti / RDyn
  RDyn: graph benchmark handling community dynamics
  ☆23Updated 10 months ago
• uhlerlab / conditional_independence
  Parametric and non-parametric conditional independence testing.
  ☆10Updated 4 years ago