SearcharxivSearch

arXiv · 1409.8044

A train track directed random walk on $Out(F_r)$

Abstract

Several known results, by Rivin, Calegari-Maher and Sisto, show that an element $ϕ_n\in Out(F_r)$, obtained after $n$ steps of a simple random walk on $Out(F_r)$, is fully irreducible with probability tending to 1 as $n\to\infty$. In this paper we construct a natural "train-track directed" random walk $\mathcal W$ on $Out(F_r)$ (where $r\ge 3$). We show that, for the element $ϕ_n\in Out(F_r)$, obtained after $n$ steps of this random walk, with asymptotically positive probability the element $ϕ_n$ has the following properties: $ϕ_n$ is an ageometric fully irreducible, which admits a train-track representative with no periodic Nielsen paths and exactly one nondegenerate illegal turn, that $ϕ_n$ has "rotationless index" $\frac{3}{2}-r$ (so that the geometric index of the attracting tree $T_{ϕ_n}$ of $ϕ_n$ is $2r-3$), has index list $\{\frac{3}{2}-r\}$ and the ideal Whitehead graph being the complete graph on $2r-1$ vertices, and that the axis bundle of $ϕ_n$ in the Outer space $CV_r$ consists of a single axis.

Explore related subjects

Keep this discovery

BibTeXRIS

Ilya Kapovich, Catherine Pfaff. 2015-05-05. A train track directed random walk on $Out(F_r)$. https://doi.org/10.1142/s0218196715500186

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