Abstract
AbstractMany empirical networks incorporate higher order relations between elements and therefore are naturally modelled as, possibly directed and/or weighted, hypergraphs, rather than merely as graphs. In order to develop a systematic tool for the statistical analysis of such hypergraph, we propose a general definition of Ricci curvature on directed hypergraphs and explore the consequences of that definition. The definition generalizes Ollivier’s definition for graphs. It involves a carefully designed optimal transport problem between sets of vertices. While the definition looks somewhat complex, in the end we shall be able to express our curvature in a very simple formula, $$\kappa =\mu _0-\mu _2-2\mu _3$$κ=μ0-μ2-2μ3. This formula simply counts the fraction of vertices that have to be moved by distances 0, 2 or 3 in an optimal transport plan. We can then characterize various classes of hypergraphs by their curvature.
Publisher
Springer Science and Business Media LLC
Reference17 articles.
1. Asoodeh, S., Gao, T., Evans, J. Curvature of hypergraphs via multi-marginal optimal transport. In 2018 IEEE Conference on Decision and Control (CDC). (IEEE, 1180–1185, 2018).
2. Banerjee, A. On the spectrum of hypergraphs. Lin. Alg. Appl. (2020). in press.
3. Estrada, E. The Structure of Complex Networks (Oxford Univ Press, Oxford, 2012).
4. C. Joslyn, et al. Hypernetwork science: From multidimensional networks to computational topology. Technical report. arXiv:2003.11782v1 (2020).
5. Gallo, Giorgio, Longo, Giustino, Pallottino, Stefano & Nguyen, Sang. Directed hypergraphs and applications. Discr. Appl. Math. 42(2), 177–201 (1993).
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献