2015
DOI: 10.1142/s0218196715500186
|View full text |Cite
|
Sign up to set email alerts
|

A train track directed random walk on Out(Fr)

Abstract: Abstract. Several known results, by Rivin, Calegari-Maher and Sisto, show that an element ϕn ∈ Out(Fr), obtained after n steps of a simple random walk on Out(Fr), is fully irreducible with probability tending to 1 as n → ∞. In this paper we construct a natural "train track directed" random walk W on Out(Fr) (where r ≥ 3). We show that, for the element ϕn ∈ Out(Fr), obtained after n steps of this random walk, with asymptotically positive probability the element ϕn has the following properties: ϕn is ageometric … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
12
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
6
1

Relationship

3
4

Authors

Journals

citations
Cited by 14 publications
(12 citation statements)
references
References 50 publications
(91 reference statements)
0
12
0
Order By: Relevance
“…[Pfa13] gives examples in each rank where this occurs. [KP15] then shows that this behavior is generic along a particular "train track directed" random walk. We use the tools developed in this paper to prove that, even along the "train track directed" random walk, one still obtains fully irreducibles with a cut vertex in their ideal Whitehead graph and hence more than one axis in their axis bundle.…”
Section: Introductionmentioning
confidence: 89%
See 2 more Smart Citations
“…[Pfa13] gives examples in each rank where this occurs. [KP15] then shows that this behavior is generic along a particular "train track directed" random walk. We use the tools developed in this paper to prove that, even along the "train track directed" random walk, one still obtains fully irreducibles with a cut vertex in their ideal Whitehead graph and hence more than one axis in their axis bundle.…”
Section: Introductionmentioning
confidence: 89%
“…The proof of Lemma 2.36 below (and also that of [KP15]), prompts a revision of the definition of a Nielsen path prevention sequence so that the procedure applied (introduced in [Pfa13, Proposition 5.2] ends in each case in the legal turn scenario of [Pfa13] Proposition 5.2(IIc) and so that taking powers is never required in the procedure. Finally, it only relies on a sequence being admissible in the sense of [KP15], and Definition 2.16 above. We call such a sequence a legalizing Nielsen path prevention sequence.…”
Section: Nielsen Path Prevention Sequences [Pfa13mentioning
confidence: 99%
See 1 more Smart Citation
“…What we prove in Theorem 4.7 of Section 4 is a necessary and sufficient condition for an ageometric fully irreducible outer automorphism to have a unique axis. One may note that examples of fully irreducibles satisfying the conditions of Theorem 4.7 can be found in [Pfa13a] and [Pfa13b] and it was in fact proved later, in [KP14], that satisfying these conditions is generic along a particular "train track directed" random walk.…”
Section: Introductionmentioning
confidence: 90%
“…We would also like to thank Ilya Kapovich for some valuable comments on indices of random automorphisms, in the context of his recent work [16] with Pfaff.…”
Section: Introductionmentioning
confidence: 99%