Hypergraph Co-Optimal Transport: Metric and Categorical Properties
Abstract
Hypergraphs capture multi-way relationships in data, and they have consequently seen a number of applications in higher-order network analysis, computer vision, geometry processing, and machine learning. In this paper, we develop theoretical foundations for studying the space of hypergraphs using ingredients from optimal transport. By enriching a hypergraph with probability measures on its nodes and hyperedges, as well as relational information capturing local and global structures, we obtain a general and robust framework for studying the collection of all hypergraphs. First, we introduce a hypergraph distance based on the co-optimal transport framework of Redko et al. and study its theoretical properties. Second, we formalize common methods for transforming a hypergraph into a graph as maps between the space of hypergraphs and the space of graphs, and study their functorial properties and Lipschitz bounds. Finally, we demonstrate the versatility of our Hypergraph Co-Optimal Transport (HyperCOT) framework through various examples.
Keywords
Cite
@article{arxiv.2112.03904,
title = {Hypergraph Co-Optimal Transport: Metric and Categorical Properties},
author = {Samir Chowdhury and Tom Needham and Ethan Semrad and Bei Wang and Youjia Zhou},
journal= {arXiv preprint arXiv:2112.03904},
year = {2023}
}
Comments
V3: Added to sections on category theory, with improved exposition and new results. Expanded on experimental section. V2: Added new and improved results on Lipschitz and functorial properties for graphifications. Expanded the hypernetwork simplification application