The Community for Technology Leaders
2013 IEEE 54th Annual Symposium on Foundations of Computer Science (2009)
Atlanta, Georgia
Oct. 25, 2009 to Oct. 27, 2009
ISSN: 0272-5428
ISBN: 978-0-7695-3850-1
pp: 725-734
ABSTRACT
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.
INDEX TERMS
KKL, Kahn-Kalai-Linial, Kruskal-Katona, learning, monotone functions, boolean functions
CITATION
Ryan O'Donnell, Karl Wimmer, "KKL, Kruskal-Katona, and Monotone Nets", 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, vol. 00, no. , pp. 725-734, 2009, doi:10.1109/FOCS.2009.78
87 ms
(Ver 3.3 (11022016))