A new transport distance and its associated Ricci curvature of hypergraphs
From MaRDI portal
Publication:2154473
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.
Recommendations
Cites work
- Cheeger inequalities for submodular transformations
- Empirical geodesic graphs and CAT(k) metrics for data analysis
- Long-scale ollivier Ricci curvature of graphs
- Ollivier-Ricci idleness functions of graphs
- OPTIMAL PATHS RELATED TO TRANSPORT PROBLEMS
- Optimal transportation networks. Models and theory
- Ricci curvature of graphs
- Ricci curvature of Markov chains on metric spaces
Cited in
(6)- Ricci curvature on polyhedral surfaces via optimal transportation
- Cheng's maximal diameter theorem for hypergraphs
- Transport distance between Grover walks on graphs and coarse Ricci curvature
- Weak Kantorovich difference and associated Ricci curvature of hypergraphs
- Hypergraph co-optimal transport: metric and categorical properties
- Optimal control problem of evolution equation governed by hypergraph Laplacian
This page was built for publication: A new transport distance and its associated Ricci curvature of hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2154473)