Add to ORKGWe 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
The distance $d_{G}(i,j)$ between any two vertices $i$ and $j$ in a graph $G$ is the minimum number ...
We study the Ollivier--Ricci curvature of graphs as a function of the chosen idleness. We show that ...
AbstractWe obtain upper bounds of diameter and volume for finite graphs by Ollivier’s Ricci curvatur...
The interaction between the study of geometric and analytic aspects of Riemannian manifolds and that...
We give a discrete Bonnet Myers type theorem for the effective diameter assuming positive Ollivier c...
Curvature is a fundamental geometric characteristic of smooth spaces. In recent years different noti...
Curvature is a fundamental geometric characteristic of smooth spaces. In recent years different noti...
We study the long-scale Ollivier Ricci curvature of graphs as a function of the chosen idleness. Sim...
Bridging geometry and topology, curvature is a powerful and expressiveinvariant. While the utility o...
A measure of the centrality of a vertex of a graph is the portion of shortest paths crossing through...
Abstract Many empirical networks incorporate higher order relations between elements and therefore a...
We introduce the notion of Bonnet-Myers and Lichnerowicz sharpness in the Ollivier Ricci curvature s...
In this paper, we compare Ollivier Ricci curvature and Bakry-\'Emery curvature notions on combinator...
Graph theory and its wide applications in natural sciences and social sciences open a new era of res...
Connections between continuous and discrete worlds tend to be elusive. One example is curvature. Eve...
The distance $d_{G}(i,j)$ between any two vertices $i$ and $j$ in a graph $G$ is the minimum number ...
We study the Ollivier--Ricci curvature of graphs as a function of the chosen idleness. We show that ...
AbstractWe obtain upper bounds of diameter and volume for finite graphs by Ollivier’s Ricci curvatur...
The interaction between the study of geometric and analytic aspects of Riemannian manifolds and that...
We give a discrete Bonnet Myers type theorem for the effective diameter assuming positive Ollivier c...
Curvature is a fundamental geometric characteristic of smooth spaces. In recent years different noti...
Curvature is a fundamental geometric characteristic of smooth spaces. In recent years different noti...
We study the long-scale Ollivier Ricci curvature of graphs as a function of the chosen idleness. Sim...
Bridging geometry and topology, curvature is a powerful and expressiveinvariant. While the utility o...
A measure of the centrality of a vertex of a graph is the portion of shortest paths crossing through...
Abstract Many empirical networks incorporate higher order relations between elements and therefore a...
We introduce the notion of Bonnet-Myers and Lichnerowicz sharpness in the Ollivier Ricci curvature s...
In this paper, we compare Ollivier Ricci curvature and Bakry-\'Emery curvature notions on combinator...
Graph theory and its wide applications in natural sciences and social sciences open a new era of res...
Connections between continuous and discrete worlds tend to be elusive. One example is curvature. Eve...
The distance $d_{G}(i,j)$ between any two vertices $i$ and $j$ in a graph $G$ is the minimum number ...
We study the Ollivier--Ricci curvature of graphs as a function of the chosen idleness. We show that ...
AbstractWe obtain upper bounds of diameter and volume for finite graphs by Ollivier’s Ricci curvatur...