SearcharxivSearch

arXiv · 1905.10120

Convergence towards the end space for random walks on Schreier graphs

Abstract

We consider a transitive action of a finitely generated group $G$ and the Schreier graph $Γ$ defined by this action for some fixed generating set. For a probability measure $μ$ on $G$ with a finite first moment we show that if the induced random walk is transient, it converges towards the space of ends of $Γ$. As a corollary we obtain that for a probability measure with a finite first moment on Thompson's group $F$, the support of which generates $F$ as a semigroup, the induced random walk on the dyadic numbers has a non-trivial Poisson boundary. Some assumption on the moment of the measure is necessary as follows from an example by Juschenko and Zheng.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bogdan Stankov. 2020-11-30. Convergence towards the end space for random walks on Schreier graphs. https://doi.org/10.1007/s10959-021-01104-6

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