The volume and time comparison principle and transition probability estimates for random walks
From MaRDI portal
Publication:4451060
Abstract: This paper presents necessary and sufficient conditions for on- and off-diagonal transition probability estimates for random walks on weighted graphs. On the integer lattice and on may fractal type graphs both the volume of a ball and the mean exit time from a ball is independent of the centre, uniform in space. Here the upper estimate is given without such restriction and two-sided estimate is given if uniformity in the space assumed only for the mean exit time.
Recommendations
- Lower bounds for transition probabilities on graphs
- Volume and time doubling of graphs and random walks: The strongly recurrent case
- Pointwise upper estimates for transition probabilities of continuous time random walks on graphs
- Upper bounds for transition probabilities on graphs and isoperimetric inequalities
- Random walks among time increasing conductances: heat kernel estimates
Cited in
(7)- Transition probability estimates for long range random walks
- Local sub-Gaussian estimates on graphs: The strongly recurrent case
- Volume and time doubling of graphs and random walks: The strongly recurrent case
- Uniform asymptotic estimates of transition probabilities on combs
- Transition probability estimates for reversible Markov chains
- Pointwise upper estimates for transition probabilities of continuous time random walks on graphs
- Relative volume as a doubly stochastic binomial point process
This page was built for publication: The volume and time comparison principle and transition probability estimates for random walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4451060)
