Stochastic incompleteness for graphs and weak Omori-Yau maximum principle

Details Stochastic incompleteness for graphs and weak Omori-Yau maximum principle Stochastic incompleteness for graphs and weak Omori-Yau maximum principle

2010-09-14

arxiv.org/abs/1009.2579v4

Mathematics

Spectral Theory

Revised version. We add some previously omitted proof

Scientific paper

We prove an analogue of the weak Omori-Yau maximum principle and Khas'minskii's criterion for graphs in the general setting of Keller and Lenz. Our approach naturally gives the stability of stochastic incompleteness under certain surgeries of graphs. It allows to develop a unified approach to all known criteria of stochastic completeness/incompleteness, as well as to obtain new criteria.

Affiliated with

Also associated with

No associations

Rating

Stochastic incompleteness for graphs and weak Omori-Yau maximum principle 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 incompleteness for graphs and weak Omori-Yau maximum principle, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Stochastic incompleteness for graphs and weak Omori-Yau maximum principle will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-395370