Ricci curvature on polyhedral surfaces via optimal transportation
arXiv:1402.0644 · doi:10.3390/axioms3010119
Abstract
The problem of defining correctly geometric objects such as the curvature is a hard one in discrete geometry. In 2009, Ollivier defined a notion of curvature applicable to a wide category of measured metric spaces, in particular to graphs. He named it coarse Ricci curvature because it coincides, up to some given factor, with the classical Ricci curvature, when the space is a smooth manifold. Lin, Lu & Yau, Jost & Liu have used and extended this notion for graphs giving estimates for the curvature and hence the diameter, in terms of the combinatorics. In this paper, we describe a method for computing the coarse Ricci curvature and give sharper results, in the specific but crucial case of polyhedral surfaces.
References in corpus (1)
Cited by in corpus (18)
- Forman curvature for complex networks
- Comparative analysis of two discretizations of Ricci curvature for complex networks
- Combinatorial Quantum Gravity: Geometry from Random Bits
- Discrete Ricci curvatures for directed networks
- Introducing Quantum Ricci Curvature
- The Graph Curvature Calculator and the curvatures of cubic graphs
- Self-Assembly of Geometric Space from Random Graphs
- Random Holographic "Large Worlds" with Emergent Dimensions
- Convergence of Combinatorial Gravity
- Gradient estimates, Bakry-Emery Ricci curvature and ellipticity for unbounded graph Laplacians
- Intrinsic and extrinsic geometries of correlated many-body states
- Characterizations of Forman curvature
- Combinatorial Quantum Gravity: Emergence of Geometric Space from Random Graphs
- Ricci-flat cubic graphs with girth five
- Topological Network Entanglement as Order Parameter for the Emergence of Geometry
- Exact Expressions and Reduced Linear Programmes for the Ollivier Curvature in Graphs
- Every Salami has two ends
- Exploring the space of graphs with fixed discrete curvatures