Random Walks On Finite Groups With Few Random Generators

Let $G$ be a finite group. Choose a set $S$ of size $k$ uniformly from $G$ and consider a lazy random walk on the corresponding Cayley graph. We show that for almost all choices of $S$ given $k = 2a\, \log_2 |G|$, $a>1$, this walk mixes in under $m = 2a \,\log\frac{a}{a-1} \log |G|$ steps. A similar result was obtained earlier by Alon and Roichman and also by Dou and Hildebrand using a different techniques. We also prove that when sets are of size $k = \log_2 |G| + O(\log \log |G|)$, $m = O(\log^3 |G|)$ steps suffice for mixing of the corresponding symmetric lazy random walk. Finally, when $G$ is abelian we obtain better bounds in both cases.

[1]  L. Babai.  Automorphism groups, isomorphism, reconstruction , 1996 .

[2]  P. Diaconis,et al.  Strong uniform times and finite random walks , 1987 .

[3]  Aner Shalev,et al.  The probability of generating a finite simple group , 1995 .

[4]  William M. Kantor,et al.  The probability of generating a finite classical group , 1990 .

[5]  William M. Kantor,et al.  The probability of generating a classical group , 1994 .

[6]  David J. Aldous,et al.  Lower bounds for covering times for reversible Markov chains and random walks on graphs , 1989 .

[7]  Martin Hildebrand,et al.  Enumeration and random random walks on finite groups , 1996 .

[8]  P. Diaconis,et al.  SHUFFLING CARDS AND STOPPING-TIMES , 1986 .

[9]  A. Rényi,et al.  Probabilistic methods in group theory , 1965 .

[10]  P. Diaconis,et al.  The cutoff phenomenon in finite Markov chains. , 1996, Proceedings of the National Academy of Sciences of the United States of America.

[11]  R. Graham,et al.  Handbook of Combinatorics , 1995 .

[12]  Gábor Hetyei,et al.  On the Diameter of Random Cayley Graphs of the Symmetric Group , 1992, Combinatorics, Probability and Computing.

[13]  László Babai,et al.  Vertex-transitive graphs and vertex-transitive maps , 1991, J. Graph Theory.

[14]  Ronald L. Graham,et al.  Asymptotic Analysis of a Random Walk on a Hypercube with Many Dimensions , 1990, Random Struct. Algorithms.

[15]  P. Diaconis,et al.  Comparison Techniques for Random Walk on Finite Groups , 1993 .

[16]  Martin Hildebrand,et al.  Random walks supported on random points ofZ/nZ , 1994 .

[17]  David Bruce Wilsondbwilson.  Random Random Walks on Zd 2 , 1997 .

[18]  Noga Alon,et al.  Random Cayley Graphs and Expanders , 1994, Random Struct. Algorithms.

[19]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[20]  Igor Pak,et al.  RANDOM WALKS ON NILPOTENT GROUPS , 2001 .

[21]  Yuval Roichman.  On random random walks , 1996 .

[22]  P. Diaconis.  Group representations in probability and statistics , 1988 .

[23]  Andrew S. Greenhalgh.  A Model for Random Random-Walks on Finite Groups , 1997, Comb. Probab. Comput..