DeepAI AI Chat
Log In Sign Up

Ollivier-Ricci Curvature for Hypergraphs: A Unified Framework

by   Corinna Coupette, et al.

Bridging geometry and topology, curvature is a powerful and expressive invariant. While the utility of curvature has been theoretically and empirically confirmed in the context of manifolds and graphs, its generalization to the emerging domain of hypergraphs has remained largely unexplored. On graphs, Ollivier-Ricci curvature measures differences between random walks via Wasserstein distances, thus grounding a geometric concept in ideas from probability and optimal transport. We develop ORCHID, a flexible framework generalizing Ollivier-Ricci curvature to hypergraphs, and prove that the resulting curvatures have favorable theoretical properties. Through extensive experiments on synthetic and real-world hypergraphs from different domains, we demonstrate that ORCHID curvatures are both scalable and useful to perform a variety of hypergraph tasks in practice.


page 8

page 33

page 34


Curvature of Hypergraphs via Multi-Marginal Optimal Transport

We introduce a novel definition of curvature for hypergraphs, a natural ...

Curvature Filtrations for Graph Generative Model Evaluation

Graph generative model evaluation necessitates understanding differences...

Ollivier Ricci Curvature of Directed Hypergraphs

We develop a definition of Ricci curvature on directed hypergraphs and e...

Heterogeneous manifolds for curvature-aware graph embedding

Graph embeddings, wherein the nodes of the graph are represented by poin...

A Cosine Rule-Based Discrete Sectional Curvature for Graphs

How does one generalize differential geometric constructs such as curvat...

Curvature-based Comparison of Two Neural Networks

In this paper we show the similarities and differences of two deep neura...

Stability of Entropic Wasserstein Barycenters and application to random geometric graphs

As interest in graph data has grown in recent years, the computation of ...