SearcharxivSearch

arXiv · 1603.01458

Almost invariance of distributions for random walks on groups

Abstract

We study the neighborhoods of a typical point $Z_n$ visited at $n$-th step of a random walk, determined by the condition that the transition probabilities stay close to $\mu^{*n}(Z_n)$. If such neighborhood contains a ball of radius $C \sqrt{n}$, we say that the random walk has almost invariant transition probabilities. We prove that simple random walks on wreath products of $\mathbb{Z}$ with finite groups have almost invariant distributions. A weaker version of almost invariance implies a necessary condition of Ozawa's criterion for the property $H_{\rm FD}$. We define and study the radius of almost invariance, we estimate this radius for random walks on iterated wreath products and show this radius can be asymptotically strictly smaller than $n/L(n)$, where $L(n)$ denotes the drift function of the random walk. We show that the radius of individual almost invariance of a simple random walk on the wreath product of $\mathbb{Z}^2$ with a finite group is asymptotically strictly larger than $n/L(n)$. Finally, we show the existence of groups such that the radius of almost invariance is smaller than a given function, but remains unbounded. We also discuss possible limiting distribution of ratios of transition probabilities on non almost invariant scales.

Explore related subjects

Keep this discovery

BibTeXRIS

Anna Erschler. 2016-03-04. Almost invariance of distributions for random walks on groups. https://arxiv.org/abs/1603.01458

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR