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
• jinhongjung / tutorial-on-link-analysis
  Hands-on tutorial about link analysis techniques
  ☆39Updated 4 years ago
• palash1992 / GEM-Benchmark
  Benchmark for Graph Embedding Methods
  ☆47Updated 4 years ago
• xyjprc / hon
  Code for generating Higher-order Network (HON) from data with higher-order dependencies
  ☆69Updated 2 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
• IngoScholtes / pathpy
  pathpy is an OpenSource python package for the modeling and analysis of pathways and temporal networks using higher-order and multi-order…
  ☆145Updated 5 years ago
• GiulioRossetti / dynetx
  Dynamic Network Analysis library
  ☆112Updated last year
• benedekrozemberczki / spatiotemporal_datasets
  Spatiotemporal datasets collected for network science, deep learning and general machine learning research.
  ☆60Updated last year
• realrate / Causing
  Causing: CAUsal INterpretation using Graphs
  ☆58Updated 3 weeks ago
• lkovanen / TMFinder
  Temporal Motif Finder
  ☆25Updated 8 years ago
• tigergraph / pyTigerGraph
  Python package for utilizing TigerGraph Databases
  ☆33Updated 2 months ago
• timlrx / graph-benchmarks
  ☆83Updated 2 years ago
• mdeff / learning-from-graphs-webconf2021
  Learning from Graphs: From Mathematical Principles to Practical Tools
  ☆11Updated 4 years ago
• zeno129 / DYMOND
  DYnamic MOtif-NoDes (DYMOND) is a dynamic network generative model based on temporal motifs and node behavior.
  ☆15Updated 2 years ago
• jg-you / dyvider
  Dynamic programming algorithms for exact linear clustering in networks.
  ☆16Updated 2 years ago
• mberr / torch-ppr
  (Personalized) Page-Rank computation using PyTorch
  ☆92Updated 2 years ago
• GiulioRossetti / Eva
  Eva: Community Discovery for Labeled Graphs (networkx implementation)
  ☆14Updated 4 years ago
• michaelschaub / PartitionStability
  ☆25Updated 7 years ago
• xgfs / verse
  Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures
  ☆133Updated 4 years ago
• BrianAronson / birankr
  CRAN package for estimating various rank (centrality) measures of nodes in bipartite graphs (two-mode networks).
  ☆40Updated 3 years ago
• mgraffg / EvoDAG
  Evolving Directed Acyclic Graph
  ☆29Updated 2 years ago
• GTmac / FastRP
  Code for the CIKM 2019 Paper "Fast and Accurate Network Embeddings via Very Sparse Random Projection"
  ☆58Updated 5 years ago
• pathpy / pathpy
  An OpenSource python package for the analysis of time series data on networks using higher-order and multi-order graphical models.
  ☆85Updated 2 years ago
• benedekrozemberczki / RolX
  An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)
  ☆69Updated 2 years ago
• crisbodnar / dgm
  Deep Graph Mapper: Seeing Graphs through the Neural Lens
  ☆58Updated 2 years ago
• ryanrossi / dynamic-pagerank
  Dynamic PageRank
  ☆16Updated 10 years ago
• leotrs / sunbeam
  SuNBEaM, (s)pectral (n)on-(b)acktracking (e)igenvalue pseudo-(m)etric, a topological graph distance
  ☆16Updated 5 years ago
• polsys / ennemi
  Easy Nearest Neighbor Estimation of Mutual Information
  ☆37Updated 11 months 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