2000 character limit reached
Edgeworth expansions for centered random walks on covering graphs of polynomial volume growth (2011.13783v2)
Published 27 Nov 2020 in math.PR
Abstract: Edgeworth expansions for random walks on covering graphs with groups of polynomial volume growths are obtained under a few natural assumptions. The coefficients appearing in this expansion depends on not only geometric features of the underlying graphs but also the modified harmonic embedding of the graph into a certain nilpotent Lie group. Moreover, we apply the rate of convergence in Trotter's approximation theorem to establish the Berry-Esseen type bound for the random walks.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.