Stochastic incompleteness for graphs and weak Omori-Yau maximum principle

From MaRDI portal
Publication:531882

DOI10.1016/J.JMAA.2011.02.009zbMATH Open1229.60088arXiv1009.2579OpenAlexW2963773741MaRDI QIDQ531882FDOQ531882


Authors: Xueping Huang Edit this on Wikidata


Publication date: 20 April 2011

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1009.2579




Recommendations




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)