A new proof of Friedman's second eigenvalue theorem and its extension to random lifts

From MaRDI portal
Publication:3389206




Abstract: It was conjectured by Alon and proved by Friedman that a random d-regular graph has nearly the largest possible spectral gap, more precisely, the largest absolute value of the non-trivial eigenvalues of its adjacency matrix is at most 2sqrtd1+o(1) with probability tending to one as the size of the graph tends to infinity. We give a new proof of this statement. We also study related questions on random n-lifts of graphs and improve a recent result by Friedman and Kohler.




Cited in
(48)






This page was built for publication: A new proof of Friedman's second eigenvalue theorem and its extension to random lifts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3389206)