Generic properties of whitehead's algorithm and isomorphism rigidity of random one-relator groups

We prove that Whitehead's algorithm for solving the automorphism problem in a fixed free group F_k has strongly linear time generic-case complexity. This is done by showing that the "hard" part of the algorithm terminates in linear time on an exponentially generic set of input pairs. We then apply these results to one-relator groups. We obtain a Mostow-type isomorphism rigidity result for random one-relator groups: If two such groups are isomorphic then their Cayley graphs on the given generating sets are isometric. Although no nontrivial examples were previously known, we prove that one-relator groups are generically complete groups, that is, they have trivial center and trivial outer automorphism group. We also prove that the stabilizers of generic elements of F_k in Aut(F_k) are cyclic groups generated by inner automorphisms and that Aut(F _k)-orbits are uniformly small in the sense of their growth entropy. We further prove that the number I_k(n) of isomorphism types of k-generator one-relator groups with defining relators of length n satisfies c₁/n(2k-1)ⁿ ≤ I_k(n) ≤c ₂(2k-1)_n, where c₁, c₂ are positive constants depending on k but not on n. Thus I_k(n) grows in essentially the same manner as the number of cyclic words of length n.