SearcharxivSearch

arXiv · 1405.7938

The Poisson boundary of $\text{Out}(F_N)$

Abstract

Let $\mu$ be a probability measure on $\text{Out}(F_N)$ with finite first logarithmic moment with respect to the word metric, finite entropy, and whose support generates a nonelementary subgroup of $\text{Out}(F_N)$. We show that almost every sample path of the random walk on $(\text{Out}(F_N),\mu)$, when realized in Culler and Vogtmann's outer space, converges to the simplex of a free, arational tree. We then prove that the space $\mathcal{FI}$ of simplices of free and arational trees, equipped with the hitting measure, is the Poisson boundary of $(\text{Out}(F_N),\mu)$. Using Bestvina-Reynolds' and Hamenst\"adt's description of the Gromov boundary of the complex $\mathcal{FF}_N$ of free factors of $F_N$, this gives a new proof of the fact, due to Calegari and Maher, that the realization in $\mathcal{FF_N}$ of almost every sample path of the random walk converges to a boundary point. We get in addition that $\partial\mathcal{FF}_N$, equipped with the hitting measure, is the Poisson boundary of $(\text{Out}(F_N),\mu)$.

Explore related subjects

Keep this discovery

BibTeXRIS

Camille Horbez. 2014-05-30. The Poisson boundary of $\text{Out}(F_N)$. https://doi.org/10.1215/00127094-3166308

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