Alternatives and similar repositories for eventgraphs

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

• ferencberes / online-node2vec
  Node Embeddings in Dynamic Graphs
  ☆57Updated 4 years ago
• benedekrozemberczki / EdMot
  An implementation of "EdMot: An Edge Enhancement Approach for Motif-aware Community Detection" (KDD 2019)
  ☆133Updated 3 years ago
• GiulioRossetti / TILES
  TILES: an algorithm for community discovery in dynamic social networks
  ☆60Updated last year
• xyjprc / hon
  Code for generating Higher-order Network (HON) from data with higher-order dependencies
  ☆70Updated 2 years ago
• benedekrozemberczki / spatiotemporal_datasets
  Spatiotemporal datasets collected for network science, deep learning and general machine learning research.
  ☆62Updated 3 weeks ago
• dzambon / cdg
  Change Detection in a sequence of Graphs
  ☆21Updated 3 years ago
• shenyangHuang / LAD
  Laplacian Change Point Detection for Dynamic Graphs (KDD 2020)
  ☆29Updated 2 years ago
• ameya98 / PySClump
  Python Implementation of 'Spectral Clustering in Heterogeneous Information Networks'.
  ☆20Updated 6 years ago
• GiulioRossetti / dynetx
  Dynamic Network Analysis library
  ☆113Updated last year
• benedekrozemberczki / role2vec
  A scalable Gensim implementation of "Learning Role-based Graph Embeddings" (IJCAI 2018).
  ☆167Updated 3 years ago
• realrate / Causing
  Causing: CAUsal INterpretation using Graphs
  ☆61Updated last week
• lkovanen / TMFinder
  Temporal Motif Finder
  ☆25Updated 9 years ago
• ferencberes / online-centrality
  Temporal Walk Based Centrality Metric for Graph Streams
  ☆15Updated 2 years ago
• theSage21 / lorentz-embeddings
  Embed arbitrary graphs in Hyperbolic space
  ☆78Updated 4 years ago
• PhilChodrow / hypergraph
  Software for "Configuration Models of Random Hypergraphs"
  ☆29Updated 3 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
• benedekrozemberczki / EgoSplitting
  A NetworkX implementation of "Ego-splitting Framework: from Non-Overlapping to Overlapping Clusters" (KDD 2017).
  ☆84Updated 2 years ago
• Dru-Mara / EvalNE
  Source code for EvalNE, a Python library for evaluating Network Embedding methods.
  ☆108Updated last month
• palash1992 / GEM-Benchmark
  Benchmark for Graph Embedding Methods
  ☆48Updated 5 years ago
• surajnakka / graph-data-analysis
  Worked with a number of real-world datasets available at http://snap.stanford.edu/ to identify the importance of certain nodes in terms o…
  ☆11Updated 9 years ago
• GiulioRossetti / RDyn
  RDyn: graph benchmark handling community dynamics
  ☆23Updated last year
• lnferreira / time_series_clustering_via_community_detection
  Code used in the paper "Time Series Clustering via Community Detection in Networks"
  ☆40Updated 6 years ago
• benedekrozemberczki / GraphWaveMachine
  A scalable implementation of "Learning Structural Node Embeddings Via Diffusion Wavelets (KDD 2018)".
  ☆189Updated 2 years ago
• arbenson / ScHoLP-Tutorial
  Tutorial for the ScHoLP.jl library and reproducing results from the accompanying paper.
  ☆43Updated 6 years ago
• xgfs / verse
  Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures
  ☆133Updated 4 years ago
• michaelschaub / PartitionStability
  ☆25Updated 7 years ago
• musically-ut / tf_rmtpp
  Recurrent Marked Temporal Point Processes
  ☆56Updated 4 years ago
• 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
• vsmolyakov / DP_means
  Dirichlet Process K-means
  ☆49Updated last year
• networkgeometry / mercator
  Inference of high-quality embeddings of complex networks into the hyperbolic disk.
  ☆49Updated last year