Lower bounds for transition probabilities on graphs
Probability
2008-01-29 v1
Abstract
The paper presents two results. The first one provides separate conditions for the upper and lower estimate of the distribution of the exit time from balls of a random walk on a weighted graph. The main result of the paper is that the lower estimate follows from the elliptic Harnack inequality. The second result is an off-diagonal lower bound for the transition probability of the random walk.
Cite
@article{arxiv.0801.4260,
title = {Lower bounds for transition probabilities on graphs},
author = {Andras Telcs},
journal= {arXiv preprint arXiv:0801.4260},
year = {2008}
}