论文信息 - Random Cayley Graphs with O(log[G]) Generators Are Expanders

Random Cayley Graphs with O(log[G]) Generators Are Expanders

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 ?(G,S). We show that for almost all choices of S given k = 2alog2 |G|, a > 1, we have Re?1 ? 1-1/2a. A similar but weaker result was obtained earlier by Alon and Roichman (see [4]).

Igor Pak | I. Pak

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

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

[3] R. RNall. Probabilistic methods in group theory II , 1976 .

[4] Kenji Handa. A Lower Bound for Time Correlation of Lattice Gases , 1999 .

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

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

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

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

[9] David B. Wilson. Random random walks on ℤ2d , 1997 .

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

[11] László Babai,et al. Local expansion of vertex-transitive graphs and random generation in finite groups , 1991, STOC '91.

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

[13] Igor Pak,et al. Random Walks On Finite Groups With Few Random Generators , 1999 .

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