Date of Original Version
Foundations of Computer Science, 2009. FOCS '09. 50th Annual IEEE Symposium on ,pp.725-734, 25-27 Oct. 2009
Abstract or Table of Contents
We generalize the Kahn-Kalai-Linial (KKL) Theorem to random walks on Cayley and Schreier graphs, making progress on an open problem of Hoory, Linial, and Wigderson. In our generalization, the underlying group need not be abelian so long as the generating set is a union of conjugacy classes.