An interesting problem in algebraic geometry (having applications in coding theory) is to estimate sizes of images of maps between curves.  Using monodromy groups of curves, this problem can be studied using combinatorics of random matrices over finite fields and cycles of random permutations.  Along the way, we prove a conjecture of Shalev and obtain results about random generation of finite simple groups.  This work is joint with Bob Guralnick.