Speed exponents of random walks on groups
From MaRDI portal
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.
Recommendations
Cited in
(17)- Expected depth of random walks on groups
- Cogrowth and spectral gap of generic groups.
- On the joint behaviour of speed and entropy of random walks on groups
- Isoperimetric inequalities, shapes of Følner sets and groups with Shalom's property \(H_{\mathrm{FD}}\)
- Inverted orbits of exclusion processes, diffuse-extensive-amenability, and (non-?)amenability of the interval exchanges
- Law of large numbers for the drift of the two-dimensional wreath product
- Speed of random walks, isoperimetry and compression of finitely generated groups
- Poisson-Furstenberg boundary and growth of groups
- Speedups of ergodic group extensions
- Embeddings of Discrete Groups and the Speed of Random Walks
- An example of the rate of growth for a random walk on a group
- Extensive amenability and an application to interval exchanges
- On the speed of distance-stationary sequences
- Noise sensitivity of random walks on groups
- Asymptotic behaviors of random walks on countable groups
- A law of iterated logarithm on lamplighter diagonal products
- Amenability of quadratic automaton groups
This page was built for publication: Speed exponents of random walks on groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4611946)