A train track directed random walk on
arXiv:1409.8044 · doi:10.1142/S0218196715500186
Abstract
Several known results, by Rivin, Calegari-Maher and Sisto, show that an element , obtained after steps of a simple random walk on , is fully irreducible with probability tending to 1 as . In this paper we construct a natural "train-track directed" random walk on (where ). We show that, for the element , obtained after steps of this random walk, with asymptotically positive probability the element has the following properties: is an ageometric fully irreducible, which admits a train-track representative with no periodic Nielsen paths and exactly one nondegenerate illegal turn, that has "rotationless index" (so that the geometric index of the attracting tree of is ), has index list and the ideal Whitehead graph being the complete graph on vertices, and that the axis bundle of in the Outer space consists of a single axis.
arXiv commentVarious small updates, incorporating the referee's comments; to appear in the International Journal of Algebra and Computation
References in corpus (8)
- Random walks on the mapping class group
- Core and intersection number for group actions on trees
- Geometric Intersection Number and analogues of the Curve Complex for free groups
- Statistics and compression of scl
- Algorithmic detectability of iwip automorphisms
- Free group automorphisms with many fixed points at infinity
- Rips Induction: Index of the dual lamination of an -tree
- Dynamics of hyperbolic iwips
Cited by in corpus (7)
- Lone Axes in Outer Space
- Normalizers and centralizers of cyclic subgroups generated by lone axis fully irreducible outer automorphisms
- The primitivity index function for a free group, and untangling closed curves on hyperbolic surfaces. With an appendix by Khalid Bou-Rabee
- Counting conjugacy classes of fully irreducibles: double exponential growth
- Long turns, INP's and index for free group automorphisms
- Recurrence of quadratic differentials for harmonic measure
- Ideal Whitehead Graphs in IV: Building ideal Whitehead graphs in higher ranks and ideal Whitehead graphs with cut vertices