Help Privacy Policy Disclaimer
  Advanced SearchBrowse




Conference Paper

Ollivier-Ricci Curvature for Hypergraphs: A Unified Framework


Coupette,  Corinna       
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

(Preprint), 4MB

Supplementary Material (public)
There is no public supplementary material available

Coupette, C., Dalleiger, S., & Rieck, B. (in press). Ollivier-Ricci Curvature for Hypergraphs: A Unified Framework. In Eleventh International Conference on Learning Representations. OpenReview.net.

Cite as: https://hdl.handle.net/21.11116/0000-000C-10CD-B
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.