Words and mixing times in finite simple groups

Gili Schul*, Aner Shalev

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

5 Scopus citations


Let w ≠ 1 be a non-trivial group word, let G be a finite simple group, and let w.G/be the set of values of w in G. We show that if G is large, then the random walk on G with respect to w.G/ as a generating set has mixing time 2. This strengthens various known results, for example the fact that w(G) 2 covers almost all of G.

Original languageAmerican English
Pages (from-to)517-535
Number of pages19
JournalGroups, Geometry, and Dynamics
Issue number2
StatePublished - 2011


  • Finite simple groups
  • Mixing time
  • Random walks
  • Words


Dive into the research topics of 'Words and mixing times in finite simple groups'. Together they form a unique fingerprint.

Cite this