On amenability of automata groups

Abstract

We show that the group of bounded automatic automorphisms of a rooted tree is amenable, which implies amenability of numerous classes of groups generated by finite automata. The proof is based on reducing the problem to showing amenability just of a certain explicit family of groups ("Mother groups") which is done by analyzing the asymptotic properties of random walks on these groups.

Cited by in corpus (11)

• Extensions of amenable groups by recurrent groupoids
• Extensive amenability and an application to interval exchanges
• Behaviors of entropy on finitely generated groups
• Poisson-Furstenberg boundary and growth of groups
• Almost-automorphisms of trees, cloning systems and finiteness properties
• Groups and Semigroups Defined by Colorings of Synchronizing Automata
• The Liouville property for groups acting on rooted trees
• Speed exponents of random walks on groups
• Exponential growth of some iterated monodromy groups
• Thompson-like groups, Reidemeister numbers, and fixed points
• On a class of poly-context-free groups generated by automata