2:00 pm, Seminar hall
Random walks on random symmetric groups
University of Paris VII.
Finite simple groups are generated by two elements. Asymptotically almost surely a random choice of elements provides generators. We are interested in efficiency of generating symmetric and alternating groups in terms of mixing times. The results are based on expansion properties of certain random graphs.