Alon–Boppana Bound

In spectral graph theory, the Alon–Boppana bound provides a lower bound on the second-largest eigenvalue of the adjacency matrix of a $d$-regular graph, meaning a graph in which every vertex has degree $d$. The reason for the interest in the second-largest eigenvalue is that the largest eigenvalue is guaranteed to be $d$ due to $d$-regularity, with the all-ones vector being the associated eigenvector. The graphs that come close to meeting this bound are Ramanujan graphs, which are examples of the best possible expander graphs.

Its discoverers are Noga Alon and Ravi Boppana.

Theorem statement

Let $G$ be a $d$-regular graph on $n$ vertices with diameter $m$, and let $A$ be its adjacency matrix. Let $\lambda_1 \ge \lambda_2 \ge \cdots \ge \lambda_n$ be its eigenvalues. Then
:$\lambda_2 \ge 2\sqrt - \frac.$

The above statement is the original one proved by Noga Alon. Some slightly weaker variants exist to improve the ease of proof or improve intuition. Two of these are shown in the proofs below.

Intuition

The intuition for the number $2\sqrt$ comes from considering the infinite $d$-regular tree. This graph is a universal cover of $d$-regular graphs, and it has spectral radius $2\sqrt.$

Saturation

A graph that essentially saturates the Alon–Boppana bound is called a Ramanujan graph. More precisely, a Ramanujan graph is a $d$-regular graph such that $, \lambda_2, , , \lambda_n, \le 2\sqrt.$

A theorem by Friedman shows that, for every $d$ and $\epsilon > 0$ and for sufficiently large $n$, a random $d$-regular graph $G$ on $n$ vertices satisfies $\max\ < 2\sqrt + \epsilon$ with high probability. This means that a random $n$-vertex $d$-regular graph is typically "almost Ramanujan."

First proof (slightly weaker statement)

We will prove a slightly weaker statement, namely dropping the specificity on the second term and simply asserting $\lambda_2 \ge 2\sqrt - o(1).$ Here, the $o(1)$ term refers to the asymptotic behavior as $n$ grows without bound while $d$ remains fixed.

Let the vertex set be $V.$ By the min-max theorem, it suffices to construct a nonzero vector $z\in\mathbb^$ such that $z^\mathbf = 0$ and $\frac \ge 2\sqrt - o(1).$

Pick some value $r\in\mathbb.$ For each vertex in $V,$ define a vector $f(v)\in\mathbb^$ as follows. Each component will be indexed by a vertex $u$ in the graph. For each $u,$ if the distance between $u$ and $v$ is $k,$ then the $u$-component of $f(v)$ is $f(v)_u = w_k = (d-1)^$ if $k\le r-1$ and $0$ if $k\ge r.$ We claim that any such vector $x = f(v)$ satisfies

:$\frac \ge 2\sqrt\left(1 - \frac\right).$

To prove this, let $V_k$ denote the set of all vertices that have a distance of exactly $k$ from $v.$ First, note that

:$x^x = \sum_^, V_k, w^2_k.$

Second, note that

:x^Ax = \sum_x_u \sum_x_ \ge \sum_^, V_k, w_k\left _ + (d-1)w_\right- (d-1), V_, w_w_r,

where the last term on the right comes from a possible overcounting of terms in the initial expression. The above then implies

:$x^Ax \ge 2\sqrt\left(\sum_^, V_k, w^2_k - \frac, V_, w^2_\right),$

which, when combined with the fact that $, V_, \le (d-1), V_k,$ for any $k,$ yields

:$x^Ax \ge 2\sqrt\left(1 - \frac\right)\sum_^, V_k, w^2_k.$

The combination of the above results proves the desired inequality.

For convenience, define the $(r-1)$-ball of a vertex $v$ to be the set of vertices with a distance of at most $r-1$ from $v.$ Notice that the entry of $f(v)$ corresponding to a vertex $u$ is nonzero if and only if $u$ lies in the $(r-1)$-ball of $x.$

The number of vertices within distance $k$ of a given vertex is at most $1 + d + d(d-1) + d(d-1)^2 + \cdots + d(d-1)^ = d^k + 1.$ Therefore, if $n \ge d^ + 2,$ then there exist vertices $u, v$ with distance at least $2r.$

Let $x = f(v)$ and $y = f(u).$ It then follows that $x^y = 0,$ because there is no vertex that lies in the $(r-1)$-balls of both $x$ and $y.$ It is also true that $x^Ay = 0,$ because no vertex in the $(r-1)$-ball of $x$ can be adjacent to a vertex in the $(r-1)$-ball of $y.$

Now, there exists some constant $c$ such that $z = x - cy$ satisfies $z^\mathbf = 0.$ Then, since $x^y = x^Ay = 0,$

:$z^Az = x^Ax + c^2y^Ay \ge 2\sqrt\left(1 - \frac\right)(x^x + c^2y^y) = 2\sqrt\left(1 - \frac\right)z^z.$

Finally, letting $r$ grow without bound while ensuring that $n \ge d^ + 2$ (this can be done by letting $r$ grow sublogarithmically as a function of $n$) makes the error term $o(1)$ in $n.$

Second proof (slightly modified statement)

This proof will demonstrate a slightly modified result, but it provides better intuition for the source of the number $2\sqrt.$ Rather than showing that $\lambda_2 \ge 2\sqrt - o(1),$ we will show that $\lambda = \max(, \lambda_2, , , \lambda_n, ) \ge 2\sqrt - o(1).$

First, pick some value $k\in\mathbb.$ Notice that the number of closed walks of length $2k$ is

:$\operatornameA^ = \sum_^n \lambda^_i\le d^ + n\lambda^.$

However, it is also true that the number of closed walks of length $2k$ starting at a fixed vertex $v$ in a $d$-regular graph is at least the number of such walks in an infinite $d$-regular tree, because an infinite $d$-regular tree can be used to cover the graph. By the definition of the Catalan numbers, this number is at least $C_k(d-1)^k,$ where $C_k = \frac\binom$ is the $k^$ Catalan number.

It follows that

:$\operatornameA^ \ge n\frac\binom(d-1)^$
:$\implies \lambda^ \ge \frac\binom(d-1)^ - \frac.$

Letting $n$ grow without bound and letting $k$ grow without bound but sublogarithmically in $n$ yields $\lambda \ge 2\sqrt - o(1).$

References

{{DEFAULTSORT:Alon-Boppana bound
Algebraic graph theory
Spectral theory