Speed exponents of random walks on groups
arXiv:1203.6226 · doi:10.1093/imrn/rnv378
Abstract
For every 3/4 <= beta < 1 we construct a finitely generated group so that the expected distance of the simple random walk from its starting point is within a constant factor of n^beta. In fact, the speed can be set precisely to equal any nice prescribed function up to a constant factor.
arXiv comment30 pages
References in corpus (7)
- Amenability via random walks
- Amenability of linear-activity automaton groups
- Growth of permutational extensions
- On amenability of automata groups
- Positive speed for high-degree automaton groups
- Harmonic maps on amenable groups and a diffusive lower bound for random walks
- Behaviors of entropy on finitely generated groups