Random Cayley Graphs with O(log[G]) Generators Are Expanders
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Rapidly Mixing Markov Chains with Applications in Computer Science and Physics
Computing in Science and Engineering
Mathematical aspects of mixing times in Markov chains
Foundations and Trends® in Theoretical Computer Science
Efficient algorithms using the multiplicative weights update method
Efficient algorithms using the multiplicative weights update method
Random Cayley graphs and expanders
Random Structures & Algorithms
| Hi-index | 0.00 |
Given a finite group G by its multiplication table, we give a deterministic polynomial-time construction of a directed O(log|G|) degree Cayley expander for G. Our construction exploits the connection between rapid mixing random walks and spectral expansion. Our main group-theoretic tool is Erdős-Rényi sequences. We give a similar construction of O(log|G|) degree undirected Cayley expanders for G, which is an alternative proof of Wigderson and Xiao's derandomization [WX08] of the Alon-Roichman randomized construction.