Upper escape rate of Markov chains on weighted graphs
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, which has the same form as the manifold setting, is given in terms of the volume growth with respect to an adapted path metric. Our approach also gives a weak form of Folz’s theorem on the conservativeness as a consequence.
Year of publication: |
2014
|
---|---|
Authors: | Huang, Xueping ; Shiozawa, Yuichi |
Published in: |
Stochastic Processes and their Applications. - Elsevier, ISSN 0304-4149. - Vol. 124.2014, 1, p. 317-347
|
Publisher: |
Elsevier |
Subject: | Escape rate | Upper rate function | Markov chains | Weighted graphs |
Saved in:
Saved in favorites
Similar items by subject
-
Centrality Computation in Weighted Networks Based on Edge-Splitting Procedure
Belik, Ivan, (2014)
-
Abderrahim, Elmoataz, (2014)
-
EDGE-WEIGHTING OF GENE EXPRESSION GRAPHS
KERR, GRAINNE, (2010)
- More ...