A Berry-Esseen Type Theorem on Nilpotent Covering Graphs
Printed: Oct 2004
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.
22E25 - Nilpotent and solvable Lie groups
60J15 - unknown classification 60J15
58G32 - unknown classification 58G32