Exact and Asymptotic Results on Coarse Ricci Curvature of Graphs

Loading...
Thumbnail Image
Penn collection
Statistics Papers
Degree type
Discipline
Subject
graph curvature
optimal transportation
random graphs
Wasserstein's distance
Applied Mathematics
Business
Discrete Mathematics and Combinatorics
Statistics and Probability
Funder
Grant number
License
Copyright date
Distributor
Related resources
Author
Bhattacharya, Bhaswar B
Mukherjee, Sumit
Contributor
Abstract

Ricci curvature was proposed by Ollivier in a general framework of metric measure spaces, and it has been studied extensively in the context of graphs in recent years. In this paper we obtain the exact formulas for Ollivier’s Ricci-curvature for bipartite graphs and for the graphs with girth at least 5. These are the first formulas for Ricci-curvature that hold for a wide class of graphs, and extend earlier results where the Ricci-curvature for graphs with girth 6 was obtained. We also prove a general lower bound on the Ricci-curvature in terms of the size of the maximum matching in an appropriate subgraph. As a consequence, we characterize the Ricci-flat graphs of girth 5. Moreover, using our general lower bound and the Birkhoff–von Neumann theorem, we give the first necessary and sufficient condition for the structure of Ricci-flat regular graphs of girth 4. Finally, we obtain the asymptotic Ricci-curvature of random bipartite graphs G (n, n, p) and random graphs G (n, p), in various regimes of p.

Advisor
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Publication date
2015-01-06
Volume number
Issue number
Publisher
Publisher DOI
Journal Issue
Comments
Recommended citation
Collection