Stochastic incompleteness for graphs and weak Omori-Yau maximum principle

From MaRDI portal
(Redirected from Publication:531882)




Abstract: 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.



Cites work


Cited in
(28)






This page was built for publication: Stochastic incompleteness for graphs and weak Omori-Yau maximum principle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q531882)