Affiliation:
1. Department of Mathematics , Osaka University , Osaka , Japan
Abstract
Abstract
The coarse Ricci curvature of graphs introduced by Ollivier as well as its modification by Lin–Lu– Yau have been studied from various aspects. In this paper, we propose a new transport distance appropriate for hypergraphs and study a generalization of Lin–Lu–Yau type curvature of hypergraphs. As an application, we derive a Bonnet–Myers type estimate for hypergraphs under a lower Ricci curvature bound associated with our transport distance. We remark that our transport distance is new even for graphs and worthy of further study.
Subject
Applied Mathematics,Geometry and Topology,Analysis
Reference13 articles.
1. [1] D. Alvarez-Melis, T. Jaakkola and S. Jegelka, Structured Optimal Transport, In: International Conference on Artificial Intelligence and Statistics. (2018), 1771–1780.
2. [2] S. Asoodeh, T. Gao and J. Evans, Curvature of hypergraphs via multi-marginal optimal transport, In: IEEE Conference on Decision and Control. (2018), 1180–1185.
3. [3] M. Bernot, V. Caselles and J.-M. Morel, Optimal Transportation Networks, Models and Theory, Lecture Notes in Mathematics, vol. 1955 (Springer, New York, 2008).
4. [4] D. P. Bourne, D. Cushing, S. Liu, F. Münch and N. Peyerimhoff, Ollivier-Ricci idleness functions of graphs, SIAM J. Discrete Math. 32(2) (2018), 1408–1424.
5. [5] D. Cushing and S. Kamtue, Long-scale Ollivier Ricci curvature of graphs, Anal. Geom. Metr. Spaces. 7(1) (2019), 22–44.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献