Related papers: Li-Yau inequality on graphs

In a previous paper Hua-Jost-Liu, we have applied Alexandrov geometry methods to study infinite semiplanar graphs with nonnegative combinatorial curvature. We proved the weak relative volume comparison and the Poincar\'e inequality on these…

It is shown that the heat kernel operator for the Laplace operator on any covariantly constant curved background, i.e. in symmetric spaces, may be presented in form of an averaging over the Lie group of isometries with some nontrivial…

We investigate the bottom of the spectra of infinite quantum graphs, i.e., Laplace operators on metric graphs having infinitely many edges and vertices. We introduce a new definition of the isoperimetric constant for quantum graphs and then…

Subgraph isomorphism counting is known as #P-complete and requires exponential time to find the accurate solution. Utilizing representation learning has been shown as a promising direction to represent substructures and approximate the…

A commonly used paradigm for representing graphs is to use a vector that contains normalized frequencies of occurrence of certain motifs or sub-graphs. This vector representation can be used in a variety of applications, such as, for…

In this paper, we obtain Li-Yau type gradient estimates with time dependent parameter for positive solutions of the heat equation that are different with the estimates by Li-Xu \cite{LX} and Qian \cite{Qi}. As an application of the…

In a previous work, the authors introduced a Lin-Lu-Yau type Ricci curvature for directed graphs referring to the formulation of the Chung Laplacian. The aim of this note is to provide a von Renesse-Sturm type characterization of our lower…

In a directed graph, a kernel is a subset of vertices that is both stable and absorbing. Not all digraphs have a kernel, but a theorem due to Boros and Gurvich guarantees the existence of a kernel in every clique-acyclic orientation of a…

We present a formalism for computing arbitrary multi-loop Feynman graphs in curved spacetime using the heat kernel approach. To this end, we compute the off-diagonal components of the heat kernel in Riemann normal coordinates up to second…

We study infinite analogues of expander graphs, namely graphs where subgraphs weighted by heat kernels form an expander family. Our main result is that there does not exist any infinite expander in this sense. This proves the analogue for…

We establish a Harnack inequality for finite connected graphs with non-negative Ricci curvature. As a consequence, we derive an eigenvalue lower bound, extending previous results for Ricci flat graphs.

This article presents new local and global gradient estimates of Li-Yau type for positive solutions to a class of nonlinear elliptic equations on smooth metric measure spaces involving the Witten Laplacian. The estimates are derived under…

Let $G=(V,E)$ be a finite, combinatorial graph. We define a notion of curvature on the vertices $V$ via the inverse of the resistance distance matrix. We prove that this notion of curvature has a number of desirable properties. Graphs with…

In this paper we prove a matrix Li-Yau-Hamilton inequality for the Green function on complete K\"ahler manifolds with nonnegative holomorphic bisectional curvature. This estimate can be seen as an elliptic analogue of the matrix estimate of…

We propose graph kernels based on subgraph matchings, i.e. structure-preserving bijections between subgraphs. While recently proposed kernels based on common subgraphs (Wale et al., 2008; Shervashidze et al., 2009) in general can not be…

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…

We establish a sharp lower bound on the first non-trivial eigenvalue of the Laplacian on a metric graph equipped with natural (i.e., continuity and Kirchhoff) vertex conditions in terms of the diameter and the total length of the graph.…

In this paper we are concerned with various graph invariants (girth, diameter, expansion constants, eigenvalues of the Laplacian, tree number) and their analogs for weighted graphs -- weighing the graph changes a combinatorial problem to…

We study the spectra of quantum graphs with the method of trace identities (sum rules), which are used to derive inequalities of Lieb-Thirring, Payne-P\'olya-Weinberger, and Yang types, among others. We show that the sharp constants of…

This paper develops an adaptive version of Mallat's scattering transform for signals on graphs. The main results are norm bounds for the layers of the transform, obtained from a version of a Beurling-Deny inequality that permits to remove…