Ricci Curvature on Polyhedral Surfaces via Optimal Transportation
Open Access
Abstract
The problem of correctly defining 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 and Yau and Jost and 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.Keywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Ollivier’s Ricci Curvature, Local Clustering and Curvature-Dimension Inequalities on GraphsDiscrete & Computational Geometry, 2013
- Ollivier–Ricci curvature and the spectrum of the normalized graph Laplace operatorMathematical Research Letters, 2012
- Discrete Laplacians on general polygonal meshesACM Transactions on Graphics, 2011
- Ricci curvature of graphsTohoku Mathematical Journal, 2011
- Ricci curvature and eigenvalue estimate on locally finite graphsMathematical Research Letters, 2010
- Mass transportation and rough curvature bounds for discrete spacesJournal of Functional Analysis, 2009
- Ricci curvature of Markov chains on metric spacesJournal of Functional Analysis, 2009
- A Discrete Laplace–Beltrami Operator for Simplicial SurfacesDiscrete & Computational Geometry, 2007
- Bochner's Method for Cell Complexes and Combinatorial Ricci CurvatureDiscrete & Computational Geometry, 2003
- Combinatorial curvature for planar graphsJournal of Graph Theory, 2001