Alternatives and similar repositories for HypergraphHomophily:

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

• arbenson / ScHoLP-Tutorial
  Tutorial for the ScHoLP.jl library and reproducing results from the accompanying paper.
  ☆40Updated 5 years ago
• PhilChodrow / hypergraph
  Software for "Configuration Models of Random Hypergraphs"
  ☆27Updated 2 years ago
• jg-you / dyvider
  Dynamic programming algorithms for exact linear clustering in networks.
  ☆16Updated last year
• AntonioLonga / ETNgen
  ETNgen: A temporal graph generator based on Egocentric Temporal Motifs
  ☆13Updated last year
• lordgrilo / Holes
  A Python module for detecting, analysing and visualising persistent homological features of complex networks
  ☆30Updated 3 years ago
• ftudisco / node-edge-hypergraph-centrality
  ☆15Updated 3 years ago
• rsonthal / TreeRep
  Learning Tree structures and Tree metrics
  ☆23Updated 5 months ago
• mcontisc / Hypergraph-MT
  Probabilistic generative model for mixed-membership community detection in hypergraphs, that also allows to infer missing hyperedges of a…
  ☆24Updated last year
• xyjprc / hon
  Code for generating Higher-order Network (HON) from data with higher-order dependencies
  ☆64Updated last year
• janovergoor / choose2grow
  Research code for "Choosing to grow a graph" project. Contains code for network generation and model estimation.
  ☆26Updated 4 years ago
• PhilChodrow / HypergraphModularity
  Code for generative hypergraph clustering via modularity-like objective functions.
  ☆22Updated 2 years ago
• FraLotito / higher-order-motifs
  Code for the paper "Higher-order motif analysis in hypergraphs"
  ☆26Updated 2 years ago
• arbenson / Hyper-Evec-Centrality
  Code accompanying the paper "Three hypergraph eigenvector centralities."
  ☆10Updated 5 years ago
• samihaija / isvd
  Official implementation of NeurIPS'21: Implicit SVD for Graph Representation Learning
  ☆20Updated 3 years ago
• biomedical-cybernetics / coalescent_embedding
  MATLAB code for performing the coalescent embedding
  ☆14Updated last year
• dicai / pygraphon
  Python library for working with graphons
  ☆22Updated 7 years ago
• 000Justin000 / gnn-residual-correlation
  ☆20Updated 3 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…
  ☆64Updated 10 months ago
• nkeriven / random-graph-gnn
  ☆12Updated 3 years ago
• dalab / matrix-manifolds
  Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper
  ☆35Updated 4 years ago
• arbenson / ScHoLP-Data
  Data for the paper "Simplicial closure and higher-order link prediction"
  ☆19Updated 6 years ago
• lkovanen / TMFinder
  Temporal Motif Finder
  ☆25Updated 8 years ago
• vveitch / causal-network-embeddings
  Software and pre-processed data for "Using Embeddings to Correct for Unobserved Confounding in Networks"
  ☆55Updated last year
• marco-mancastroppa / hypercore-decomposition
  This repository contains the data and the code associated to the paper "Hyper-cores promote localization and efficient seeding in higher-…
  ☆11Updated last year
• bkamins / ABCDGraphGenerator.jl
  Artificial Benchmark for Community Detection (ABCD) - A Fast Random Graph Model with Community Structure
  ☆22Updated this week
• shchur / triangular-tpp
  Implementation of "Fast and Flexible Temporal Point Processes with Triangular Maps" (Oral @ NeurIPS 2020)
  ☆23Updated last year
• leotrs / sunbeam
  SuNBEaM, (s)pectral (n)on-(b)acktracking (e)igenvalue pseudo-(m)etric, a topological graph distance
  ☆15Updated 4 years ago
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆31Updated 3 years ago
• alan-turing-institute / SigNet
  A package for clustering of Signed Networks
  ☆34Updated 3 years ago
• GiulioRossetti / RDyn
  RDyn: graph benchmark handling community dynamics
  ☆23Updated 8 months ago