Stochastic Completeness of Graphs

Details Stochastic Completeness of Graphs Stochastic Completeness of Graphs

2007-12-10

arxiv.org/abs/0712.1570v2

Mathematics

Spectral Theory

72 pages, 1 figure, PhD thesis

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Stochastic Completeness of Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Stochastic Completeness of Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Stochastic Completeness of Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-405889