Related papers: Curvature dimension inequalities on directed graph…
The CD inequalities and CDE inequalities are useful in the estimate of curvature on graphs. This article is based on the ufinite graph with large girth, and finally concludes some curvature estimate in CD and CDE.
We study some equivalent properties of the curvature-dimension conditions $CD(n,K)$ inequality on infinite, but locally finite graph. These equivalences are gradient estimate, Poincar\'e type inequalities and reverse Poincar\'e…
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 study the curvature-dimension inequality in regular graphs. We develop techniques for calculating the curvature of such graphs, and we give characterizations of classes of graphs with positive, zero, and negative curvature. Our main…
We introduce and study the conical curvature-dimension condition, $CCD(K,N)$, for graphs. We show that $CCD(K,N)$ provides necessary and sufficient conditions for the underlying graph to satisfy a sharp global Poincar\'e inequality which in…
In this paper, we classify unweighted graphs satisfying the curvature dimension condition CD(0,\infty) whose girth are at least five.
We show a connection between the $CDE'$ inequality and the $CD\psi$ inequality. In particular, we introduce a $CD_\psi^\varphi$ inequality as a slight generalization of $CD\psi$ which turns out to be equivalent to $CDE'$ with appropriate…
In this paper, we derive Li-Yau inequality for unbounded Laplacian on complete weighted graphs with the assumption of the curvature-dimension inequality $CDE'(n,K)$, which can be regarded as a notion of curvature on graphs. Furthermore, we…
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…
We study Bakry-\'Emery curvature-dimension inequalities for non-local operators on the one-dimensional lattice and prove that operators with finite second moment have finite dimension. Moreover, we show that a class of operators related to…
We derive pointwise curvature estimates for graphical mean curvature flows in higher codimensions. To the best of our knowledge, this is the first such estimates without assuming smallness of first derivatives of the defining map. An…
For integers m,k >= 1, we investigate the maximum size of a directed cut in directed graphs in which there are m edges and each vertex has either indegree at most k or outdegree at most k.
In this paper extremal values of the difference between several graph invariants related to the metric dimension are studied: mixed metric dimension, edge metric dimension and strong metric dimension. These non-trivial extremal values are…
The weak $k$-metric dimension of a graph is roughly understood as the cardinality of a smallest set of vertices $S$ of the graph with the property of uniquely recognizing all the vertices of the graph throughout summations of differences of…
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…
We derive an optimal eigenvalue ratio estimate for finite weighted graphs satisfying the curvature-dimension inequality $CD(0,\infty)$. This estimate is independent of the size of the graph and provides a general method to obtain higher…
In this paper, various kinds of invariants of directed graphs are summarized. In the first topic, the invariant w(G) for a directed graph G is introduced, which is primarily defined by S. Chen and X.M. Chen to solve a problem of weak…
There are several interrelated notions of discrete curvature on graphs. Many approaches utilize the optimal transportation metric on its probability simplex or the distance matrix of the graph. In this survey article, we compute formulas…
The metric (resp. edge metric) dimension of a simple connected graph $G$, denoted by dim$(G)$ (resp. edim$(G)$), is the cardinality of a smallest vertex subset $S\subseteq V(G)$ for which every two distinct vertices (resp. edges) in $G$…
This paper is devoted to the study of directed graphs with extremal properties relative to certain metric functionals. We characterize up to isomorphism critical digraphs with infinite values of diameter, quasi-diameter, radius and…