SearcharxivSearch

arXiv · 1110.5099

Behaviors of entropy on finitely generated groups

Abstract

A variety of behaviors of entropy functions of random walks on finitely generated groups is presented, showing that for any $\frac{1}{2}\leq α\leqβ\leq1$, there is a group $Γ$ with measure $μ$ equidistributed on a finite generating set such that \[\liminf\frac{\log H_{Γ,μ}(n)}{\log n}=α,\qquad \limsup \frac{\log H_{Γ,μ}(n)}{\log n}=β.\] The groups involved are finitely generated subgroups of the group of automorphisms of an extended rooted tree. The return probability and the drift of a simple random walk $Y_n$ on such groups are also evaluated, providing an example of group with return probability satisfying \[\liminf\frac{{\log}|{\log P}(Y_n=_Γ1)|}{\log n}=\frac{1}{3},\qquad \limsup\frac{{\log}|{\log P}(Y_n=_Γ1)|}{\log n}=1\] and drift satisfying \[\liminf\frac{\log {\mathbb{E}}\|Y_n\|}{\log n}=\frac{1}{2},\qquad \limsup\frac{\log {\mathbb{E}}\|Y_n\|}{\log n}=1.\]

Explore related subjects

Keep this discovery

BibTeXRIS

Jérémie Brieussel. 2013-12-16. Behaviors of entropy on finitely generated groups. https://doi.org/10.1214/12-aop761

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