Largest projections for random walks and shortest curves in random mapping tori

From MaRDI portal
Publication:2001012




Abstract: We show that the largest subsurface projection distance between a marking and its image under the nth step of a random walk grows logarithmically in n, with probability approaching 1 as n tends to infinity. Our setup is general and also applies to (relatively) hyperbolic groups and to mathrmOut(Fn). We then use this result to prove Rivin's conjecture that for a random walk (wn) on the mapping class group, the shortest geodesic in the hyperbolic mapping torus Mwn has length on the order of 1/log2(n).









This page was built for publication: Largest projections for random walks and shortest curves in random mapping tori

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2001012)