Expansion properties of random Cayley graphs and vertex transitive graphs via matrix martingales
Expansion properties of random Cayley graphs and vertex transitive graphs via matrix martingales
复制标题
随机凯莱图和顶点传递图通过矩阵鞅的展开性质
DOI:
10.1002/rsa.20177
复制
发表时间:
2007
影响因子:
1
通讯作者:
Christofides D
中科院分区:
文献类型:
--
作者:
Christofides D
The Alon–Roichman theorem states that for every ε> 0 there is a constantc(ε), such that the Cayley graph of a finite groupGwith respect toc(ε)log ∣G∣ elements ofG, chosen independently and uniformly at random, has expected second largest eigenvalue less than ε. In particular, such a graph is an expander with high probability.Landau and Russell, and independently Loh and Schulman, improved the bounds of the theorem. Following Landau and Russell we give a new proof of the result, improving the bounds even further. When considered for a general groupG, our bounds are in a sense best possible. We also give a generalization of the Alon–Roichman theorem to random coset graphs.Our proof uses a Hoeffding‐type result for operator valued random variables, which we believe can be of independent interest. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2008