SearcharxivSearch

arXiv · 1707.02186

Comptage probabiliste sur la fronti\`ere de Furstenberg

Abstract

Let $G$ be a real linear semisimple algebraic group without compact factors and $\Gamma$ a Zariski dense subgroup of $G$. In this paper, we use a probabilistic counting in order to study the asymptotic properties of $\Gamma$ acting on the Furstenberg boundary of $G$. First, we show that the $K$ components of the elements of $\Gamma$ in the KAK decomposition of $G$ become asymptotically independent. This result is an analog of a result of Gorodnik-Oh in the context of the Archimedean counting. Then, we give a new proof of a result of Guivarc'h concerning the positivity of the Hausdorff dimension of the unique stationary probability measure on the Furstenberg Boundary of $G$. Finally, we show how these results can be combined to give a probabilistic proof of the Tit's alternative; namely that two independent random walks on $\Gamma$ will eventually generate a free subgroup. This result answered a question of Guivarc'h and was published earlier by the author. Since we're working with the field of real numbers, we give here a more direct proof and a more general statement.

Explore related subjects

Keep this discovery

BibTeXRIS

Richard Aoun. 2017-07-07. Comptage probabiliste sur la fronti\`ere de Furstenberg. https://arxiv.org/abs/1707.02186

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