Related papers: Curvature on Graphs via Equilibrium Measures
The problems of computing eccentricity, radius, and diameter are fundamental to graph theory. These parameters are intrinsically defined based on the distance metric of the graph. In this work, we propose quantum algorithms for the diameter…
In the continuum, close connections exist between mean curvature flow, the Allen-Cahn (AC) partial differential equation, and the Merriman-Bence-Osher (MBO) threshold dynamics scheme. Graph analogues of these processes have recently seen a…
In this paper, we investigate the problem of finding minimal graphs in $M^n\times\mathbb R$ with general boundary conditions using a variational approach. We look at so called generalized solutions of the Dirichlet Problem that minimize a…
We investigate quantum graphs with infinitely many vertices and edges without the common restriction on the geometry of the underlying metric graph that there is a positive lower bound on the lengths of its edges. Our central result is a…
A strict lower bound for the diameter of a symmetric graph is proposed, which is calculable with the order $n$ and other local parameters of the graph such as the degree $k\,(\geq 3)$, even girth $g\,(\geq 4)$, and number of $g$-cycles…
We investigate analytic and geometric implications of non-constant Ricci curvature bounds. We prove a Lichnerowicz eigenvalue estimate and finiteness of the fundamental group assuming that $L+2 Ric$ is a positive operator where $L$ is the…
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.
Discrete curvatures are quantities associated to the nodes and edges of a graph that reflect the local geometry around them. These curvatures have a rich mathematical theory and they have recently found success as a tool to analyze networks…
We prove that the diameter of any unweighted connected graph G is O(k log n/lambda_k), for any k>= 2. Here, lambda_k is the k smallest eigenvalue of the normalized laplacian of G. This solves a problem posed by Gil Kalai.
We express characteristic numbers of compact hyperk\"ahler manifolds in graph-theoretical form, considering them as a special case of the curvature invariants introduced by Rozansky and Witten. The appropriate graphs are generated by…
Given a finite simple graph G=(V,E) with chromatic number c and chromatic polynomial C(x). Every vertex graph coloring f of G defines an index i_f(x) satisfying the Poincare-Hopf theorem sum_x i_f(x)=chi(G). As a variant to the index…
A weighted area estimate for entire graphs with bounded weighted mean curvature in Gauss space is given by a simple proof. Bernstein type theorems for self shrinkers (\cite {wa}) as well as for graphic $\lambda$-hypersurfaces (\cite{…
We write the Euler characteristic X(G) of a four dimensional finite simple geometric graph G=(V,E) in terms of the Euler characteristic X(G(w)) of two-dimensional geometric subgraphs G(w). The Euler curvature K(x) of a four dimensional…
How does one generalize differential geometric constructs such as curvature of a manifold to the discrete world of graphs and other combinatorial structures? This problem carries significant importance for analyzing models of discrete…
For matrix analogues of embedded surfaces we define discrete curvatures and Euler characteristics, and a non-commutative Gauss--Bonnet theorem is shown to follow. We derive simple expressions for the discrete Gauss curvature in terms of…
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 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…
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…
We study that the $n-$graphs defining by smooth map $f:\Om\subset \ir{n}\to \ir{m}, m\ge 2,$ in $\ir{m+n}$ of the prescribed mean curvature and the Gauss image. We derive the interior curvature estimates $$\sup_{D_R(x)}|B|^2\le\f{C}{R^2}$$…
In this paper, we define the curvature dimension inequalities CD(m, K) on finite directed graphs modifying the case of undirected graphs. As a main result, we evaluate m and K on finite directed graphs.