Ollivier curvature, betweenness centrality and average distance

Florentin Münch

Published 2022-09-30Version 1

We give a new upper bound for the average graph distance in terms of the average Ollivier curvature. Here, the average Ollivier curvature is weighted with the edge betweenness centrality. Moreover, we prove that equality is attained precisely for the reflective graphs which have been classified as Cartesian products of cocktail party graphs, Johnson graphs, halved cubes, Schl\"afli graphs, and Gosset graphs.