Computer Science – Discrete Mathematics
Scientific paper
2004-05-05
Computer Science
Discrete Mathematics
To appear in Memoirs of the American Mathematical Society. 118 pages. This newer version should have a two page glossary
Scientific paper
In this paper we show the following conjecture of Noga Alon. Fix a positive integer d>2 and real epsilon > 0; consider the probability that a random d-regular graph on n vertices has the second eigenvalue of its adjacency matrix greater than 2 sqrt(d-1) + epsilon; then this probability goes to zero as n tends to infinity. We prove the conjecture for a number of notions of random d-regular graph, including models for d odd. We also estimate the aforementioned probability more precisely, showing in many cases and models (but not all) that it decays like a polynomial in 1/n.
No associations
LandOfFree
A proof of Alon's second eigenvalue conjecture and related problems 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 A proof of Alon's second eigenvalue conjecture and related problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A proof of Alon's second eigenvalue conjecture and related problems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-467123