Hostname: page-component-78c5997874-xbtfd Total loading time: 0 Render date: 2024-11-17T15:03:09.268Z Has data issue: false hasContentIssue false
  • English
  • Français

A Berry-Esseen Type Theorem on Nilpotent Covering Graphs

Published online by Cambridge University Press:  20 November 2018

Satoshi Ishiwata
Satoshi Ishiwata*
Affiliation:
Insititute of Mathematics, University of Tsukuba, Tsukuba-shi Ibaraki, 305-8571, Japan e-mail: ishiwata@math.tsukuba.ac.jp
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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.

Keywords

22E2560J1558G32
Type
Research Article
Information
Canadian Journal of Mathematics , Volume 56 , Issue 5 , 01 October 2004 , pp. 963 - 982
Copyright
Copyright © Canadian Mathematical Society 2004

References

[1] Alexopoulos, G., Convolution powers on discrete groups of polynomial volume growth. CMS Conf. Proc. 21, Amer. Math. Soc., Providence, RI 1997, 31–57.Google Scholar
[2] Coulhon, T. and Grigor’yan, A., Random walks on graphs with regular volume growth. Geom. Funct. Anal. 8(1998), 656–701.Google Scholar
[3] Delmotte, T., Parabolic Harnak inequality and estimates of Markov chains on graph. Rev. Mat. Iberoamericana 15(1999), 181–232.Google Scholar
[4] Grigor’yan, A. and Telcs, A., Sub-Gaussian estimates of heat kernels on infinite graphs. Duke Math. J. 109(2001), 451–510.Google Scholar
[5] Hebisch, W. and Saloff-Coste, L., Gaussian estimates for Markov chains and random walks on groups. Ann. Probab. 21(1993), 673–709.Google Scholar
[6] Ishiwata, S., A central limit theorem on a covering graph with a transformation group of polynomial growth. J. Math. Soc. Japan 55(2003), 837–853.Google Scholar
[7] Kotani, M., A central limit theorem for magnetic transition operators on a crystal lattice. J. London Math. Soc. 65(2002), 464–482.Google Scholar
[8] Kotani, M., Shirai, T. and Sunada, T., Asymptotic behavior of the transition probability of a random walk on an infinite graph. J. Funct. Anal. 159(1998), 664–689.Google Scholar
[9] Kotani, M. and Sunada, T., Standard realizations of crystal lattices via harmonic maps. Trans. Amer. Math. Soc. 353(2001), 1–20.Google Scholar
[10] Kotani, M. and Sunada, T., Albanese maps and off diagonal long time asymptotics for the heat kernel. Comm. Math. Phys. 209(2000), 633–670.Google Scholar
[11] Mal’cev, A. I., On a class of homogeneous spaces. Amer. Math. Soc. Transl. 39(1951).Google Scholar
[12] Pittet, C. and Saloff-Coste, L., On the stability of the behavior of random walks on groups. J. Geom. Anal. 10(2000), 713–737.Google Scholar
[13] Raghunathan, M. S., Discrete Subgroups of Lie Groups. Springer-Verlag, New York, 1972.Google Scholar
[14] Saloff-Coste, L., Isoperimetric inequalities and decay of iterated kernels for almost-transitive Markov chains. Combin. Probab. Comput. 4(1995), 419–442.Google Scholar
[15] Sazonov, V. V., Normal Approximation—Some Recent Advances. Lecture Notes in Mathematics 879, Springer-Verlag, New York, 1981 Google Scholar
[16] Varopoulos, N. Th., Isoperimetric inequalities and Markov chains. J. Funct. Anal. 63(1985), 215–239.Google Scholar
[17] Varopoulos, N. Th., Saloff-Coste, L. and Coulhon, T., Analysis and geometry on groups. Cambridge Tracts in Mathematics 100, Cambridge University Press, Cambridge, 1992.Google Scholar
[18] Woess, W., Random walks on infinite graphs and groups. Cambridge Tracts in Mathematics 138, Cambridge University Press, Cambridge, 2000.Google Scholar