Related papers: Graph H\"ormander Systems
Using a non-negative curvature condition, we prove the complete version of modified log-Sobolev inequalities for central Markov semigroups on various compact quantum groups, including group von Neumann algebras, free orthogonal group and…
We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…
To study the reflecting diffusion processes on manifolds with boundary, some new curvature operators are introduced by using the Bakry-Emery curvature and the second fundamental form. As applications, the gradient estimates, log-Harnack…
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…
We prove that for a symmetric Markov semigroup, Ricci curvature bounded from below by a non-positive constant combined with a finite $L_\infty$-mixing time implies the modified log-Sobolev inequality. Such $L_\infty$-mixing time estimates…
For a closed connected surface with a metric g, we consider the regularized trace of the inverse of the Laplace-Beltrami operator. We minimize this on the class of smooth metrics conformal to g having the same area, and show that the…
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…
We introduce a new version of a curvature-dimension inequality for non-negative curvature. We use this inequality to prove a logarithmic Li-Yau inequality on finite graphs. To formulate this inequality, we introduce a non-linear variant of…
We study graphs with nonnegative Bakry-\'Emery curvature or Ollivier curvature outside a finite subset. For such a graph, via introducing the discrete Gromov-Hausdorff convergence we prove that the space of bounded harmonic functions is…
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…
Based on earlier work by Carlen-Maas and the second- and third-named author, we introduce the notion of intertwining curvature lower bounds for graphs and quantum Markov semigroups. This curvature notion is stronger than both Bakry-\'Emery…
We present a method to control gonality of nonarchimedean curves based on graph theory. Let k denote a complete nonarchimedean valued field. We first prove a lower bound for the gonality of a curve over the algebraic closure of k in terms…
On a Riemannian metric-measure space, we establish an Alexandrov-Bakelman-Pucci type measure estimate connecting Bakry-\'Emery Ricci curvature lower bound, modified Laplacian and the measure of certain special sets. We apply this estimate…
In this survey, we study three different notions of curvature that are defined on graphs, namely, combinatorial curvature, Bakry-\'Emery curvature, and Ollivier's Ricci curvature. For each curvature notion, the definition and its motivation…
We develop a new framework for establishing approximate factorization of entropy on arbitrary probability spaces, using a geometric notion known as non-negative sectional curvature. The resulting estimates are equivalent to entropy…
This paper is devoted to various applications of Hardy-Sobolev type inequalities. We derive a new $L^2$ estimate for the $\bar{\partial}-$equation on ${\mathbb C}^n$ which yields a quantitative generalization of the Hartogs extension…
We present two hypermatrix formulations of the Cayley Hamilton theorem. One of the proposed formulation naturally extends to hypermatrices the combinatorial interpretations of the classical Cayley Hamilton theorem. We conclude by discussing…
We derive a number of upper and lower bounds for the first nontrivial eigenvalue of a finite quantum graph in terms of the edge connectivity of the graph, i.e., the minimal number of edges which need to be removed to make the graph…
Let $B_2(p)$ be an $n$-dimensional smooth geodesic ball with Ricci curvature $\geq-(n-1)\kappa^2$ for some $\kappa\geq0$. We establish the Sobolev inequality and the uniform Neumann-Poincar\'e inequality on each minimal graph over $B_1(p)$…
This paper introduces a notion of gradient and an infimal-convolution operator that extend properties of solutions of Hamilton Jacobi equations to more general spaces, in particular to graphs. As a main application, the hypercontractivity…