Abstract
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 Eroẃdos- 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. © 2012 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Arvind, V., Mukhopadhyay, P., & Nimbhorkar, P. (2012). Eroẃdos-Rényi sequences and deterministic construction of expanding cayley graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7256 LNCS, pp. 37–48). https://doi.org/10.1007/978-3-642-29344-3_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
