The spectrum of random lifts

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

35 pages; substantially revised, constants in the main results improved

Scientific paper

For a fixed d-regular graph H, a random n-lift is obtained by replacing each vertex v of H by a "fibre" containing n vertices, then placing a uniformly random matching between fibres corresponding to adjacent vertices of H. We show that with extremely high probability, all eigenvalues of the lift that are not eigenvalues of H, have order O(sqrt(d)). In particular, if H is Ramanujan then its n-lift is with high probability nearly Ramanujan. We also show that any exceptionally large eigenvalues of the n-lift that are not eigenvalues of H, are overwhelmingly likely to have been caused by a dense subgraph of size O(|E(H)|).

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

The spectrum of random lifts does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The spectrum of random lifts, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The spectrum of random lifts will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-157084

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.