The rate of escape for anisotropic random walks in a tree

42Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Let G be the group generated by L free involutions, whose Cayley graph T is the infinite homogeneous tree with L edges at every node. A general central limit theorem and law of the iterated logarithm is proven for left-invariant random walks Zn on G or T which applies to the distance of Zn from a fixed point, as well as to the distribution of the last R letters in Zn. For nearest neighbor random walks, we also derive a generating function identity that yields formulas for the asymptotic mean and variance of the distance from a fixed point. A generalization for Zn with a finitely supported step distribution is derived and discussed. © 1987 Springer-Verlag.

Cite

CITATION STYLE

APA

Sawyer, S., & Steger, T. (1987). The rate of escape for anisotropic random walks in a tree. Probability Theory and Related Fields, 76(2), 207–230. https://doi.org/10.1007/BF00319984

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free