Related papers: Stochastic Completeness of Graphs
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 pointwise gradient bounds for heat semigroups associated to general (possibly unbounded) Laplacians on infinite graphs satisfying the curvature dimension condition CD(K,\infty). Using gradient bounds, we show stochastic…
We study the connections between volume growth, spectral properties and stochastic completeness of locally finite graphs. For a class of graphs with a very weak spherical symmetry we give a condition which implies both stochastic…
The goal of this article is to survey various results concerning stochastic completeness of graphs. In particular, we present a variety of formulations of stochastic completeness and discuss how a discrepancy between uniqueness class and…
We study regular coverings of graphs and manifolds with a focus on properties of the heat equation. In particular, we look at stochastic incompleteness, the Feller property and uniform transience; and investigate the connection between the…
In this note we prove an optimal volume growth condition for stochastic completeness of graphs under very mild assumptions. This is realized by proving a uniqueness class criterion for the heat equation which is an analogue to a…
We discuss Laplacians on graphs in a framework of regular Dirichlet forms. We focus on phenomena related to unboundedness of the Laplacians. This includes (failure of) essential selfadjointness, absence of essential spectrum and stochastic…
We survey geometric properties which imply the stochastic incompleteness of the minimal diffusion process associated to the Laplacian on manifolds and graphs. In particular, we completely characterize stochastic incompleteness for…
We discuss Laplacian spectrum on a finite metric graph with vertex couplings violating the time-reversal invariance. For the class of star graphs we determine, under the condition of a fixed total edge length, the configurations for which…
We obtain an upper heat kernel bound for the Laplacian on metric graphs arising as one skeletons of certain polygonal tilings of the plane, which reflects the one dimensional as well as the two dimensional nature of these graphs.
This survey is two-fold. We first report new progress on the spectral extremal results on the Tur\'{a}n type problems in graph theory. More precisely, we shall summarize the spectral Tur\'{a}n function in terms of the adjacency spectral…
In this paper, we establish a tight sufficient condition for the Hamiltonicity of graphs with large minimum degree in terms of the signless Laplacian spectral radius and characterize all extremal graphs. Moreover, we prove a similar result…
The study of spins and particles on graphs has broad applications, from the dynamics of interacting systems on networks to combinatorial problems. Here, we study the large-$n$ limit of the $O(n)$ model on graphs, which is considerably more…
We study Laplacians on graphs and networks via regular Dirichlet forms. We give a sufficient geometric condition for essential selfadjointness and explicitly determine the generators of the associated semigroups on all $\ell^p$, $1\leq p <…
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 consider Laplace operators on metric graphs, networks of one-dimensional line segments (bonds), with matching conditions at the vertices that make the operator self-adjoint. Such quantum graphs provide a simple model of quantum mechanics…
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 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…
Laplace operators on finite compact metric graphs are considered under the assumption that matching conditions at graph vertices are of $\delta$ and $\delta'$ types. Assuming rational independence of edge lengths, necessary and sufficient…
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…