Learn More
We introduce a " derandomized " analogue of graph squaring. This operation increases the connectivity of the graph (as measured by the second eigenvalue) almost as well as squaring the graph does, yet only increases the degree of the graph by a constant factor, instead of squaring the degree. One application of this product is an alternative proof of(More)
R in sample Vol. xx, No xx (xxxx) 1–180 c xxxx xxxxxxxxx DOI: xxxxxx Abstract Pseudorandomness is the theory of efficiently generating objects that " look random " despite being constructed using little or no randomness. This survey of the subject places particular emphasis on the intimate connections that have been discovered between a variety of(More)
We construct a sequence of groups G n , and explicit sets of generators Y n ⊂ G n , such that all generating sets have bounded size, and the associated Cayley graphs are all expanders. The group G 1 is the alternating group A d , the set of even permutations on the elements {1, 2,. .. , d}. The group G n is the group of all even symmetries of the rooted(More)
  • 1