Stochastic completeness of graphs: bounded Laplacians, intrinsic metrics, volume growth and curvature

From MaRDI portal
Publication:2663271

DOI10.1007/S00041-021-09821-6zbMATH Open1462.05167arXiv2010.02009OpenAlexW3151187501MaRDI QIDQ2663271FDOQ2663271


Authors: Radosław K. Wojciechowski Edit this on Wikidata


Publication date: 16 April 2021

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

Abstract: The goal of this article is to survey various results concerning stochastic completeness of graphs. In particular, we present a variety of formulations of stochastic completeness and discuss how a discrepancy between uniqueness class and volume growth criteria in the continuous and discrete settings was ultimately resolved via the use of intrinsic metrics. Along the way, we discuss some equivalent notions of boundedness in the sense of geometry and of analysis. We also discuss various curvature criteria for stochastic completeness and discuss how weakly spherically symmetric graphs establish the sharpness of results.


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




Recommendations




Cites Work


Cited In (12)





This page was built for publication: Stochastic completeness of graphs: bounded Laplacians, intrinsic metrics, volume growth and curvature

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