CompleX Group Interactions (XGI) is a Python package for higher-order networks.
-
Updated
May 23, 2024 - Python
CompleX Group Interactions (XGI) is a Python package for higher-order networks.
Python package for hypergraph analysis and visualization.
KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisection based partitioning algorithms that compute solutions of very high quality.
Library for epidemics on hypergraphs
hypergraph representation learning, graph neural network
A public repository for https://orbitmines.com. The hub for OrbitMines' (research) projects.
Hypergraph is data structure library to create a directed hypergraph in which a hyperedge can join any number of vertices.
Language, Knowledge, Cognition
Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with parallel implementations of techniques used in the best sequential partitioning algorithms. Mt-KaHyPar can partition extremely large hypergraphs very fast and with high quality.
A Universal Language: One Ray to rule them all, One Ray to find them, One Ray to bring them all, and in the darkness bind them.
This repository is associated with the paper: “A Poset-Based Approach to Curvature of Hypergraphs”
HGX is a multi-purpose, open-source Python library for higher-order network analysis
Python binding for Reticula: the general purpose library for analysing static, temporal and hypergraph networks.
Repository of the paper "Beyond directed hypergraphs: heterogeneous hypergraphs and spectral centralities"
Repository of the paper "Beyond directed hypergraphs: heterogeneous hypergraphs and spectral centralities"
Null Models for Directed Hypergraphs
Code for "HyperBERT: Mixing Hypergraph-Aware Layers with Language Models for Node Classification on Text-Attributed Hypergraphs"
Code for the paper: Densest Subhypergraph: Negative Supermodular Functions and Strongly Localized Methods
Attributed Stream Hypergraph
C++ based library implementing hybrid discontinuous Galerkin methods on extremely general domains: that is, all standard (volume) domains, graphs, networks of surfaces, and several other types of "domains" that can be interpreted as hypergraphs.
Add a description, image, and links to the hypergraphs topic page so that developers can more easily learn about it.
To associate your repository with the hypergraphs topic, visit your repo's landing page and select "manage topics."