### Stochastics and Discrete Analysis Seminar: Zoe Huang, UNC Chapel Hill, Cutoff for random Cayley graphs of nilpotent groups

SAS 4201We consider the random Cayley graphs of a sequence of finite nilpotent groups of diverging sizes G = G(n), whose ranks and nilpotency classes are uniformly bounded. For some k = k(n) such that 1 << log k << log |G|, we pick a random set of generators S = S(n) by sampling k elements…