Alon–Boppana bound – Wikipedia

In spectral graph theory, the Alon–Boppana bound provides a lower bound on the second-largest eigenvalue of the adjacency matrix of a

${displaystyle d}$

-regular graph,^[1] meaning a graph in which every vertex has degree

${displaystyle d}$

. The reason for the interest in the second-largest eigenvalue is that the largest eigenvalue is guaranteed to be

${displaystyle d}$

due to

${displaystyle 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[edit]

Let

${displaystyle G}$

be a

${displaystyle d}$

-regular graph on

${displaystyle n}$

vertices with diameter

${displaystyle m}$

, and let

${displaystyle A}$

be its adjacency matrix. Let

${displaystyle lambda _{1}geq lambda _{2}geq cdots geq lambda _{n}}$

be its eigenvalues. Then

${displaystyle lambda _{2}geq 2{sqrt {d-1}}-{frac {2{sqrt {d-1}}-1}{lfloor m/2rfloor }}.}$

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[edit]

The intuition for the number

${displaystyle 2{sqrt {d-1}}}$

comes from considering the infinite

${displaystyle d}$

-regular tree.^[2] This graph is a universal cover of

${displaystyle d}$

-regular graphs, and it has spectral radius

${displaystyle 2{sqrt {d-1}}.}$

Saturation[edit]

A graph that essentially saturates the Alon–Boppana bound is called a Ramanujan graph. More precisely, a Ramanujan graph is a

${displaystyle d}$

-regular graph such that

${displaystyle |lambda _{2}|,|lambda _{n}|leq 2{sqrt {d-1}}.}$

A theorem by Friedman^[3] shows that, for every

${displaystyle d}$

and

${displaystyle epsilon >0}$

${displaystyle n}$

, a random

${displaystyle d}$

-regular graph

${displaystyle G}$

on

${displaystyle n}$

vertices satisfies

${displaystyle max{|lambda _{2}|,|lambda _{n}|}<2{sqrt {d-1}}+epsilon }$

with high probability. This means that a random

${displaystyle n}$

-vertex

${displaystyle d}$

-regular graph is typically “almost Ramanujan.”

First proof (slightly weaker statement)[edit]

We will prove a slightly weaker statement, namely dropping the specificity on the second term and simply asserting

${displaystyle lambda _{2}geq 2{sqrt {d-1}}-o(1).}$

Here, the

${displaystyle o(1)}$

term refers to the asymptotic behavior as

${displaystyle n}$

grows without bound while

${displaystyle d}$

remains fixed.

Let the vertex set be

${displaystyle V.}$

By the min-max theorem, it suffices to construct a nonzero vector

${displaystyle zin mathbb {R} ^{|V|}}$

such that

${displaystyle z^{text{T}}mathbf {1} =0}$

and

${displaystyle {frac {z^{text{T}}Az}{z^{text{T}}z}}geq 2{sqrt {d-1}}-o(1).}$

Pick some value

${displaystyle rin mathbb {N} .}$

For each vertex in

${displaystyle V,}$

define a vector

${displaystyle f(v)in mathbb {R} ^{|V|}}$

as follows. Each component will be indexed by a vertex

${displaystyle u}$

in the graph. For each

${displaystyle u,}$

if the distance between

${displaystyle u}$

and

${displaystyle v}$

is

${displaystyle k,}$

then the

${displaystyle u}$

-component of

${displaystyle f(v)}$

is

${displaystyle f(v)_{u}=w_{k}=(d-1)^{-k/2}}$

if

${displaystyle kleq r-1}$

and

${displaystyle 0}$

if

${displaystyle kgeq r.}$

We claim that any such vector

${displaystyle x=f(v)}$

satisfies

${displaystyle {frac {x^{text{T}}Ax}{x^{text{T}}x}}geq 2{sqrt {d-1}}left(1-{frac {1}{2r}}right).}$

To prove this, let

${displaystyle V_{k}}$

denote the set of all vertices that have a distance of exactly

${displaystyle k}$

from

${displaystyle v.}$

First, note that

${displaystyle x^{text{T}}x=sum _{k=0}^{r-1}|V_{k}|w_{k}^{2}.}$

Second, note that

${displaystyle x^{text{T}}Ax=sum _{uin V}x_{u}sum _{u’in N(u)}x_{u’}geq sum _{k=0}^{r-1}|V_{k}|w_{k}left[w_{k-1}+(d-1)w_{k+1}right]-(d-1)|V_{r-1}|w_{r-1}w_{r},}$

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

${displaystyle x^{text{T}}Axgeq 2{sqrt {d-1}}left(sum _{k=0}^{r-1}|V_{k}|w_{k}^{2}-{frac {1}{2}}|V_{r-1}|w_{r-1}^{2}right),}$

which, when combined with the fact that

${displaystyle |V_{k+1}|leq (d-1)|V_{k}|}$

for any

${displaystyle k,}$

yields

${displaystyle x^{text{T}}Axgeq 2{sqrt {d-1}}left(1-{frac {1}{2r}}right)sum _{k=0}^{r-1}|V_{k}|w_{k}^{2}.}$

The combination of the above results proves the desired inequality.

For convenience, define the

${displaystyle (r-1)}$

-ball of a vertex

${displaystyle v}$

to be the set of vertices with a distance of at most

${displaystyle r-1}$

from

${displaystyle v.}$

Notice that the entry of

${displaystyle f(v)}$

corresponding to a vertex

${displaystyle u}$

is nonzero if and only if

${displaystyle u}$

lies in the

${displaystyle (r-1)}$

-ball of

${displaystyle x.}$

The number of vertices within distance

${displaystyle k}$

of a given vertex is at most

${displaystyle 1+d+d(d-1)+d(d-1)^{2}+cdots +d(d-1)^{k-1}=d^{k}+1.}$

Therefore, if

${displaystyle ngeq d^{2r-1}+2,}$

then there exist vertices

${displaystyle u,v}$

with distance at least

${displaystyle 2r.}$

Let

${displaystyle x=f(v)}$

and

${displaystyle y=f(u).}$

It then follows that

${displaystyle x^{text{T}}y=0,}$

because there is no vertex that lies in the

${displaystyle (r-1)}$

-balls of both

${displaystyle x}$

and

${displaystyle y.}$

It is also true that

${displaystyle x^{text{T}}Ay=0,}$

because no vertex in the

${displaystyle (r-1)}$

-ball of

${displaystyle x}$

can be adjacent to a vertex in the

${displaystyle (r-1)}$

-ball of

${displaystyle y.}$

Now, there exists some constant

${displaystyle c}$

such that

${displaystyle z=x-cy}$

satisfies

${displaystyle z^{text{T}}mathbf {1} =0.}$

Then, since

${displaystyle x^{text{T}}y=x^{text{T}}Ay=0,}$

${displaystyle z^{text{T}}Az=x^{text{T}}Ax+c^{2}y^{text{T}}Aygeq 2{sqrt {d-1}}left(1-{frac {1}{2r}}right)(x^{text{T}}x+c^{2}y^{text{T}}y)=2{sqrt {d-1}}left(1-{frac {1}{2r}}right)z^{text{T}}z.}$

Finally, letting

${displaystyle r}$

grow without bound while ensuring that

${displaystyle ngeq d^{2r-1}+2}$

(this can be done by letting

${displaystyle r}$

grow sublogarithmically as a function of

${displaystyle n}$

) makes the error term

${displaystyle o(1)}$

in

${displaystyle n.}$

Second proof (slightly modified statement)[edit]

This proof will demonstrate a slightly modified result, but it provides better intuition for the source of the number

${displaystyle 2{sqrt {d-1}}.}$

Rather than showing that

${displaystyle lambda _{2}geq 2{sqrt {d-1}}-o(1),}$

we will show that

${displaystyle lambda =max(|lambda _{2}|,|lambda _{n}|)geq 2{sqrt {d-1}}-o(1).}$

First, pick some value

${displaystyle kin mathbb {N} .}$

Notice that the number of closed walks of length

${displaystyle 2k}$

is

${displaystyle operatorname {tr} A^{2k}=sum _{i=1}^{n}lambda _{i}^{2k}leq d^{2k}+nlambda ^{2k}.}$

However, it is also true that the number of closed walks of length

${displaystyle 2k}$

starting at a fixed vertex

${displaystyle v}$

in a

${displaystyle d}$

-regular graph is at least the number of such walks in an infinite

${displaystyle d}$

-regular tree, because an infinite

${displaystyle d}$

-regular tree can be used to cover the graph. By the definition of the Catalan numbers, this number is at least

${displaystyle C_{k}d(d-1)^{k},}$

where

${displaystyle C_{k}={frac {1}{k+1}}{binom {2k}{k}}}$

is the

${displaystyle k^{text{th}}}$

Catalan number.

It follows that

${displaystyle operatorname {tr} A^{2k}geq n{frac {1}{k+1}}{binom {2k}{k}}(d-1)^{k}}$

${displaystyle implies lambda ^{2k}geq {frac {1}{k+1}}{binom {2k}{k}}(d-1)^{k}-{frac {d^{2k}}{n}}.}$

Letting

${displaystyle n}$

grow without bound and letting

${displaystyle k}$

grow without bound but sublogarithmically in

${displaystyle n}$

yields

${displaystyle lambda geq 2{sqrt {d-1}}-o(1).}$

References[edit]