Article contents
A Berry-Esseen Type Theorem on Nilpotent Covering Graphs
Published online by Cambridge University Press: 20 November 2018
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.
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 2004
References
- 4
- Cited by