Upper escape rate of Markov chains on weighted graphs
Abstract
We obtain an upper escape rate function for a continuous time minimal symmetric Markov chain, defined on a locally finite weighted graph. This upper rate function is given in terms of volume growth with respect to an adapted path metric and has the same form as the manifold setting. Our approach also gives a slightly more restrictive form of Folz's theorem on conservativeness as a consequence.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.