相关论文: Sharp Davies-Gaffney-Grigor'yan Lemma on Graphs
We prove a variant of the Davies-Gaffney-Grigor'yan Lemma for the continuous time heat kernel on graphs. We use it together with the Li-Yau inequality to obtain strong heat kernel estimates for graphs satisfying the exponential curvature…
We prove Davies-Gaffney-Grigor'yan lemma for heat kernels of bounded discrete Hodge Laplacians on simplicial complexes.
Results regarding off-diagonal Gaussian upper heat kernel bounds on discrete weighted graphs with possibly unbounded geometry are summarized and related. After reviewing uniform upper heat kernel bounds obtained by Carlen, Kusuoka, and…
The purpose of this paper is to establish a new continuous-time on-diagonal lower estimate of heat kernel for large time on graphs. To achieve the goal, we first give an upper bound of heat kernel in natural graph metric, and then use this…
We prove that in presence of $L^2$ Gaussian estimates, so-called Davies-Gaffney estimates, on-diagonal upper bounds imply precise off-diagonal Gaussian upper bounds for the kernels of analytic families of operators on metric measure spaces.
We study the existence and uniqueness of the heat kernel on infinite, locally finite, connected graphs. For general graphs, a uniqueness criterion, shown to be optimal, is given in terms of the maximal valence on spheres about a fixed…
We prove large-time Gaussian upper bounds for continuous-time heat kernels of Laplacians on graphs with unbounded geometry. Our estimates hold for centers of large balls satisfying a Sobolev inequality and volume doubling. Distances are…
We apply Davies' method for obtaining pointwise lower bounds on the heat kernels of higher-order differential operators to obtain pointwise lower bounds in the presence of a polynomialy bounded potential.
We study the heat equation associated to the Hodge Laplacian on simplicial complexes. Using recently developed techniques for magnetic Schr\"odinger operators, we prove Davies-Gaffney-Grigoryan type estimates for the kernel of the heat…
In this thesis, we analyze the stochastic completeness of a heat kernel on graphs which is a function of three variables: a pair of vertices and a continuous time, for infinite, locally finite, connected graphs. For general graphs, a…
We apply the Davies method to prove that for any regular Dirichlet form on a metric measure space, an off-diagonal stable-type upper bound of the heat kernel is equivalent to the conjunction of the on-diagonal upper bound, a cutoff…
Graph burning runs on discrete time steps. The aim is to burn all the vertices in a given graph in the least number of time steps. This number is known to be the burning number of the graph. The spread of social influence, an alarm, or a…
We analyze the heat kernel associated to the Laplacian on a compact metric graph, with standard Kirchoff-Neumann vertex conditions. An explicit formula for the heat kernel as a sum over loops, developed by Roth and Kostrykin, Potthoff, and…
We establish Gaussian-type upper bounds on the heat kernel for a continuous-time random walk on a graph with unbounded weights under an ergodicity assumption. For the proof we use Davies' perturbation method, where we show a maximal…
Faber-Krahn functions provide lower bounds on the first Dirichlet eigenvalue of the Laplacian and are useful because they imply heat kernel upper bounds. In this paper, we are interested in Faber-Krahn functions and heat kernel estimates…
In this paper, we solve the longstanding Gaussian curvature conjecture of a minimal graph $S$ over the unit disk. The conjecture asserts that for any minimal graph above the unit disk, the Gaussian curvature at the point directly above the…
A graph $ G $ is minimally $ t $-tough if the toughness of $ G $ is $ t $ and deletion of any edge from $ G $ decreases its toughness. Katona et al. conjectured that the minimum degree of any minimally $ t $-tough graph is $ \lceil 2t\rceil…
We prove the Li-Yau gradient estimate for the heat kernel on graphs. The only assumption is a variant of the curvature-dimension inequality, which is purely local, and can be considered as a new notion of curvature for graphs. We compute…
The graph removal lemma is a fundamental result in extremal graph theory which says that for every fixed graph $H$ and $\varepsilon > 0$, if an $n$-vertex graph $G$ contains $\varepsilon n^2$ edge-disjoint copies of $H$ then $G$ contains…
In this paper we study heat kernels associated to a Carnot group $G$, endowed with a family of collapsing left-invariant Riemannian metrics $\sigma_\e$ which converge in the Gromov-Hausdorff sense to a sub-Riemannian structure on $G$ as…