Constructing expander graphs by 2-lifts and discrepancy vs. spectral gap

Yonatan Bilu*, Nathan Linial

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

7 Scopus citations

Abstract

We present a new explicit construction for expander graphs with nearly optimal spectral gap. The construction is based on a series of 2-lift operations. Let G be a graph on n vertices. A 2-lift of G is a graph H on 2n vertices, with a covering map π: H → G. It is not hard to see that all eigenvalues of G are also eigenvalues of H. In addition, H has n "new" eigenvalues. We conjecture that every d-regular graph has a 2-lift such that all new eigen-values are in the range [-2√d - 1, 2√d - 1] (If true, this is tight, e.g. by the Alon-Boppana bound). Here we show that every graph of maximal degree d has a 2-lift such that all "new" eigenvalues are in the range [-c√d log3 d, c√d log3 d] for some constant c. This leads to a polynomial time algorithm for constructing arbitrarily large d-regular graphs, with second eigenvalue O(√d log 3 d). The proof uses the following lemma (Lemma 3.6): Let A be a real symmetric matrix with zeros on the diagonal. Let d be such that the l 1 norm of each row in A is at most d. Suppose that |xAy|/||x||||y|| ≤ α for every x,y ∈ {0,1}n with < x,y >= 0. Then the spectral radius of A is O(α(log(d/α) + 1)). An interesting consequence of this lemma is a converse to the Expander Mixing Lemma.

Original languageAmerican English
Pages (from-to)404-412
Number of pages9
JournalProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
StatePublished - 2004
EventProceedings - 45th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2004 - Rome, Italy
Duration: 17 Oct 200419 Oct 2004

Keywords

  • Discrepancy
  • Expander Graphs
  • Lifts
  • Lifts of Graphs
  • Signed Graphs

Fingerprint

Dive into the research topics of 'Constructing expander graphs by 2-lifts and discrepancy vs. spectral gap'. Together they form a unique fingerprint.

Cite this