Related papers: Diameter bounds for distance-regular graphs via lo…
Amply regular graphs are graphs with local distance-regularity constraints. In this paper, we prove a weaker version of a conjecture proposed by Qiao, Park, and Koolen on diameter bounds of amply regular graphs and make new progress on…
We prove diameter bounds for graphs having positive Ricci-curvature bound in Bakry-Emery sense. One result using only curvature and maximal vertex degree is sharp in case of hypercubes. The other result depends on an additional dimension…
The coarse Ricci curvature of graphs introduced by Ollivier as well as its modification by Lin-Lu-Yau have been studied from various aspects. In this paper, we propose a new transport distance appropriate for hypergraphs and study a…
An amply regular graph is a regular graph such that any two adjacent vertices have $\alpha$ common neighbors and any two vertices with distance $2$ have $\beta$ common neighbors. We prove a sharp lower bound estimate for the Lin--Lu--Yau…
In this article we derive an explicit diameter bound for graphs satisfying the so-called curvature dimension conditions $CD(K,n)$. This refines a recent result due to Liu, M\"unch and Peyerimhoff when the dimension $n$ is finite.
We prove distance bounds for graphs possessing positive Bakry-\'Emery curvature apart from an exceptional set, where the curvature is allowed to be non-positive. If the set of non-positively curved vertices is finite, then the graph admits…
An equivalent definition of entropic Ricci curvature on discrete spaces was given in terms of the global gradient estimate. With a particular choice of the density function $\rho$, we obtain a localized gradient estimate, which in turns…
We study a modified notion of Ollivier's coarse Ricci curvature on graphs introduced by Lin, Lu, and Yau in [11]. We establish a rigidity theorem for complete graphs that shows a connected finite simple graph is complete if and only if the…
In a previous work, the authors have introduced a Lin-Lu-Yau type Ricci curvature for directed graphs, and obtained a diameter comparison of Bonnet-Myers type. In this paper, we investigate rigidity properties for the equality case, and…
We give a discrete Bonnet Myers type theorem for the effective diameter assuming positive Ollivier curvature. We prove that this diameter bound is attained if and only if the graph is a cocktail party graph, a Johnson graph, a halved cube,…
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 prove upper bounds for Ollivier's Ricci curvature for…
We define a hybrid between Ollvier and Bakry Emery curvature on graphs with dependence on a variable neighborhood. The hexagonal lattice is non-negatively curved under this new curvature notion. Bonnet-Myers diameter bounds and Lichnerowicz…
Curvature is a fundamental geometric characteristic of smooth spaces. In recent years different notions of curvature have been developed for combinatorial discrete objects such as graphs. However, the connections between such discrete…
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…
This thesis is an exposition of Ollivier-Ricci Curvature of metric spaces as introduced by Yann Ollivier, which is based upon the 1-Wasserstein Distance and optimal transport theory. We present some of the major results and proofs that…
Connections between continuous and discrete worlds tend to be elusive. One example is curvature. Even though there exist numerous nonequivalent definitions of graph curvature, none is known to converge in any limit to any traditional…
We develop a definition of Ricci curvature on directed hypergraphs and explore the consequences of that definition. The definition generalizes Ollivier's definition for graphs. It involves a carefully designed optimal transport problem…
In this paper, we establish a simple formula for computing the Lin-Lu-Yau Ricci curvature on graphs. For any edge $xy$ in a simple locally finite graph $G$, the curvature $\kappa(x,y)$ can be expressed as a cost function of an optimal…
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.…
We introduce a notion of curvature on finite, combinatorial graphs. It can be easily computed by solving a linear system of equations. We show that graphs with curvature bounded below by $K>0$ have diameter bounded by $\mbox{diam}(G) \leq…