Lower bounds for transition probabilities on graphs (Q2372469)

The author considers an infinite connected graph \(\Gamma \) with no multiple edges and loops. Let \(\mu _{xy}=\mu _{yx}>0\) be a symmetric weight function on the edges \(x\sim y\) of \(\Gamma \). The weights \(\mu _{xy}\) define a \(\Gamma \)-valued reversible Markov chain, i.e., a random walk on the weighted graph \(\left( \Gamma ,\mu \right) \) with transition probabilities \( P\left( x,y\right) =\mu _{xy}/\sum_{y\sim x}\mu _{xy}\) for all vertices \(x,y\) of \(\Gamma \). Under suitable assumptions, continuing and using his work in [Commun. Pure Appl. Math. 54, No. 8, 975--1018 (2001; Zbl 1021.60037)], the author derives upper and lower estimates of the distribution of the exit time of the random walk from a ball, as well as lower bounds for its \(n\)-step off-diagonal probabilities.