Alternatives and similar repositories for online-centrality

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

• ferencberes / online-node2vec
  Node Embeddings in Dynamic Graphs
  ☆57Updated 3 years ago
• arbenson / ScHoLP-Tutorial
  Tutorial for the ScHoLP.jl library and reproducing results from the accompanying paper.
  ☆43Updated 6 years ago
• benedekrozemberczki / spatiotemporal_datasets
  Spatiotemporal datasets collected for network science, deep learning and general machine learning research.
  ☆60Updated last year
• palash1992 / GEM-Benchmark
  Benchmark for Graph Embedding Methods
  ☆48Updated 4 years ago
• jinhongjung / tutorial-on-link-analysis
  Hands-on tutorial about link analysis techniques
  ☆37Updated 4 years ago
• xyjprc / hon
  Code for generating Higher-order Network (HON) from data with higher-order dependencies
  ☆69Updated last year
• stellargraph / stellar-practical-ml-on-graphs
  Course titled Practical Machine Learning on Graphs
  ☆44Updated 4 years ago
• lkovanen / TMFinder
  Temporal Motif Finder
  ☆25Updated 8 years ago
• IngoScholtes / pathpy
  pathpy is an OpenSource python package for the modeling and analysis of pathways and temporal networks using higher-order and multi-order…
  ☆146Updated 5 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 last year
• mdeff / learning-from-graphs-webconf2021
  Learning from Graphs: From Mathematical Principles to Practical Tools
  ☆11Updated 4 years ago
• ryanrossi / dynamic-pagerank
  Dynamic PageRank
  ☆16Updated 10 years ago
• IngoScholtes / kdd2018-tutorial
  Companion repository for the KDD'18 hands-on tutorial on Higher-Order Data Analytics for Temporal Network Data
  ☆46Updated 6 years ago
• timlrx / graph-benchmarks
  ☆83Updated 2 years ago
• benedekrozemberczki / RolX
  An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)
  ☆70Updated 2 years ago
• Murali-group / halp
  Hypergraph Algorithms Package
  ☆98Updated 2 years ago
• tigergraph / pyTigerGraph
  Python package for utilizing TigerGraph Databases
  ☆33Updated 3 weeks ago
• leotrs / sunbeam
  SuNBEaM, (s)pectral (n)on-(b)acktracking (e)igenvalue pseudo-(m)etric, a topological graph distance
  ☆15Updated 5 years ago
• jg-you / dyvider
  Dynamic programming algorithms for exact linear clustering in networks.
  ☆16Updated 2 years ago
• realrate / Causing
  Causing: CAUsal INterpretation using Graphs
  ☆58Updated 2 weeks ago
• benedekrozemberczki / EdMot
  An implementation of "EdMot: An Edge Enhancement Approach for Motif-aware Community Detection" (KDD 2019)
  ☆134Updated 2 years ago
• BrianAronson / birankr
  CRAN package for estimating various rank (centrality) measures of nodes in bipartite graphs (two-mode networks).
  ☆40Updated 3 years ago
• adrian-lison / gnn-community-detection
  Graph Neural Networks for Community Detection
  ☆63Updated 5 years ago
• benedekrozemberczki / EgoSplitting
  A NetworkX implementation of "Ego-splitting Framework: from Non-Overlapping to Overlapping Clusters" (KDD 2017).
  ☆84Updated 2 years ago
• benedekrozemberczki / walklets
  A lightweight implementation of Walklets from "Don't Walk Skip! Online Learning of Multi-scale Network Embeddings" (ASONAM 2017).
  ☆105Updated 2 years ago
• nveldt / HypergraphHomophily
  ☆12Updated 2 years ago
• GiulioRossetti / dynetx
  Dynamic Network Analysis library
  ☆112Updated last year
• mberr / torch-ppr
  (Personalized) Page-Rank computation using PyTorch
  ☆92Updated 2 years ago
• michaelschaub / PartitionStability
  ☆25Updated 6 years ago
• GiulioRossetti / RDyn
  RDyn: graph benchmark handling community dynamics
  ☆23Updated last year