Stochastic completeness of graphs.

Title: Stochastic completeness of graphs.
Identifier: AAI3310649
identifier: 3310649
Creator: Wojciechowski, Radoslaw Krzysztof.
Contributor: Adviser: Jozef Dodziuk
Date: 2008
Language: English
Publisher: City University of New York.
Subject: Mathematics
Abstract: We analyze the stochastic completeness of the heat kernel on 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 follows by studying a specific family of trees. We also prove a lower bound for the bottom of the spectrum of the discrete Laplacian and use this lower bound to show that in certain cases the Laplacian has empty essential spectrum.
Type: dissertation
Source: PQT Legacy CUNY.xlsx
degree: Ph.D.