Context
Reading about Expanders
Setup
A regular n,2d graph is generated as follows: generate d random permutations of [n] connect the edges; giving a n,2d regular graph
Question
How do I prove that this graph is a good expander?
Known:
Broder/Shamir has a paper "On the second eigenvalue of random regular graphs." that proves this statement. However, it uses martingales, which I do not understand.
Also Known:
Many texts provide a short proof for bipartite graphs; but not the general case.
Request
Is there an elementary (combinatorial) proof of the general case? [For the graphs generated above.]
Thanks!