The Relativized Second Eigenvalue Conjecture of Alon

Abstract

We prove a relativization of the Alon Second Eigenvalue Conjecture for all d-regular base graphs, B, with d 3: for any ε>0, we show that a random covering map of degree n to B has a new eigenvalue greater than 2d-1+ε in absolute value with probability O(1/n). Furthermore, if B is a Ramanujan graph, we show that this probability is proportional to n-η \,fund(B), where η \,fund(B) is an integer depending on B, which can be computed by a finite algorithm for any fixed B. For any d-regular graph, B, η \,fund(B) is greater than d-1. Our proof introduces a number of ideas that simplify and strengthen the methods of Friedman's proof of the original conjecture of Alon. The most significant new idea is that of a ``certified trace,'' which is not only greatly simplifies our trace methods, but is the reason we can obtain the n-η \,fund(B) estimate above. This estimate represents an improvement over Friedman's results of the original Alon conjecture for random d-regular graphs, for certain values of d.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…