Alternatives and similar repositories for online-centrality

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

• sbonner0 / temporal-neighbourhood-aggregation
  Code for the Big Data 2019 Paper - Temporal Neighbourhood Aggregation: Predicting Future Links in Temporal Graphs via Recurrent Variation…
  ☆8Updated 4 years ago
• ferencberes / online-node2vec
  Node Embeddings in Dynamic Graphs
  ☆56Updated 3 years ago
• arbenson / ScHoLP-Tutorial
  Tutorial for the ScHoLP.jl library and reproducing results from the accompanying paper.
  ☆43Updated 6 years ago
• GiulioRossetti / RDyn
  RDyn: graph benchmark handling community dynamics
  ☆23Updated last year
• jg-you / dyvider
  Dynamic programming algorithms for exact linear clustering in networks.
  ☆16Updated last year
• lkovanen / TMFinder
  Temporal Motif Finder
  ☆25Updated 8 years ago
• GiulioRossetti / Eva
  Eva: Community Discovery for Labeled Graphs (networkx implementation)
  ☆14Updated 3 years ago
• mdeff / learning-from-graphs-webconf2021
  Learning from Graphs: From Mathematical Principles to Practical Tools
  ☆11Updated 4 years ago
• mengchillee / AutoAudit
  Code for paper "AutoAudit: Mining Accounting and Time-Evolving Graphs" (Big Data 2020)
  ☆16Updated last year
• zeno129 / DYMOND
  DYnamic MOtif-NoDes (DYMOND) is a dynamic network generative model based on temporal motifs and node behavior.
  ☆14Updated 2 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 last year
• overtime3 / overtime
  A Temporal Networks Library written in Python
  ☆13Updated 3 years ago
• palash1992 / GEM-Benchmark
  Benchmark for Graph Embedding Methods
  ☆47Updated 4 years ago
• benedekrozemberczki / spatiotemporal_datasets
  Spatiotemporal datasets collected for network science, deep learning and general machine learning research.
  ☆60Updated last year
• nveldt / HypergraphHomophily
  ☆12Updated 2 years ago
• nd7141 / graph_datasets
  Data for "Understanding Isomorphism Bias in Graph Data Sets" paper.
  ☆89Updated 5 years ago
• shenyangHuang / LAD
  Laplacian Change Point Detection for Dynamic Graphs (KDD 2020)
  ☆27Updated last year
• arangoml / fastgraphml
  Given an input graph (ArangoDB or PyG) it generates graph embeddings using Low-Code framework built on top of PyG.
  ☆68Updated 11 months ago
• networkgeometry / mercator
  Inference of high-quality embeddings of complex networks into the hyperbolic disk.
  ☆49Updated 7 months ago
• galanisl / NetHypGeom
  Tools for the generation, analysis and visualisation of complex networks in hyperbolic space.
  ☆27Updated 6 years ago
• michaelschaub / PartitionStability
  ☆25Updated 6 years ago
• fpour / TGB_Baselines
  TGB baselines for dynamic link property prediction
  ☆21Updated 4 months ago
• benedekrozemberczki / FEATHER
  The reference implementation of FEATHER from the CIKM '20 paper "Characteristic Functions on Graphs: Birds of a Feather, from Statistical…
  ☆51Updated 2 years ago
• shchur / triangular-tpp
  Implementation of "Fast and Flexible Temporal Point Processes with Triangular Maps" (Oral @ NeurIPS 2020)
  ☆23Updated last year
• BorgwardtLab / P-WL
  A Persistent Weisfeiler–Lehman Procedure for Graph Classification
  ☆61Updated 3 years ago
• jinhongjung / tutorial-on-link-analysis
  Hands-on tutorial about link analysis techniques
  ☆37Updated 4 years ago
• benedekrozemberczki / RolX
  An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)
  ☆70Updated 2 years ago
• jamesross2 / random_graph
  Fast generator for random graphs with prescribed degree sequence
  ☆18Updated last year
• xgi-org / xgi-data
  Standardized higher-order datasets with corresponding datasheets
  ☆14Updated 5 months ago