A central limit theorem on a covering graph with a transformation group of polynomial growth (Q1411766)

The author derives a limit theorem for symmetric nearest-neighbor-type random walks on locally finite graphs that are covering graphs of finite graphs with finitely generated covering groups of polynomial growth. The limit theorem is of the kind that, under certain additional assumptions, the transition operators of the time-discrete random walk behave for large times like the transition semigroup associated with a sub-Laplacian of a suitable nilpotent Lie group. This limit theorem is closely related to a recent result of \textit{M. Kotani} for crystal lattices [J. Lond. Math. Soc., II. Ser. 65, 464-482 (2002; Zbl 1013.60011)].