Stochastic Completeness of Graphs

Abstract

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 sufficient condition for stochastic completeness is given in terms of the maximum valence on spheres about a fixed vertex. That this result is optimal is shown by studying a particular family of trees. We also prove a lower bound on the bottom of the spectrum for the discrete Laplacian and use this lower bound to show that in certain cases the Laplacian has empty essential spectrum.

72 pages, 1 figure, PhD thesis

Cited by in corpus (14)

• Path Laplacian operators and superdiffusive processes on graphs. I. One-dimensional case
• The problem of deficiency indices for discrete Schrödinger operators on locally finite graphs
• Localization criteria for Anderson models on locally finite graphs
• A discrete Gauss-Green identity for unbounded Laplace operators and transience of random walks
• Infinite networks and variation of conductance functions in discrete Laplacians
• A Glazman-Povzner-Wienholtz Theorem on graphs
• Absolutely continuous spectrum for multi-type Galton Watson trees
• Poincaré and Hardy inequalities on homogeneous trees
• Geometric and spectral properties of locally tessellating planar graphs
• Self-adjoint extensions of network Laplacians and applications to resistance metrics
• Stochastic incompleteness for graphs and weak Omori-Yau maximum principle
• Cheeger constants, growth and spectrum of locally tessellating planar graphs
• Unbounded containment in the energy space of a network and the Krein extension of the energy Laplacian
• Localization for alloy-type models with non-monotone potentials