Abstract

We prove an estimate for the speed of convergence of the
transition probability for a symmetric random walk
on a nilpotent covering graph.
To obtain this estimate, we give a complete proof of
the Gaussian bound for the gradient of the Markov kernel.