2000 character limit reached
The rate of escape of random walks on polycyclic and metabelian groups
Published 5 Oct 2010 in math.PR and math.GR | (1010.0983v2)
Abstract: We use subgroup distortion to determine the rate of escape of a simple random walk on a class of polycyclic groups, and we show that the rate of escape is invariant under changes of generating set for these groups. For metabelian groups, we define a stronger form of subgroup distortion, which applies to non-finitely generated subgroups. Under this hypothesis, we compute the rate of escape for certain random walks on metabelian groups via a comparison to the toppling of a dissipative abelian sandpile.
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.